A fast implementation of Aho-Corasick in Rust.
-
Updated
Feb 27, 2026 - Rust
#
substring-matching
Here are 8 public repositories matching this topic...
🐎 A fast implementation of the Aho-Corasick algorithm using the compact double-array data structure in Rust.
search rust finite-state-machine text-processing aho-corasick no-std double-array substring-matching
-
Updated
Apr 12, 2026 - Rust
🐎 A fast implementation of the Aho-Corasick algorithm using the compact double-array data structure. (Python wrapper for daachorse)
-
Updated
Apr 1, 2026 - Rust
Fast string seaching for node.js ( aho-corasick algorithm )
-
Updated
Jan 24, 2024 - Rust
Benchmark various aho-carosick node libraries against large corpus text and pattern lengths
-
Updated
Dec 6, 2020 - JavaScript
Bash quit/kill tool for macOS and Linux: fuzzy matching and SIGINT→SIGTERM→SIGKILL. macOS adds .app bundles and AppleScript; Linux uses the same process-focused ladder.
macos linux dotfiles bash zsh cli productivity automation applescript fzf fuzzy-matching signals shell-script sigterm process-management pgrep sigkill macos-apps killall substring-matching
-
Updated
Apr 9, 2026 - Shell
Implementations of some algorithms in C++
search hashing math pattern-matching hash sort sorting-algorithms hashing-algorithm factorization sorting-algorithms-implemented sort-algorithms searching-algorithms sorting-algorithm fibonacci-sequence exponentiation algorithms-and-data-structures greatest-common-divisor substring-matching
-
Updated
Apr 11, 2023 - C++
NormNumSuM (normalised Number of Substring Movements) is a string comparison algorithm designed to be token order invariant.
-
Updated
Dec 7, 2022 - Python
Improve this page
Add a description, image, and links to the substring-matching topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the substring-matching topic, visit your repo's landing page and select "manage topics."