Module builtin_types
Source - binary_heap
- A priority queue implemented with a binary heap.
- btree_map
- An ordered map based on a B-Tree.
- btree_set
- An ordered set based on a B-Tree.
- hash_map
- A hash map implemented with quadratic probing and SIMD lookup.
- hash_set
- A hash set implemented as a
HashMap where the value is (). - linked_list
- A doubly-linked list with owned nodes.
- vec_deque
- A double-ended queue (deque) implemented with a growable ring buffer.
- BTreeMap
- An ordered map based on a B-Tree.
- BTreeSet
- An ordered set based on a B-Tree.
- BinaryHeap
- A priority queue implemented with a binary heap.
- Bytes
- A cheaply cloneable and sliceable chunk of contiguous memory.
- HashMap
- A hash map implemented with quadratic probing and SIMD lookup.
- HashSet
- A hash set implemented as a
HashMap where the value is (). - LinkedList
- A doubly-linked list with owned nodes.
- OrderedFloat
- A wrapper around floats providing implementations of
Eq, Ord, and Hash. - TryReserveError
- The error type for
try_reserve methods. - VecDeque
- A double-ended queue implemented with a growable ring buffer.
- Bound
- An endpoint of a range of keys.
- TryReserveErrorKindExperimental
- Details of the allocation that caused a
TryReserveError