domodwyer / interavlLinks
An optimised interval tree for efficient interval stabbing
☆15Updated 3 weeks ago
Alternatives and similar repositories for interavl
Users that are interested in interavl are comparing it to the libraries listed below
Sorting:
- Succinct data structures using very efficient rank and select☆126Updated 2 months ago
- Fast and scalable minimal perfect hashing for massive key sets☆142Updated last year
- Fast hierarchical agglomerative clustering in Rust.☆102Updated 5 months ago
- Collection of succinct data structures in Rust☆99Updated last month
- ☆36Updated 3 years ago
- Integer sets as fast, sorted, integer ranges with full set operations☆94Updated last month
- Rust libraries and programs focused on succinct data structures☆148Updated this week
- PtrHash minimal perfect hash function☆70Updated 2 weeks ago
- Histograms with a configurable number of buckets, and a terminal-friendly Display.☆31Updated last year
- An ε-copy serialization/deserialization framework for Rust☆154Updated this week
- Multi backend HashMap for higher performance on different key space sizes☆28Updated 8 months ago
- ☆272Updated 4 months ago
- A Rust data structure for efficient lower-bound lookups☆92Updated last year
- Bit-vectors and bit-slices for Rust☆29Updated 4 years ago
- A vec-backed tree structure with tree-specific generational indexes.☆40Updated last year
- Autogenerated Bytewise SIMD-Optimized Look-Up Tables☆35Updated last year
- Out-of-memory sorting of large datasets map / reduce style processing☆46Updated this week
- FM-index for Rust☆23Updated 4 months ago
- A big integer library in Rust with good performance.☆105Updated last year
- Rust macro to make recursive function run on the heap (i.e. no stack overflow).☆24Updated 3 months ago
- Non-interleaving multithreaded output queue☆72Updated 3 weeks ago
- Procedural macro to easily write higher-order strategies in proptest.☆46Updated last month
- Faster integer division and modulus operations☆87Updated 2 months ago
- A trait + derive to recursively compute / print the memory usage of a data structure.☆33Updated 7 months ago
- Rust implementations of succinct data structures☆59Updated last week
- Perfect hashing for an imperfect world☆93Updated last week
- Map data structure whose keys are stored as ranges☆94Updated last month
- Rust interface for Linux futexes, the fast user-space locking primitive.☆88Updated last year
- Parallel Barnes-Hut t-SNE implementation written in Rust.☆87Updated 2 months ago
- Rust bindings to parasail, a SIMD-accelerated pairwise sequence alignment library.☆21Updated 9 years ago