TreeMap

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

struct TreeMap (

K

V

Allocator = Mallocator

alias less = "a < b"

bool supportGC =

shouldAddGCRange!K ||

shouldAddGCRange!V

size_t cacheLineSize = 64

) {

this(Allocator allocator);

void insert(V value, K key);

alias opIndexAssign = insert;

auto 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);

}

Constructors

this this(): No default construction if an allocator must be provided.
this this(Allocator allocator): Use the given allocator for allocations.

Postblit

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

Members

Aliases

opIndexAssign alias opIndexAssign = insert: Supports treeMapkey = value; syntax.

Functions

containsKey bool containsKey(K key)
empty bool empty()
insert void insert(V value, K key): Inserts the given key-value pair.
keys auto keys(): Undocumented in source. Be warned that the author may not have intended to support it.
length size_t length()
opApply int opApply(int delegate(ref K, ref V) loopBody): Supports foreach(k, v; treeMap) syntax.
opIndex auto opIndex(K key): Supports treeMapkey syntax.
remove bool remove(K key): Removes the key→value mapping for the given key.
values auto values(): Undocumented in source. Be warned that the author may not have intended to support it.

Meta

Source

See Implementation

containers treemap structs

TreeMap