PsiACE / bitsvecLinks
A bit vector with the Rust standard library's portable SIMD API.
☆41Updated 2 years ago
Alternatives and similar repositories for bitsvec
Users that are interested in bitsvec are comparing it to the libraries listed below
Sorting:
- Very fast lock-free, bounded, work-stealing queues with FIFO stealing and LIFO or FIFO semantic for the worker thread.☆88Updated last year
- Asynchronously speed-limiting multiple byte streams☆67Updated last year
- A memcomparable serialization format.☆24Updated 2 years ago
- ☆33Updated last year
- ☆21Updated 3 years ago
- rust bindings of snmalloc☆146Updated 3 months ago
- Lending iterators on stable Rust☆83Updated last year
- A `Send` version of `Iterator::chunks`☆20Updated last month
- A flexible and convenient high-level mmap for zero-copy file I/O.☆117Updated 10 months ago
- Thread-safe clone-on-write container for fast concurrent writing and reading.☆49Updated 2 years ago
- An efficient runtime for asynchronous applications in Rust.☆43Updated 3 years ago
- A rust implementation of lock free cuckoo hashmap☆69Updated 11 months ago
- Enhancement over Rust's `std::BinaryHeap`. Supports other than max heap.☆59Updated last year
- Lockfree resizeable concurrent hash table.☆54Updated 4 years ago
- Yet Another Async Runtime (yaar) focused on forbid(unsafe) and scalability☆81Updated 4 years ago
- A reader-writer lock that provides extremely fast read access without starving writers☆86Updated 2 years ago
- ☆52Updated last year
- super simple in-memory blocking LSM for constant-size keys and values☆73Updated 10 months ago
- (lifetime) GATs on stable Rust☆59Updated last year
- Local-affinity first NUMA-aware allocator with optional fallback.☆29Updated 4 years ago
- A benchmarking harness for concurrent key-value collections☆119Updated 2 years ago
- A lock-free, append-only atomic pool.☆68Updated 3 years ago
- structured parallel execution for async Rust☆37Updated last year
- A d-ary heap in Rust☆21Updated 3 months ago
- io traits/structs for tokio that automatically recover from potential disconnections/interruptions☆73Updated 3 weeks ago
- A lock-free thread-safe concurrent SkipMap implementation based on ARENA skiplist which helps develop MVCC memtable for LSM-Tree.☆63Updated 10 months ago
- A Rust implementation of two segment trees and a fenwick tree.☆65Updated 7 years ago
- Mea provides async primitives and combinators that are runtime agnostic.☆137Updated last week
- ☆63Updated last week
- A procedural macro for defining nom combinators in simple DSL☆46Updated 11 months ago