fjall-rs / byteview
Thin immutable zero-copy byte slice
☆33Updated 3 weeks ago
Alternatives and similar repositories for byteview:
Users that are interested in byteview are comparing it to the libraries listed below
- File type detector☆34Updated 2 weeks ago
- madsim-inspired determinism for turmoil-based simulation tests☆38Updated 2 weeks ago
- Alternative future adapters that provide cancel safety.☆63Updated last week
- An ε-copy serialization/deserialization framework for Rust☆146Updated last month
- Value log implementation for key-value separated storage in safe Rust☆34Updated this week
- Library safely exposing the io_uring API.☆61Updated last month
- scan-resistant concurrent lazy LRU☆58Updated last year
- Glommio Messaging Framework (GMF) is a high-performance RPC system designed to work with the Glommio framework.☆53Updated last year
- Make any value Sync but only available on its original thread☆39Updated last month
- structured parallel execution for async Rust☆33Updated 8 months ago
- A Platform-less, Runtime-less Actor Computing Model☆122Updated last year
- A low-level I/O ownership and borrowing library☆100Updated 4 months ago
- Graceful shutdown util for Rust projects using the Tokio Async runtime.☆135Updated 6 months ago
- The simd optimized escape code☆53Updated this week
- A futures abstraction that runs a set of futures which may complete in any order.☆89Updated 3 weeks ago
- Static analysis tool for Rust library authors to set and verify which types from other libraries are allowed to be exposed in their publi…☆53Updated 3 weeks ago
- A contiguous-in-memory double-ended queue that derefs into a slice☆20Updated 8 months ago
- A flexible and convenient high-level mmap for zero-copy file I/O.☆111Updated last month
- An async version of iterator☆40Updated 10 months ago
- Fast JSON deserialization on borrowed data☆86Updated 2 months ago
- Modular, Asynchronous Implementation of a Log-Structured Merge Tree☆38Updated last month
- A pure-Rust two-level dynamic b-tree. This crate implements a compact set data structure that preserves its elements' sorted order and a…☆90Updated this week
- A memory efficient syntax tree for language developers☆57Updated 3 weeks ago
- A low-level MVCC file format for storing blobs.☆63Updated last year
- A Rust data structure for efficient lower-bound lookups☆90Updated last year
- A plugin for Criterion.rs to measure Linux perf events.☆42Updated last year
- super simple in-memory blocking LSM for constant-size keys and values☆69Updated 2 months ago
- Zero-cost bitsets over native Rust types☆76Updated 3 weeks ago
- Perfect hashing for an imperfect world☆88Updated 2 months ago
- Benchmarking Rust storage engines☆35Updated 2 weeks ago