Modules§
- binary_
heap std
and non-no_global_oom_handling
A priority queue implemented with a binary heap. - btree_
map std
and non-no_global_oom_handling
An ordered map based on a B-Tree. - btree_
set std
and non-no_global_oom_handling
An ordered set based on a B-Tree. - hash_
map std
A hash map implemented with quadratic probing and SIMD lookup. - hash_
set std
A hash set implemented as aHashMap
where the value is()
. - linked_
list std
and non-no_global_oom_handling
A doubly-linked list with owned nodes. - vec_
deque std
and non-no_global_oom_handling
A double-ended queue (deque) implemented with a growable ring buffer.
Structs§
- BTree
Map std
An ordered map based on a B-Tree. - BTree
Set std
An ordered set based on a B-Tree. - Binary
Heap std
A priority queue implemented with a binary heap. - HashMap
std
A hash map implemented with quadratic probing and SIMD lookup. - HashSet
std
- Linked
List std
A doubly-linked list with owned nodes. - The error type for
try_reserve
methods. - VecDeque
std
A double-ended queue implemented with a growable ring buffer.
Enums§
- Bound
std
An endpoint of a range of keys. - TryReserve
Error Kind Experimental std
Details of the allocation that caused aTryReserveError