jkelleyrtp / bumpslab
A slab allocator with stable references
☆15Updated 2 years ago
Alternatives and similar repositories for bumpslab:
Users that are interested in bumpslab are comparing it to the libraries listed below
- An async version of iterator☆40Updated 9 months ago
- A parser and evaluator for Rust cfg() expressions. Targets as of Rust 1.58.0 are supported.☆40Updated last month
- Fast Function Dispatch: Improving the performance of Rust's dynamic function calls☆32Updated 5 months ago
- cross-platform Rust API for memory mapped IO☆42Updated 10 months ago
- Serde serializer for generating Starlark build targets☆66Updated last week
- Rust String type with configurable byte storage.☆34Updated 6 months ago
- A more flexible version of the Rust `scoped-tls` library☆18Updated 5 months ago
- Thread-unsafe async runtime☆27Updated 4 months ago
- ☆24Updated last year
- A generic, fixed-size, associative cache☆40Updated 4 months ago
- structured parallel execution for async Rust☆33Updated 7 months ago
- Thread-safe clone-on-write container for fast concurrent writing and reading.☆49Updated 2 years ago
- A simple macro to create correct opaque pointers☆22Updated 3 years ago
- Utilities for encoding and decoding frames using `async/await`.☆24Updated last year
- Rust closures you can transfer over an FFI boundary☆25Updated 4 years ago
- `smol` integrations with `hyper`☆14Updated 5 months ago
- Unbuffered and unlocked I/O streams☆45Updated 2 weeks ago
- An alternative `std`-like implementation built on origin☆26Updated last week
- bytes::BufMut implementation to count buffer size☆22Updated 2 weeks ago
- A primitive for writing structural search and replace programs for rust☆31Updated 8 months ago
- An object system for Rust based on relative pointers☆38Updated 2 years ago
- Very fast lock-free, bounded, work-stealing queues with FIFO stealing and LIFO or FIFO semantic for the worker thread.☆70Updated 6 months ago
- A low-level I/O ownership and borrowing library☆101Updated 3 months ago
- ☆33Updated 2 years ago
- Linked Atomic Random Insert Vector: a thread-safe, self-memory-managed vector with no guaranteed sequential insert.☆56Updated last year
- Take a value atomically once.☆28Updated 2 years ago
- Serializer and Deserializer adapters that avoid stack overflows by dynamically growing the stack☆33Updated 2 weeks ago
- Simple bitset with small-set (single-word) optimization☆19Updated 9 months ago
- Queue futures to run concurrently, in the order they're spawned, and with global and group limits.☆58Updated this week
- A Rust memory allocator for large slices that don't escape the stack.☆30Updated 2 years ago