komora-io / inline-arrayLinks
☆12Updated 4 months ago
Alternatives and similar repositories for inline-array
Users that are interested in inline-array are comparing it to the libraries listed below
Sorting:
- scraps of a potential language☆38Updated 4 years ago
- constant-size associative container backed by a simple array☆20Updated 2 years ago
- trigger io::Error's in test, and annotate their source☆31Updated 2 years ago
- high-efficiency concurrent reclamation☆38Updated last year
- The simd optimized escape code☆54Updated 3 weeks ago
- Set theory applied on sorted and deduplicated slices.☆47Updated 3 years ago
- Wraps around a futures::Spawn and adds diagnostics to it☆32Updated 5 years ago
- wrap errors with automatic backtrace capture and print-on-result-unwrap☆32Updated last year
- An experimental columnar arena☆43Updated last year
- wait-free 4-level 64-bit pagetable for contiguous low-contention concurrent metadata☆41Updated last year
- Fast and compact sets of bytes or ASCII characters☆28Updated 4 years ago
- Rust closures you can transfer over an FFI boundary☆27Updated 5 years ago
- A rust library for reusing heap allocations☆24Updated 5 years ago
- Rust crate to use process file descriptors (pidfd) for Linux☆50Updated 7 months ago
- super simple in-memory blocking LSM for constant-size keys and values☆73Updated 10 months ago
- Queue futures to run concurrently, in the order they're spawned, and with global and group limits.☆67Updated this week
- A safe and reliable process manager☆43Updated 5 years ago
- Memory validation framework for Rust☆71Updated 2 months ago
- ☆14Updated 2 years ago
- Adaptive Radix Trie implementation for fixed-length keys☆54Updated 4 months ago
- A lightweight, no-std, object-safe, serialization-only framework for Rust☆101Updated 2 months ago
- ☆47Updated 5 years ago
- Find the load at which a benchmark falls over.☆36Updated 5 years ago
- cross-platform Rust API for memory mapped IO☆42Updated last year
- Human-friendly indexed collections☆56Updated 2 months ago
- Serializer and Deserializer adapters that avoid stack overflows by dynamically growing the stack☆35Updated this week
- ☆39Updated 5 years ago
- Fast, vector-based map implementation that preserves insertion order.☆15Updated 5 years ago
- A futures abstraction that runs a set of futures which may complete in any order.☆91Updated 2 months ago
- ☆36Updated last year