Ordered Hashmap implementation to overcome arbitrary order of key-values problem in Rust
An insertion-ordered hash map that provides O(1) (amortized) insertion, lookup, update and removal.
A CLOB order matching engine with price-time priority, limit/market orders, and four time-in-force policies.
Fast Binary Encoding (FBE) for Rust - High-performance, zero-copy binary serialization with 100% C++ FBE parity and binary compatibility
Rust port of omspy — order management primitives
HashMap which preserves insertion order
Arguably a Terminal API Client. Feature-full, free, open-source, offline and account-less.
High-performance Central Limit Order Book (CLOB) implementation with nanosecond-level matching
Iterator adaptors for efficient SQL-like joins
IndexMap and IndexSet powered by indexmap (SwissTable) and the axhash engine.
Stream combinators with ordering guarantees for async Rust
A utility library for building SQL queries