Simple linear memory array stored on the heap with a size determined at runtime.
A library that provides a safe experimental linear algebra library based on arrays intead of on the heap
Construct a Cartesian Tree from a Slice in Linear Time
A hash map optimized for small collections with automatic stack-to-heap transition
Rust Algorithms
Pure-Rust numerical algorithms library — high performance with SIMD support while also supporting no-std for embedded and WASM targets.
A strict generational arena with static/dynamic multi-mutable access, optimized for zero-allocation safety validation and cache-friendly layout.
An inline SIMD accelerated hashmap designed for small amount of data.
N-dimensional array type and foundational primitives for ferrum
Rust wrapper for the "listpack" data structure created and maintained for Redis
A collection of data structures optimized for small-buffer scenarios that reside on the stack and seamlessly spill to the heap.
A hardware-oriented hybrid sorting engine achieving near-linear scaling via arithmetic routing and parallel SoA.