OrderedHashMap

struct OrderedHashMap (

K

V

Allocator = Mallocator

bool GCRangesAllowed = true

) {

void opAssign(typeof(this) rhs);

string toString();

auto put(K k, V v);

V opIndex(K k);

void opIndexAssign(V v, K k);

bool remove(K k);

void clear();

V* opBinaryRight(K k);

V get(K k, T defaultValue);

V getOrAdd(K k, T defaultValue);

bool addIfMissed(K k, T value);

auto byValue();

}

Postblit

this(this) this(this): Undocumented in source.

Members

Functions

addIfMissed bool addIfMissed(K k, T value)
byKey auto byKey(): iterator by keys
byPair auto byPair()
byValue auto byValue(): iterator by value
clear void clear()
get V get(K k, T defaultValue): get
getOrAdd V getOrAdd(K k, T defaultValue)
length auto length(): get numter of keys in table
opAssign void opAssign(typeof(this) rhs): Undocumented in source. Be warned that the author may not have intended to support it.
opBinaryRight V* opBinaryRight(K k): key in table
opIndex V opIndex(K k): mapkey Attention: you can't use this method in @nogc code. Usual aakey method. Throws exception if key not found
opIndexAssign void opIndexAssign(V v, K k): mapk = v;
put auto put(K k, V v)
remove bool remove(K k)
toString string toString(): Undocumented in source. Be warned that the author may not have intended to support it.

Meta

Source

See Implementation

cachetools containers orderedhashmap structs

OrderedHashMap