Map

An (unordered map), based on jive.set. Similar to builtin 'VKey', but with value-semantics.

struct Map (

Key

V

) {

bool empty();

size_t length();

bool opIn_r(const(T) key);

V opIndex(const(T) key);

bool remove(const(T) k);

int opApply(int delegate(ref Key) dg);

int opApply(int delegate(ref Key, ref V) dg);

}

Members

Functions

empty bool empty()
length size_t length()
opApply int opApply(int delegate(ref Key, ref V) dg): Traverse all entries using foreach. TODO: turn this into ranges
opApply int opApply(int delegate(ref Key) dg): Traverse all entries using foreach. TODO: turn this into ranges
opIn_r bool opIn_r(const(T) key)
opIndex V opIndex(const(T) key): Lookup a key and return the stored value. If the key does not currently exist, it is created and its value set to V.init.
remove bool remove(const(T) k): Remove a key and associated value from the map.

Meta

Source

See Implementation

jive map structs

Map