axiomhq / hypertwobitsLinks
HyperTwoBits implementation
☆13Updated 6 months ago
Alternatives and similar repositories for hypertwobits
Users that are interested in hypertwobits are comparing it to the libraries listed below
Sorting:
- Succinct data structures using very efficient rank and select☆119Updated 2 weeks ago
- Rust implementations of succinct data structures☆58Updated this week
- A trait + derive to recursively compute / print the memory usage of a data structure.☆33Updated 4 months ago
- An Adaptive Radix Tree implementation.☆39Updated last year
- Rust implementation of the FastLanes compression library☆109Updated last month
- Rust implementation of a fast, bounded, Zipf-distributed random number generator☆34Updated 4 months ago
- madsim-inspired determinism for turmoil-based simulation tests☆43Updated 2 months ago
- Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.☆139Updated last year
- PtrHash minimal perfect hash function, based of PTHash☆62Updated last month
- ☆35Updated 3 years ago
- Detect unused pub methods in a Rust workspace☆38Updated 4 months ago
- Out-of-memory sorting of large datasets map / reduce style processing☆47Updated 3 weeks ago
- Port of bbolt in Rust☆65Updated 8 months ago
- Benchmarking library for stable Rust☆45Updated 2 months ago
- Adaptive Radix Trie implementation for fixed-length keys☆53Updated 3 weeks ago
- An ε-copy serialization/deserialization framework for Rust☆149Updated 3 weeks ago
- Rust SDK for Apache Avro - a data serialization system.☆65Updated this week
- Pure-Rust implementation of Fast Static Symbol Tables string compression☆149Updated this week
- HyperLogLog implementations.☆24Updated 10 months ago
- A plugin for Criterion.rs to measure Linux perf events.☆43Updated last year
- A cross-platform and safe Rust API to create and manage memory mappings in the virtual address space of the calling process.☆68Updated last month
- A BK-tree implementation in Rust.☆40Updated last year
- Perfect hashing for an imperfect world☆91Updated 4 months 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)…☆24Updated 4 years ago
- Serialisable closures for Rust.☆64Updated 2 years ago
- Library safely exposing the io_uring API.☆63Updated 3 months ago
- ☆69Updated last month
- Collection of insert-only wait-free data-structures.☆29Updated last year
- Integer sets as fast, sorted, integer ranges with full set operations☆87Updated 3 weeks ago
- Track memory allocations by backtrace or originating thread☆43Updated 2 months ago