A doubly linked list that owns the nodes and can pre-allocate
memory for performance. This linked list allows pushing and
popping elements at either end in constant time with the same API
as std::collections::LinkedList.
A fast contiguous growable array of bits allocated on the heap
that allows storing and manipulating an arbitrary number of
bits. This collection is backed by a Vector<u8> which
manages the underlying memory.
A fast and flexible LinkedHashMap that combines a std::collections::HashMap and a
LinkedList for O(1) inserts, lookups and deletes along with a
predictable iteration order.