Module collections

Source

Modules§

binary_heapstd
A priority queue implemented with a binary heap.
btree_mapstd
An ordered map based on a B-Tree.
btree_setstd
An ordered set based on a B-Tree.
hash_mapstd
A hash map implemented with quadratic probing and SIMD lookup.
hash_setstd
A hash set implemented as a HashMap where the value is ().
linked_liststd
A doubly-linked list with owned nodes.
vec_dequestd
A double-ended queue (deque) implemented with a growable ring buffer.

Structs§

BTreeMapstd
An ordered map based on a B-Tree.
BTreeSetstd
An ordered set based on a B-Tree.
BinaryHeapstd
A priority queue implemented with a binary heap.
HashMapstd
A hash map implemented with quadratic probing and SIMD lookup.
HashSetstd
A hash set implemented as a HashMap where the value is ().
LinkedListstd
A doubly-linked list with owned nodes.
TryReserveErrorstd
The error type for try_reserve methods.
VecDequestd
A double-ended queue implemented with a growable ring buffer.

Enums§

Boundstd
An endpoint of a range of keys.
TryReserveErrorKindExperimentalstd
Details of the allocation that caused a TryReserveError