declanvk / blartLinks
☆60Updated 3 months ago
Alternatives and similar repositories for blart
Users that are interested in blart are comparing it to the libraries listed below
Sorting:
- A low-level MVCC file format for storing blobs.☆64Updated last year
- an extremely fast async mutex with alternative sync API☆80Updated 2 weeks ago
- Library safely exposing the io_uring API.☆70Updated last week
- A concurrent, append-only vector.☆208Updated 4 months ago
- A fast and flexible LRU map.☆198Updated 11 months ago
- A buffering MPSC queue.☆84Updated 3 weeks ago
- An Adaptive Radix Tree implementation.☆45Updated 4 months ago
- Perfect hashing for an imperfect world☆95Updated 3 months ago
- An asynchronous, multi-producer, single-consumer (MPSC) bounded channel that operates at tachyonic speeds☆152Updated last year
- Variant of Rust's std::Arc that supports atomic replacement of the value.☆116Updated 4 months ago
- Embedded Key-Value Storage Engine☆134Updated last month
- A concise, self-describing binary format written in Rust for Serde☆67Updated last year
- ☆76Updated last month
- Benchmarking library for stable Rust☆47Updated last week
- ☆64Updated 4 months ago
- Blazing fast immutable collection datatypes for Rust.☆128Updated 3 weeks ago
- A very fast Key-Value store in pure rust☆213Updated last week
- A pure-Rust two-level dynamic b-tree. This crate implements a compact set data structure that preserves its elements' sorted order and a…☆104Updated 2 weeks ago
- Lending iterators on stable Rust☆83Updated last year
- Utilities for working with shared slices of memory☆82Updated 6 months ago
- A trait + derive to recursively compute / print the memory usage of a data structure.☆39Updated last week
- An ε-copy serialization/deserialization framework for Rust☆167Updated last week
- (lifetime) GATs on stable Rust☆59Updated last year
- Fork of std::Arc with lots of utilities useful for FFI☆271Updated last month
- A Platform-less, Runtime-less Actor Computing Model☆126Updated last year
- Open a scope and then freeze it in time for future access.☆107Updated last year
- A faster Arc.☆76Updated last year
- An atomically updatable Arc for lock-free concurrency.☆188Updated last month
- A simple in-memory search for collections and key-value stores.☆80Updated last week
- Very fast lock-free, bounded, work-stealing queues with FIFO stealing and LIFO or FIFO semantic for the worker thread.☆88Updated last year