Map

Map: Map, insert, set, remove, size, capacity, resize, operator[], contains, empty, loadFactor, iterator

MapIterator: MapIterator, hasValue, value, increment

struct MapEntry<Key: Hashable, Value>

A key-value pair stored in a map.

Key key;

The entry's key.

Value value;

The entry's value.

A hash map from keys to values.

Map()

Initializes an empty map

void insert(Key key, Value value)

Inserts an element into the map. The key must not already be in the map.

void set(Key key, Value value)

Inserts, or updates an existing value.

void remove(Key& e)

Removes an element from the map, if it exists there.

int size()

Returns the number of entries.

int capacity()

Returns the number of buckets.

void resize()

Resizes the map. This includes copying the old table into a new, bigger one

Value&? operator[](Key& e)

Returns the value for the given key, or null.

bool contains(Key& e)

Checks if e is part of the map.

bool empty()

Returns true if the map has no entries.

float64 loadFactor()

Returns the load factor for the map. This is used to increase the map size once the load factor gets too big.

MapIterator<Key, Value> iterator()

Iterate over the map

Iterates over the entries of a map.

MapIterator(Map<Key, Value>& map)

Initializes an iterator over the given map.

bool hasValue()

Returns true if there are more entries.

MapEntry<Key, Value>& value()

Returns the current entry.

void increment()

Advances to the next entry.

int convertHash(uint64 hash)

Converts a hash into a bucket index.