Expand description
Module containing all collection macros
Modules§
- binary_
heap - [
std ::collections ::BinaryHeap] macros - btree_
map - [
std ::collections ::BTreeMap] macros - btree_
set - [
std ::collections ::BTreeSet] macros - exposed
- Exposed namespace of the module.
- hash_
map - [
std ::collections ::HashMap] macros - hash_
set - [
std ::collections ::HashSet] macros - linked_
list - [
std ::collections ::LinkedList] macros - orphan
- Parented namespace of the module.
- own
- Own namespace of the module.
- prelude
- Prelude to use essentials:
use my_module ::prelude :: *. - vec_
deque - [
std ::collections ::VecDeque] macros - vector
- Vec macros
Macros§
- bmap
- Creates a
BTreeMapfrom a list of key-value pairs. - bset
- Creates a
BTreeSetfrom a list of elements. - deque
- Creates a
VecDequefrom a list of elements. - dlist
- Creates a
Vecfrom a list of elements. - heap
- Creates a
BinaryHeapfrom a list of elements. - hmap
- Creates a
HashMapfrom a list of key-value pairs. - hset
- Creates a
HashSetfrom a list of elements. - llist
- Creates a
LinkedListfrom a llist of elements.
Structs§
- BTree
Map - An ordered map based on a B-Tree.
- BTree
Set - An ordered set based on a B-Tree.
- Binary
Heap - A priority queue implemented with a binary heap.
- Bmap
- An ordered map based on a B-Tree.
- Bset
- An ordered set based on a B-Tree.
- Deque
- A double-ended queue implemented with a growable ring buffer.
- Dlist
- A contiguous growable array type, written as
Vec<T>, short for ‘vector’. - HashMap
- A hash map implemented with quadratic probing and SIMD lookup.
- HashSet
- A hash set implemented as a
HashMapwhere the value is(). - Hmap
- A hash map implemented with quadratic probing and SIMD lookup.
- Hset
- A hash set implemented as a
HashMapwhere the value is(). - Linked
List - A doubly-linked list with owned nodes.
- Llist
- A doubly-linked list with owned nodes.
- Map
- A hash map implemented with quadratic probing and SIMD lookup.
- Set
- A hash set implemented as a
HashMapwhere the value is(). - Vec
- A contiguous growable array type, written as
Vec<T>, short for ‘vector’. - VecDeque
- A double-ended queue implemented with a growable ring buffer.