intrusive-collections
Intrusive collections for Rust (linked list and red-black tree)
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
Intrusive collections for Rust (linked list and red-black tree)
HashMap-like containers that hold their key-value pairs in a user controllable order
Graph data structure library. Provides graph types and graph algorithms.
Map and set data structures whose keys are stored as ranges. Contiguous and overlapping ranges that map to the same value are coalesced into a single range
An n-dimensional array for general elements and for numerics. Lightweight array views and slicing; views support chunking and splitting.
A Priority Queue implemented as a heap with a function to efficiently change the priority of an item
'Small vector' optimization: store up to a small number of items on the stack