11 Repositories
Rust finite Libraries
Rust implementations of finite-field arithmetic based on big integers with configurable limb sizes
multiprecision TODO: rewrite readme implement CIOS for 16-bit limbs All operations are in little-endian form (where the digit in memory at the smalles
A 2D Rust-Based Finite Element Simulator
Magnetite A 2D linear-elastic FEA program for isotropic materials, built in Rust. Overview Magnetite is a simple linear-elastic mechanical solver for
Provably optimal zero-copy parsers using nondeterministic finite automata.
inator: an evil parsing library You supply the evil plan; we supply the -inator! or, Provably Optimal Zero-Copy Parsers with Nondeterministic Finite A
Rust implementation of behavior trees.
Bonsai 盆栽 Rust implementation of Behavior Trees Contents Quick intro to Behavior Trees Concepts Examples Development Guide Kanban Board Honorable Ment
🐎 A fast implementation of the Aho-Corasick algorithm using the compact double-array data structure. (Python wrapper for daachorse)
python-daachorse daachorse is a fast implementation of the Aho-Corasick algorithm using the compact double-array data structure. This is a Python wrap
A library for advanced finite element computations in Rust
A Rust library for building advanced applications with the Finite Element Method (FEM). Although developed with a special emphasis on solid mechanics
Source code for our paper "Higher-order finite elements for embedded simulation"
Higher-order Finite Elements for Embedded Simulation This repository contains the source code used to produce the results for our paper: Longva, A., L
🐎 Daac Horse: Double-Array Aho-Corasick in Rust
🐎 daachorse Daac Horse: Double-Array Aho-Corasick Overview A fast implementation of the Aho-Corasick algorithm using Double-Array Trie. Examples use
A fast implementation of Aho-Corasick in Rust.
aho-corasick A library for finding occurrences of many patterns at once with SIMD acceleration in some cases. This library provides multiple pattern s
Represent large sets and maps compactly with finite state transducers.
fst This crate provides a fast implementation of ordered sets and maps using finite state machines. In particular, it makes use of finite state transd
An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
regex A Rust library for parsing, compiling, and executing regular expressions. Its syntax is similar to Perl-style regular expressions, but lacks a f