zakarumych / amityLinks
Concurrency algorithms
☆11Updated 4 months ago
Alternatives and similar repositories for amity
Users that are interested in amity are comparing it to the libraries listed below
Sorting:
- Unbuffered and unlocked I/O streams☆45Updated 5 months ago
- A sanity checker for global allocations in Rust☆51Updated 3 weeks ago
- Faster integer division and modulus operations☆87Updated 2 months ago
- A Rust library for runtime-checked linearish types☆35Updated 2 years ago
- Zero-cost bitsets over native Rust types☆78Updated 4 months ago
- A parser and evaluator for Rust cfg() expressions. Targets as of Rust 1.58.0 are supported.☆43Updated 3 weeks ago
- Integer types with customizable niche values☆48Updated 9 months ago
- ☆23Updated 7 years ago
- Generic SIMD abstractions for Rust.☆46Updated 2 years ago
- SegVec data structure for rust. Similar to Vec, but allocates memory in chunks of increasing size.☆38Updated last year
- Rust macro to make recursive function run on the heap (i.e. no stack overflow).☆24Updated 2 months ago
- A generic, fixed-size, associative cache☆40Updated 9 months ago
- cross-platform Rust API for memory mapped IO☆42Updated last year
- Exposes arch-specific intrinsics as safe function (via cfg).☆58Updated 2 weeks ago
- impl fallible collections in rust, quite as describe in RFC 2116☆39Updated 9 months ago
- Efficient byte-stream pipe buffer☆43Updated last year
- Typed index version of Rust slice and Vec containers☆70Updated last week
- A fast, small, full-featured, no-std compatible oneshot channel☆60Updated last year
- A growable bit-vector for Rust, optimized for size☆42Updated 6 months ago
- Nudging the compiler to auto-vectorize things☆75Updated 2 years ago
- A thread pool for running multiple tasks on a configurable group of threads.☆51Updated last year
- Extensions for the Rust standard library☆40Updated last year
- Rust String type with configurable byte storage.☆35Updated 11 months ago
- A Rust data structure for efficient lower-bound lookups☆92Updated last year
- A futures abstraction that runs a set of futures which may complete in any order.☆90Updated 3 weeks ago
- Track memory allocations by backtrace or originating thread☆44Updated 4 months ago
- Multi backend HashMap for higher performance on different key space sizes☆28Updated 7 months ago
- ☆58Updated 2 years ago
- A trait + derive to recursively compute / print the memory usage of a data structure.☆33Updated 6 months ago
- ☆35Updated 7 months ago