HashMap<K, V>

class HashMap<K: copyable, V: copyable>

A hash-based map from keys to values.

Remarks

HashMap owns shallow copies of its keys and values. Pointer and string keys copy the pointer value; the supplied hash policy controls identity or content comparison.

Lifecycle members

constructor

HashMap(HashPolicy<K> policy, within Allocator* allocator, sizeof(K), sizeof(V))

Initializes an empty map with a key hash policy and remembers the allocator used for storage.

destructor

~HashMap()

Releases all allocated storage.

Instance members

void

clear(bool deleteBuffer = false)

Removes all entries and optionally releases storage.

bool

containsKey(const this, in K key)

Returns true when the key is present.

nuint

getCapacity()

property

Returns the number of key/value slots currently allocated.

getItem(const this, in K key)

property

Returns the value for a key, or default when the key is absent.

nuint

getLength()

property

Returns the number of entries in the map.

bool

remove(in K key)

Removes a key and returns true when an entry was removed.

void

setItem(in K key, in V value)

property

Adds or replaces a value for a key.

bool

tryGet(const this, in K key, out V value)

Gets a value and returns true when the key is present.

Generated with campc v0.4.0-preview.1+d50446ef951a6ed675f7086cf093dbc993f0041b.