srijs / rust-gearhashLinks
Fast, SIMD-accelerated hash function for content-defined chunking
☆26Updated 5 years ago
Alternatives and similar repositories for rust-gearhash
Users that are interested in rust-gearhash are comparing it to the libraries listed below
Sorting:
- super simple in-memory blocking LSM for constant-size keys and values☆73Updated 9 months ago
- A compressed bitmap format optimized for small, sparse sets of u32s with zero-copy querying.☆47Updated last week
- Build SQLite virtual file systems (VFS) by implementing a simple Rust trait.☆96Updated 3 years ago
- A fast implementation of single-pattern substring search using SIMD acceleration.☆99Updated last month
- log for concurrent workloads, with support for atomic batches and in-order recovery☆37Updated 3 years ago
- Rust library implementing xor-filters☆142Updated 2 years ago
- SIEVE cache replacement policy for Rust.☆24Updated last week
- scan-resistant concurrent lazy LRU☆63Updated 2 years ago
- ☆21Updated 4 years ago
- adaptive algorithms for rayon☆39Updated 5 years ago
- The simd optimized escape code☆54Updated 2 weeks ago
- high-efficiency concurrent reclamation☆38Updated last year
- Logical clocks implementation in Rust☆45Updated 6 years ago
- Cayley hashing as in "Navigating in the Cayley Graph of SL₂(𝔽ₚ)"☆20Updated 2 years ago
- wrap errors with automatic backtrace capture and print-on-result-unwrap☆32Updated last year
- wait-free 4-level 64-bit pagetable for contiguous low-contention concurrent metadata☆41Updated last year
- Rust bindings for the Linux userfaultfd functionality☆46Updated 2 months ago
- ☆12Updated 4 months ago
- scraps of a potential language☆38Updated 4 years ago
- Adaptive Radix Trie implementation for fixed-length keys☆54Updated 4 months ago
- trigger io::Error's in test, and annotate their source☆31Updated 2 years ago
- ☆47Updated 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 3 weeks ago
- Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.☆150Updated this week
- A flexible byte pool.☆18Updated 2 years ago
- A lightweight, no-std, object-safe, serialization-only framework for Rust☆101Updated last month
- Composable, lock-free, allocation-light data structures☆61Updated 7 years ago
- WASI implementation in Rust☆31Updated 6 years ago
- Rust crate for accepting general reference-like values without proliferating generics.☆37Updated 9 years ago
- A HyperLogLog implementation in Rust.☆52Updated 3 weeks ago