Module structures::map
source · Expand description
§Map
Contains a ‘MapCollection’ trait for implementing a map, as well as a default implementation of a map called ‘Map’. This also contains implementations of the following: ‘KeyValue’, ‘Dictionary’, ‘HashMap’. For convenience, a macro for creating a ‘KeyValue’ struct (kv!) is available, as well as a macro for creating a ‘KeyValue’ struct for a ‘dictionary’ (dkv!). A ’ ‘map’ is an unordered group of key/value pairs that only contain unique keys and their associated values. A ‘map’ can be indexed by their keys and new keys can be added with an associated value, and values of existing keys can be changed.
Modules§
- Traversable
Structs§
- A ‘dictionary’ is a ‘collection’ containing ‘string’ label keys associated with a value.
- A map structure with hashed keys that allow for faster value retrieval.
- Contains a key/value pair.
- A ‘map’ is a ‘collection’ of key/value pairs where each key is unique and has an associated value.