A resizable array, implemented as a contiguous growable array type.

A hash map implemented with quadratic probing and SIMD lookup.

A doubly-linked list.

A priority queue implemented with a binary heap.

A hash set implemented as a HashMap where the value is ()

A map based on a B-Tree.

A set based on a B-Tree.

A double-ended queue implemented with a growable ring buffer.

A basic binary search tree implementation.

A prefix tree for efficient storage and retrieval of strings.

A simple graph representation using an adjacency list.

A simple stack implemented with a Vec.

A simple queue implemented with a VecDeque.

A double-ended queue implemented with a VecDeque.

A ring buffer implemented with a fixed-size array.

A probabilistic data structure to test whether an element is a member of a set.

A tree data structure for storing intervals, or segments.

A tree data structure that provides efficient methods for calculation and manipulation of prefix sums.

A cache that stores a fixed number of items and discards the least recently used items first.

A self-balancing binary search tree.