A pure-Rust two-level dynamic b-tree. This crate implements a compact set data structure that preserves its elements' sorted order and allows lookups of entries by value or sorted order position.
☆112Feb 14, 2026Updated 2 weeks ago
Alternatives and similar repositories for indexset
Users that are interested in indexset are comparing it to the libraries listed below
Sorting:
- A pure-rust(with zero dependencies) fenwick tree, for the efficient computation of dynamic prefix sums.☆21Jan 4, 2026Updated last month
- Provides truly zero-cost alternatives to Iterator::step_by for both incrementing and decrementing any type that satisfies RangeBounds<T: …☆13Jan 5, 2022Updated 4 years ago
- Rust wrapper type that implements hashing and comparison by pointer address☆36Mar 27, 2024Updated last year
- Tiny dynamic dispatch in Rust☆10Apr 17, 2023Updated 2 years ago
- An asynchronous, multi-producer, single-consumer (MPSC) bounded channel that operates at tachyonic speeds☆155Sep 23, 2024Updated last year
- A hash table with deque-like order and fast iteration; access items by key or sequence index☆16Jan 8, 2026Updated last month
- Rust generators implemented through async/await syntax☆12Sep 29, 2023Updated 2 years ago
- Exit cleanly with an exit code.☆13Sep 8, 2023Updated 2 years ago
- Non-standard integer types like u7, u9, u10, u63, i7, i9 etc.☆11Nov 11, 2024Updated last year
- Derive your Attribute Parsers☆13May 1, 2023Updated 2 years ago
- ☆20Feb 9, 2026Updated 3 weeks ago
- SIMD-optimized B+ Tree implementation that uses integer keys☆93Jul 13, 2025Updated 7 months ago
- Rust traits for key comparison in maps.☆39Feb 14, 2025Updated last year
- Jump Consistent Hash implementation for Rust☆16Apr 16, 2024Updated last year
- A Rust crate for a Bucket Queue data structure that can be used as a Priority Queue.☆19Nov 20, 2018Updated 7 years ago
- Zero-copy, no-std proquint encoding and decoding☆13May 7, 2023Updated 2 years ago
- Write simple proc-macros inline with other source code.☆20Nov 24, 2024Updated last year
- Async task switching for cooperative multitasking in single thread environments with no_std support.☆17Feb 9, 2022Updated 4 years ago
- 🌾 A pretty fast text rope☆313Jan 13, 2026Updated last month
- A big integer library in Rust with good performance.☆107Nov 7, 2023Updated 2 years ago
- Fast and compact sets of bytes or ASCII characters☆28Mar 13, 2021Updated 4 years ago
- Approximate Quantiles with Configurable Worst Case Error☆16Mar 8, 2022Updated 3 years ago
- An alternative rust async runtime.☆59Dec 15, 2025Updated 2 months ago
- lock-free B+ tree☆311Sep 8, 2024Updated last year
- RcLite: small, fast, and memory-friendly reference counting for Rust☆197Dec 23, 2025Updated 2 months ago
- A tiny Rust std-lib for Linux x86_64 and aarch64☆54Feb 12, 2026Updated 2 weeks ago
- Count lines of code across your entire dependency tree☆22May 13, 2024Updated last year
- Space Efficient Pretty Printer☆17Apr 15, 2022Updated 3 years ago
- printf reimplemented in Rust☆32Jan 25, 2026Updated last month
- This crate provides Discrete Interval Tree Data-Structures, which are based off BTreeMap☆52Oct 18, 2025Updated 4 months ago
- A Rust data structure for efficient lower-bound lookups☆92Feb 26, 2024Updated 2 years ago
- A callback-based Event Loop☆272Feb 13, 2026Updated 2 weeks ago
- Parallelo Parallel Library (PPL) is a small parallel framework that brings Structured Parallel Programming in Rust.☆79Sep 8, 2025Updated 5 months ago
- ☆150May 20, 2023Updated 2 years ago
- ☆19Nov 21, 2023Updated 2 years ago
- A crate to help you go wide. By which I mean use SIMD stuff.☆472Feb 6, 2026Updated 3 weeks ago
- Deserialization logic for efficiently processing Clang's `-ast-dump=json` format☆152Dec 20, 2025Updated 2 months ago
- ☆34Oct 17, 2024Updated last year
- An immutable data structure with O(1) append, prepend, and concat time complexity.☆35Feb 3, 2026Updated last month