Returns a shallow copy of this structure.

Returns whether this structure contains no key-value pairs.

Returns the number of key-value pairs in this structure.

Returns whether the given key exists in this structure.

Retrieves a value for the specified key, or undefined if it did not exist.

Adds a new key-value pair of replaces an existing one.

Attempts to replace a value by a new one.

Returns true if the value was replaced or false if the key did not exist in this structure.

Returns an array of keys in this structure.
Not ordered in a specific way, but consistent with values.

Returns an array of values in this structure.
Not ordered in a specific way, but consistent with keys.

Returns a string representation of this structure.

Returns a shallow copy of this structure. The copy will only contain the fields that have not been marked as "unused".

Marks all key-value pairs in this structure as "unused".

Returns whether this structure contains no used key-value pairs.

Returns the number of key-value pairs in this structure, excluding ones marked as unused.

Returns whether the given key exists in this structure.

Retrieves a value for the specified key, or undefined if it did not exist.

Adds a new key-value pair of replaces an existing one.

Attempts to replace a value by a new one.

Returns true if the value was replaced or false if the key did not exist in this structure.

Attempts to remove a value from the structure, marking it as "unused".

Returns whether the value was present (and thus was removed).

Returns an array of keys in this structure.
Not ordered in a specific way, but consistent with values.

If the optional copy parameter is set to false (default is true), the function will return a cached array where possible - good if you don't intend to modify the array!

Returns an array of values in this structure.
Not ordered in a specific way, but consistent with keys.

Returns a string representation of this structure, excluding unused key-value pairs.

Creates a new map with specified initial capacity.

Default is 256, but you may make it lower if you know the approximate number of keys (check whether the map expands using capacity).

Returns a shallow copy of this map.

Removes all key-value pairs from this map.

Returns whether this map contains no key-value pairs.

Returns the current number of key-value pairs in the map.

Returns the current map capacity - that is, how many entries do the internal arrays hold. A map is resized whenever size reaches half of capacity or if a key-value pair cannot be fit due to a sufficient number of collisions.

Returns whether a key-value exists for the given key.

Returns a value for the given key, or, if there is no such key-value pair,

Adds a new key-value pair to the map or updates the value of an existing one.

As per capacity, this may trigger a reallocation of the map.

Finds a key-value pair for the given key and replaces the value with a new one.

Returns true if the value was replaced, or false if the pair was not found.

Removes a key-value pair, returns whether successful (false if no pair with the given key existed).

Creates and returns a new iterator for this map.

The iterator has a single method called next, which will pull out the next key-value pair and store it in its key/value fields, subsequently returning true, or will return false if it has reached the end of the map.

You would usually use it like so:

var map = new Map();
map.set("one", 1);
map.set(2, "two");
var it = map.iterator();
while (it.next()) {
    trace("iter", it.key, "=>", it.value);
}
// shorter: for (var it = map.iterator(); it.next();) {...}

Returns an array containing all keys in the map.
Not ordered in a specific way, but consistent with values.

Returns an array containing all values in the map.
Not ordered in a specific way, but consistent with keys.

Returns a string representation of this map, in a somewhat JSON-looking (but not valid JSON) format - Map({ key1: value1, key2: value2, ... })

Returns a new struct containing key-value pairs from this map.