HashMap which preserves insertion order
An Evicting LRU cache supporting prune hooks
An insertion-order-preserving hash map with O(1) `.remove`
A linked hash table implementation for insert-order iteration and efficient lookups.
An insertion-ordered hash map that provides O(1) (amortized) insertion, lookup, update and removal.
Common data structures for the BHC compiler
A collection of data structures optimized for small-buffer scenarios that reside on the stack and seamlessly spill to the heap.
Order-preserving linked hash map with O(1) reordering
High-performance scoped symbol table for compilers, linters, and LSP servers — backed by axhash-map
A pure Rust library for reading and writing CAD files in DXF format (ASCII and Binary)
Map with Vec implementation, without ordering or hashing (for Serde deserialization)
Zero-overhead, compile-time MSSQL service for Rust — stored procedures, async CRUD, connection pooling, static dispatch
No description provided.
No description provided.