LinkedHashMap

Implements a linked hashmap. If retainKeys enabled, the map will retain the original keys and hash collisions can be resorted, but can be disabled by setting keyEqual to null. It is a modified linked map, and the ovrwrtBhvr still works as with the linked map.

struct LinkedHashMap (
K
E
alias hashFunc = defaultHash128!(K)
alias equal = "a == b"
bool retainKeys = false
alias keyEqual = "a == b"
bool ovrwrtBhvr = true
) {}

Members

Aliases

HashType
alias HashType = ReturnType!hashFunc
Undocumented in source.

Functions

getPtr
E* getPtr(K key)

Returns the pointer to the element with the given key, of null if key is not found.

getPtr
E* getPtr(HashType hashCode)

Returns the pointer to the element with the given key, of null if key is not found.

getPtr
E* getPtr(K key)

Returns the pointer to the element with the given key, of null if key is not found.

has
bool has(K key)

Returns true if key is found.

has
bool has(K key)

Returns true if key is found.

has
bool has(K key)

Returns true if key is found.

has
bool has(K key)

Returns true if key is found.

has
bool has(HashType hashCode)

Returns true if key is found.

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

opApply override for foreach

opApply
int opApply(int delegate(K, ref E) dg)

opApply override for foreach

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

opApply override for foreach

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

opApply override for foreach

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

opApplyReverse override for foreach_reverse

opApplyReverse
int opApplyReverse(int delegate(K, ref E) dg)

opApplyReverse override for foreach_reverse

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

opApplyReverse override for foreach_reverse

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

opApplyReverse override for foreach_reverse

opBinaryRight
auto opBinaryRight(K 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(K 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)

Returns the element with the given key, or E.init if key is not found.

opIndex
E opIndex(HashType hashCode)

Returns the element with the given key, or E.init if key is not found.

opIndex
E opIndex(K key)

Returns the element with the given key, or E.init if key is not found.

opIndex
E opIndex(HashType hashCode)

Returns the element with the given key, or E.init if key is not found.

opIndex
E opIndex(K key)

Returns the element with the given key, or E.init if key is not found.

opIndex
E opIndex(K key)

Returns the element with the given key, or E.init if key is not found.

opIndexAssign
auto opIndexAssign(E value, K key)

Assigns a value to the given key.

opIndexAssign
auto opIndexAssign(E value, K key)

Assigns a value to the given key.

remove
E remove(K key)

Removes the element with the specified key. Returns the removed element.

remove
E remove(HashType hashcode)

Removes the element with the specified hashcode. Returns the removed element.

toString
string toString()

Returns the string representation of this container format

Properties

length
size_t length [@property getter]

Returns the number of elements in the LinkedMap.

Static functions

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

Static variables

nogcIndexing
enum bool nogcIndexing;

true if nogc Indexing is enabled.

Variables

_length
size_t _length;

N. of currently stored elements

last
Node* last;

Last element.

root
Node* root;

Root element.

Meta