Expand description

Colletions are general-purpose or specialized data structures in which elements store.


A space efficient probablistic data structures offering an approximate containment test with only false positive error.

A double-ended queue (abbreviated to deque), for which elements can be added or remove from both back and front ends.

A hash map implemented with separate chaining collision resolution strategy.

A hash set implementation based on HashMap.

A queue-like data structure implement through std::vec::Vec.

A singly-linked list with owned nodes.

A stack-like data structure implemented through a Vec.