jonhoo / ordsearchLinks
A Rust data structure for efficient lower-bound lookups
☆90Updated last year
Alternatives and similar repositories for ordsearch
Users that are interested in ordsearch are comparing it to the libraries listed below
Sorting:
- ☆124Updated 2 years ago
- An implementation of union-find / congruence-closure in Rust. Extracted from rustc for independent experimentation.☆158Updated last year
- An on-disk hash table implementation☆121Updated 3 years ago
- Safe, zero-cost downcasting for limited compile-time specialization.☆165Updated last week
- A fast and flexible LRU map.☆185Updated 5 months ago
- A `VecDeque` (and `Vec`) variant that spreads resize load across pushes.☆107Updated 5 months ago
- Faster integer division and modulus operations☆87Updated 2 years ago
- Synchronization primitives for Futures and async/await based on intrusive collections☆179Updated last year
- An ε-copy serialization/deserialization framework for Rust☆149Updated 2 weeks ago
- Fork of std::Arc with lots of utilities useful for FFI☆238Updated this week
- Library safely exposing the io_uring API.☆63Updated 2 months ago
- 🐏 rpmalloc global memory allocator for Rust 🦀☆149Updated 3 months ago
- A working Rust example for how to implement Borrow for complex keys☆66Updated last year
- ☆57Updated last year
- A simple bitset container for Rust☆143Updated last month
- Interning of data in rust☆101Updated 3 months ago
- ☆209Updated last month
- A HashMap variant that spreads resize load across inserts☆192Updated 4 months ago
- Native Rust port of Google's HighwayHash, which makes use of SIMD instructions for a fast and strong hash function☆166Updated 2 months ago
- A futures abstraction that runs a set of futures which may complete in any order.☆90Updated 2 months ago
- a lock-free concurrent slab (experimental)☆285Updated 5 months ago
- An updated version of linked-hash-map and friends☆115Updated 2 months ago
- A reader-writer lock that provides extremely fast read access without starving writers☆80Updated last year
- A sentinel-based, heapless, `Vec`-like type.☆69Updated 5 years ago
- A fast, concurrent string interner☆150Updated 10 months ago
- A lock-free, append-only atomic pool.☆67Updated 3 years ago
- A Rust implementation of two segment trees and a fenwick tree.☆66Updated 6 years ago
- Map data structure whose keys are stored as ranges☆88Updated 5 months ago
- Better reference counted strings for Rust☆126Updated 11 months ago
- Async stream for Rust and the futures crate.☆183Updated 2 weeks ago