Showing 6 of 6 projects
A high-performance string library leveraging SIMD and SWAR to accelerate search, hashing, sorting, and edit distances across C, C++, Python, Rust, and more.
A Go implementation of a trie data structure with algorithms for extremely fast prefix and fuzzy string searching.
Rust edit distance library accelerated with SIMD for fast Hamming, Levenshtein, and Damerau-Levenshtein calculations.
A memory-efficient Java implementation of a string-keyed trie (radix tree) for fast lookups with minimal memory usage.
A Go library implementing a space-optimized prefix tree (trie) for efficient string key operations and serverless-friendly serialization.
A Go implementation of multi-string pattern matching using Trie data structures, inspired by the Aho-Corasick algorithm.
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.