BTreeMap

An associative-array or map implementation based upon a B-Tree.

final

class BTreeMap (

KeyT

ValueT

size_t NodeSizeV = 256

alias KeyLessF = "a < b"

) {

alias _isKeyLess = binaryFun!KeyLessF;

alias BTreeT = BTree!(Pair, NodeSizeV, (pair1, pair2) => _isKeyLess(pair1.key, pair2.key));

BTreeT bTree;

void insert(K key, V value);

ValueT opIndexAssign(ValueT value, KeyT key);

bool opBinaryRight(KeyT key);

void remove(KeyT key);

BTreeT.Range upperRange(KeyT key);

BTreeT.Range lowerRange(KeyT key);

BTreeT.Range equalRange(KeyT key);

}

Constructors

this this(): Undocumented in source.

Alias This

Members

Aliases

BTreeT alias BTreeT = BTree!(Pair, NodeSizeV, (pair1, pair2) => _isKeyLess(pair1.key, pair2.key)): Undocumented in source.
_isKeyLess alias _isKeyLess = binaryFun!KeyLessF: Undocumented in source.

Functions

equalRange BTreeT.Range equalRange(KeyT key): Undocumented in source. Be warned that the author may not have intended to support it.
insert void insert(K key, V value): Insertion
lowerRange BTreeT.Range lowerRange(KeyT key): Undocumented in source. Be warned that the author may not have intended to support it.
opBinaryRight bool opBinaryRight(KeyT key): Membership
opIndexAssign ValueT opIndexAssign(ValueT value, KeyT key): Undocumented in source. Be warned that the author may not have intended to support it.
remove void remove(KeyT key): Removal
upperRange BTreeT.Range upperRange(KeyT key): Ranges

Structs

Pair struct Pair: Undocumented in source.

Variables

bTree BTreeT bTree;: Undocumented in source.

Meta

Source

See Implementation

s2 util container btree_map classes

BTreeMap