std.collections.Map - nitrologic/monkey2 GitHub Wiki

std::.Map<K,V>

The Map class provides support for associative maps.

A map is a container style object that provides a mechanism for associating 'key' objects with 'value' objects. This is done using an internal node object that contains a reference to both a key and a value, along with information about the node' s location within the map.

Each key in a map occurs exactly once - a map cannot contain multiple equivalent keys.

Maps can handle inserting, removing and finding keys in 'O(log2)' time. That is, the time needed to insert, remove or find a key is proportional to log2 of the number of items in the map.

Structs
[[Iterator	Iterator]]
[[KeyIterator	KeyIterator]]
[[MapKeys	MapKeys]]
[[MapValues	MapValues]]
[[ValueIterator	ValueIterator]]

Classes
[[Node	Node]]

Constructors
[[New	New]]

Properties
[[Empty	Empty]]
[[Keys	Keys]]
[[Values	Values]]

Methods
[[Add	Add]]
[[All	All]]
[[Clear	Clear]]
[[Contains	Contains]]
[[Copy	Copy]]
[[Count	Count]]
[[Get	Get]]
[[Remove	Remove]]
[[Set	Set]]
[[Update	Update]]
[[OpIdx	Operator []]]
[[OpIdxeq	Operator []=]]