TreeMap

A key→value mapping where the keys are guaranteed to be sorted.

struct TreeMap (

K

V

alias less = "a < b"

bool supportGC = true

size_t cacheLineSize = 64

) {

void opIndexAssign(V value, K key);

V opIndex(K key);

bool remove(K key);

bool containsKey(K key);

bool empty();

size_t length();

int opApply(int delegate(ref K, ref V) loopBody);

}

Postblit

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

Members

Functions

containsKey bool containsKey(K key)
empty bool empty()
length size_t length()
opApply int opApply(int delegate(ref K, ref V) loopBody): Supports foreach(k, v; treeMap) syntax.
opIndex V opIndex(K key): Supports treeMapkey syntax.
opIndexAssign void opIndexAssign(V value, K key): Supports treeMapkey = value; syntax.
remove bool remove(K key): Removes the key→value mapping for the given key.

Parameters

K: the key type
V: the value type
less: the key comparison function to use
supportGC: true to support storing GC-allocated objects, false otherwise
cacheLineSize: the size of the internal nodes in bytes

Meta

Source

See Implementation

containers treemap structs

TreeMap