Containers
Types
-
Represents one array of fixed or dynamic size.
-
An container that contains key-value pairs with unique keys using open-addressing hashing algorithm.
-
An container that contains a set of unique objects using open-addressing hashing algorithm.
-
A container that stores elements as double-linked lists (nodes connected by pointers).
-
A container that implements a double-ended queue and uses a ring buffer as its internal storage.
-
Represents one self-indexed hash map whose key can be extracted from the value, so that it does not need to be stored.
-
Represents one self-indexed unordered map whose key can be extracted from the value, so that it does not need to be stored.
-
Luna::SelfIndexedUnorderedMultiMap
Represents one self-indexed unordered map similar to SelfIndexedUnorderedMap, but allows multiple elements with the same key to be inserted.
-
An container that contains key-value pairs with unique keys using closed-addressing hashing algorithm.
-
An container that contains key-value pairs using closed-addressing hashing algorithm. This container allows multiple values with the same key exist in the container.
-
! An container that contains a set of unique objects using closed-addressing hashing algorithm. This container allows multiple copies of the same value exist in the container.
-
An container that contains a set of unique objects using closed-addressing hashing algorithm.
-
A container that stores a continuous array of elements. Elements can be added to or removed from the container dynamically.
Constants
-
constexpr usize DYNAMIC_ARRAY_SIZE
Specifies a dynamic-sized array for Array.