Module scrypto::prelude::radix_engine_common::prelude::rust::collections

Expand description

Collection types.

Macros§

BTreeMap
An ordered map based on a B-Tree.
BTreeSet
An ordered set based on a B-Tree.
LinkedList
A doubly-linked list with owned nodes.
NonIterMap
A thin wrapper around a HashMap, which guarantees that a HashMap usage will not result in a non-deterministic execution (simply by disallowing the iteration over its elements).
VecDeque
A double-ended queue implemented with a growable ring buffer.

hash_map_new
Creates an empty map with capacity 0 and default Hasher
hash_map_with_capacity
Creates an empty map with given capacity and default Hasher
hash_set_new
Creates an empty set with capacity 0 and default Hasher
hash_set_with_capacity
Creates an empty set with given capacity and default Hasher
index_map_new
This is safe for std and no-std use cases (unlike IndexMap::new which disappears when std is not in the toolchain - see this article for deep technical reasons)
index_map_with_capacity
This is safe for std and no-std use cases (unlike IndexMap::with_capacity which disappears when std is not in the toolchain - see this article for deep technical reasons)
index_set_new
This is safe for std and no-std use cases (unlike IndexSet::new which disappears when std is not in the toolchain - see this article for deep technical reasons)
index_set_with_capacity
This is safe for std and no-std use cases (unlike IndexSet::with_capacity which disappears when std is not in the toolchain - see this article for deep technical reasons)