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
A K.I.S.S. implementation of log-structured merge trees (LSM-trees/LSMTs)
An efficient dynamic capacity vector with pinned element guarantees
A collection of succinct data structures supported by fast implementations of rank and select queries
A lightweight rules engine for building IFTTT-style automation and data processing pipelines in Rust. Define rules with JSONLogic conditions, execute actions, and chain workflows.
Strongly typed APIs for non-empty collections, slices, iterators, and more
High-performance Rust implementation of JSONata query and transformation language
implementing xor filters - faster and smaller than bloom and cuckoo filters
gitoxide project dealing with finding names for revisions and parsing specifications
The fastest Bloom filter in Rust. No accuracy compromises. Full concurrency support and compatible with any hasher.
A Vec-like collection which guarantees stable indices and features O(1) element deletion (semantically similar to Vec<Option<T>>). Useful for allocations in graphs or similar data structures.