stusmall / murmur3Links
A rust implementation of murmur3
☆71Updated 10 months ago
Alternatives and similar repositories for murmur3
Users that are interested in murmur3 are comparing it to the libraries listed below
Sorting:
- A Rust data structure for efficient lower-bound lookups☆92Updated last year
- An idiomatic and fast QP-trie implementation in pure Rust.☆101Updated last year
- Rust FFI wrapper for CRoaring☆158Updated 3 weeks ago
- Integer encoding for primitive integer types: Supports varint/varint+zigzag and fixed-length integer encoding and decoding, and provides …☆68Updated last year
- Extended utilities for working with files and filesystems in Rust☆149Updated last year
- A suite of non-cryptographic hash functions for Rust.☆139Updated 3 years ago
- A growable bit-vector for Rust, optimized for size☆42Updated 6 months ago
- rust bindings of snmalloc☆139Updated 4 months ago
- Fast generic radix trie implemented in Rust☆203Updated 2 years ago
- Utilities for pinning☆97Updated last year
- Async stream for Rust and the futures crate.☆185Updated 2 weeks ago
- An on-disk hash table implementation☆124Updated 3 years ago
- Heap-based async timers☆214Updated last year
- bencher is just a port of the libtest (unstable) benchmark runner to Rust stable releases. `cargo bench` on stable. "Not a better bencher…☆90Updated 3 years ago
- Synchronization primitives for Futures and async/await based on intrusive collections☆180Updated last year
- skiplist☆142Updated 3 years ago
- ☆70Updated 4 years ago
- Generic Atomic<T> type for Rust☆237Updated 2 months ago
- Run closures in parallel☆114Updated 7 months ago
- A Vec of Bits☆181Updated 2 months ago
- Thread-safe object pool with automatic return and attach/detach semantics☆78Updated last month
- An updated version of linked-hash-map and friends☆122Updated 4 months ago
- A HashMap variant that spreads resize load across inserts☆192Updated 6 months ago
- Enhancement over Rust's `std::BinaryHeap`. Supports other than max heap.☆57Updated last year
- A futures abstraction that runs a set of futures which may complete in any order.☆90Updated 2 weeks ago
- Rust serializer library☆87Updated last year
- ☆125Updated 2 years ago
- Utilities for dealing with substructures within syn macros☆141Updated 3 months ago
- Rust implementation for T1HA (Fast Positive Hash)☆90Updated last year
- A concurrent hash table for Rust☆61Updated 5 years ago