bloomfilter
Bloom filter for space-efficient probabilistic set membership tests with configurable false-positive rates
Posts from every feed QUEST has found across the web — blogs, news, podcasts, channels and more.
Lib.rs Rust implementations of particular ways of organizing data suited for specific purposes
Bloom filter for space-efficient probabilistic set membership tests with configurable false-positive rates
A ring buffer with a fixed capacity, which can be stored on the stack
Efficient string interner with minimal memory footprint and fast access to the underlying strings
A directed acyclic graph data structure library. It is Implemented on top of petgraph's Graph data structure and attempts to follow similar conventions where suitable.
Integer sets as fast, sorted integer ranges; Maps with integer-range keys; Full set operations
A HashMap wrapper that holds key-value pairs in insertion order
Hybrid typenum-based and const generic array types designed to provide the flexibility of typenum-based expressions while also allowing interoperability and a transition path to const generics
Arena based tree structure by using indices instead of reference counted pointers
Mixed Integer Linear Programming for Rust, with an user-friendly API. This crate allows modeling LP problems, and lets you solve them with various solvers.
Append-only collections for Rust where borrows to entries can outlive insertions
Maps where keys borrow from values, including bijective and trijective maps
in Rust for fast insertion and removal, including a normal skiplist, ordered skiplist, and skipmap