jneem / teddyLinks
Rust library for fast multi-pattern searching.
☆87Updated 9 years ago
Alternatives and similar repositories for teddy
Users that are interested in teddy are comparing it to the libraries listed below
Sorting:
- SIMD algorithms for integer compression via bitpacking. This crate is a port of a C library called simdcomp.☆322Updated last week
- Rust FFI wrapper for CRoaring☆164Updated 2 weeks ago
- Rust library implementing xor-filters☆142Updated 2 years ago
- A suite of non-cryptographic hash functions for Rust.☆142Updated 3 years ago
- Counting occurrences of a given byte or UTF-8 characters in a slice of memory – fast☆231Updated 7 months ago
- Basic statistical functions on streams for Rust.☆88Updated 3 years ago
- A Rust data structure for efficient lower-bound lookups☆92Updated last year
- probe: Static probes for Rust☆102Updated 2 months ago
- Rust implementation for T1HA (Fast Positive Hash)☆90Updated last year
- ☆93Updated 5 years ago
- adaptive algorithms for rayon☆39Updated 5 years ago
- An idiomatic and fast QP-trie implementation in pure Rust.☆102Updated last year
- Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.☆154Updated last month
- Fast generic radix trie implemented in Rust☆214Updated 4 months ago
- A low level embedded information retrieval system.☆46Updated 5 years ago
- Native Rust port of Google's HighwayHash, which makes use of SIMD instructions for a fast and strong hash function☆175Updated 5 months ago
- Benchmarks for the nom, the Rust parser combinators library☆129Updated last year
- A HyperLogLog implementation in Rust.☆52Updated last month
- ☆49Updated 7 months ago
- Simple probabilistic data structures☆147Updated last week
- super simple in-memory blocking LSM for constant-size keys and values☆73Updated 10 months ago
- Rust library that provides helpers for testing resilience of IO operations☆145Updated 4 years ago
- Rust port of Google's SwissTable hash map☆58Updated 4 months ago
- High-throughput columnar serialization in Rust☆187Updated last month
- A benchmarking harness for concurrent key-value collections☆119Updated 2 years ago
- Rust bindings to google's cpuprofiler☆128Updated 6 years ago
- Find the load at which a benchmark falls over.☆36Updated 5 years ago
- This crate implements the "eytzinger" (aka BFS) array layout where a binary search tree is stored by layer (instead of as a sorted array)…☆25Updated last month
- A (mostly) lock-free concurrent work-stealing deque in Rust.☆244Updated 3 years ago
- Compact string type for zero-copy parsing☆264Updated 2 years ago