main-- / rust-eytzingerLinks
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
Alternatives and similar repositories for rust-eytzinger
Users that are interested in rust-eytzinger are comparing it to the libraries listed below
Sorting:
- An eventually consistent LRU designed for lock-free concurrent reads☆23Updated 2 years ago
- A flexible and convenient high-level mmap for zero-copy file I/O.☆115Updated 6 months ago
- A futures abstraction that runs a set of futures which may complete in any order.☆90Updated last month
- Consistent Hashing library in Rust☆18Updated 2 years ago
- super simple in-memory blocking LSM for constant-size keys and values☆71Updated 7 months ago
- The simd optimized escape code☆54Updated 2 weeks ago
- ☆14Updated 2 years ago
- Asynchronously speed-limiting multiple byte streams☆66Updated 11 months ago
- SIMD Floating point and integer compressed vector library☆80Updated last year
- scan-resistant concurrent lazy LRU☆63Updated 2 years ago
- Cross platform process information in Rust☆68Updated last month
- Lockfree resizeable concurrent hash table.☆54Updated 3 years ago
- ☆60Updated this week
- ☆39Updated 5 years ago
- A low-level I/O ownership and borrowing library☆104Updated last month
- Adaptive Radix Trie implementation for fixed-length keys☆54Updated last month
- ☆34Updated 11 months ago
- io traits/structs for tokio that automatically recover from potential disconnections/interruptions☆74Updated last year
- A growable bit-vector for Rust, optimized for size☆42Updated 7 months ago
- structured parallel execution for async Rust☆36Updated last year
- log for concurrent workloads, with support for atomic batches and in-order recovery☆37Updated 3 years ago
- Serde serializer for generating Starlark build targets☆69Updated this week
- Autogenerated Bytewise SIMD-Optimized Look-Up Tables☆38Updated last year
- A Rust data structure for efficient lower-bound lookups☆92Updated last year
- Efficient reference counted vector data structure is Rust☆18Updated 2 years ago
- ☆47Updated 4 years ago
- ☆21Updated 4 years ago
- A Rust-implementation of a stable Bloom filter for filtering duplicates out of data streams.☆42Updated 6 years ago
- A trait + derive to recursively compute / print the memory usage of a data structure.☆33Updated 7 months ago
- Providing wrapper types for safely performing panic-free checked arithmetic on instants and durations.☆15Updated 3 weeks ago