Crate std_macro_extensions
Source - arc
- Arc macro
- b_tree_map
- A macro to create a new
BTreeMap, providing two usage options: - b_tree_set
- Creates a new
BTreeSet<T>. - binary_heap
- Creates a new
BinaryHeap<T>. - boxed
- Creates a new
Box instance. - cell
- Creates a new
Cell instance. - hash_map
- Creates a new
HashMap instance. - hash_set
- Creates a new
HashSet instance. - join_paths
- Combines multiple paths into a single valid path, handling overlapping slashes.
- linked_list
- Creates a new
LinkedList instance. - mutex
- Creates a new
Mutex instance. - rc
- Creates a new
Rc (Reference Counted) instance. - refcell
- Creates a new
RefCell instance. - rw_lock
- Creates a new
RwLock instance. - string
- Creates a new
String instance. - vector
- Creates a new
Vec instance. - vector_deque
- Creates a new
VecDeque instance.
- Arc
- A thread-safe reference-counting pointer. ‘Arc’ stands for ‘Atomically
Reference Counted’.
- 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.
- Box
- A pointer type that uniquely owns a heap allocation of type
T. - Cell
- A mutable memory location.
- 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.
- Mutex
- A mutual exclusion primitive useful for protecting shared data
- MutexGuard
- An RAII implementation of a “scoped lock” of a mutex. When this structure is
dropped (falls out of scope), the lock will be unlocked.
- PathBuf
- An owned, mutable path (akin to
String). - Rc
- A single-threaded reference-counting pointer. ‘Rc’ stands for ‘Reference
Counted’.
- RefCell
- A mutable memory location with dynamically checked borrow rules
- RwLock
- A reader-writer lock
- VecDeque
- A double-ended queue implemented with a growable ring buffer.