HashMap

Implements a hashmap using collections.treemap as a backend. See collections.treemap for more info on certain things.

struct HashMap (

K

E

alias hashFunc = defaultHash!K

alias less = "a < b"

) {

enum bool nogcIndexing;

alias HashType = ReturnType!hashFunc;

void rebalance();

static if(nogcIndexing)

E opIndex(K key);

static if(nogcIndexing)

E opIndex(HashType key);

static if(nogcIndexing)

E* ptrOf(K key);

static if(nogcIndexing)

E* ptrOf(HashType key);

static if(nogcIndexing)

bool has(K key);

static if(nogcIndexing)

auto opBinaryRight(K key);

static if(nogcIndexing)

bool has(HashType key);

static if(nogcIndexing)

auto opBinaryRight(HashType key);

static if(!(nogcIndexing))

E opIndex(K key);

static if(!(nogcIndexing))

E opIndex(HashType key);

static if(!(nogcIndexing))

bool has(K key);

static if(!(nogcIndexing))

auto opBinaryRight(K key);

static if(!(nogcIndexing))

bool has(HashType key);

static if(!(nogcIndexing))

auto opBinaryRight(HashType key);

E opIndexAssign(E value, K key);

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

int opApply(int delegate(HashType, ref E) dg);

int opApplyReverse(int delegate(ref E) dg);

int opApplyReverse(int delegate(HashType, ref E) dg);

static string makeFunc();

size_t length [@property getter];

string toString();

}

Members

Aliases

HashType alias HashType = ReturnType!hashFunc: Undocumented in source.

Functions

has bool has(K key): Returns true if the element exists within the set, false otherwise.
has bool has(HashType key): Returns true if the element exists within the set, false otherwise.
has bool has(K key): Returns true if the element exists within the set, false otherwise.
has bool has(HashType key): Returns true if the element exists within the set, false otherwise.
opApply int opApply(int delegate(ref E) dg): Implements a simple left-to-right tree traversal.
opApply int opApply(int delegate(HashType, ref E) dg): Implements a simple left-to-right tree traversal.
opApplyReverse int opApplyReverse(int delegate(ref E) dg): Implements a simple right-to-left tree traversal.
opApplyReverse int opApplyReverse(int delegate(HashType, ref E) dg): Implements a simple right-to-left tree traversal.
opBinaryRight auto opBinaryRight(K key): Undocumented in source. Be warned that the author may not have intended to support it.
opBinaryRight auto opBinaryRight(HashType key): Undocumented in source. Be warned that the author may not have intended to support it.
opBinaryRight auto opBinaryRight(K key): Undocumented in source. Be warned that the author may not have intended to support it.
opBinaryRight auto opBinaryRight(HashType key): Undocumented in source. Be warned that the author may not have intended to support it.
opIndex E opIndex(K key)
E opIndex(HashType key): @nogc capable indexing. Returns the found element if match found. Returns E.init if match not found.
opIndex E opIndex(K key): Indexing function that relies on the GC, and throws if no match found. Returns the found element if match found.
opIndexAssign E opIndexAssign(E value, K key): Assigns an element to the given key.
ptrOf E* ptrOf(K key)
E* ptrOf(HashType key): Returns the pointer of the element, or null if key not found.
rebalance void rebalance(): Undocumented in source. Be warned that the author may not have intended to support it.
toString string toString(): returns the string representation of the tree.

Properties

length size_t length [@property getter]: Returns the number of currently held elements within the tree.

Static functions

makeFunc string makeFunc(): Undocumented in source. Be warned that the author may not have intended to support it.

Static variables

nogcIndexing enum bool nogcIndexing;: Undocumented in source.

Meta

Source

See Implementation

collections hashmap structs

HashMap