Macros§
- Arc macro
- A macro to create a new
BTreeMap, providing two usage options: - Creates a new
BTreeSet<T>. - Creates a new
BinaryHeap<T>. - Creates a new
Boxinstance. - Creates a new
Cellinstance. - Creates a new
HashMapinstance. - Creates a new
HashSetinstance. - Creates a new
LinkedListinstance. - Creates a new
Mutexinstance. - Creates a new
Rc(Reference Counted) instance. - Creates a new
RefCellinstance. - Creates a new
RwLockinstance.
Structs§
- A thread-safe reference-counting pointer. ‘Arc’ stands for ‘Atomically Reference Counted’.
- An ordered map based on a B-Tree.
- An ordered set based on a B-Tree.
- A priority queue implemented with a binary heap.
- A pointer type that uniquely owns a heap allocation of type
T. - A mutable memory location.
- A hash map implemented with quadratic probing and SIMD lookup.
- A doubly-linked list with owned nodes.
- A mutual exclusion primitive useful for protecting shared data
- An RAII implementation of a “scoped lock” of a mutex. When this structure is dropped (falls out of scope), the lock will be unlocked.
- A single-threaded reference-counting pointer. ‘Rc’ stands for ‘Reference Counted’.
- A mutable memory location with dynamically checked borrow rules
- A reader-writer lock