BST

GC-free binary search tree implementation.

class BST (

T

) {

this(int k, T v);

void insert(int k, T v);

BST find(int k);

BST findLeftMost();

void remove(int k, BST par);

void traverse(void function(int, T) func);

int opApply(int delegate(int, ref T) dg);

void clear();

}

Constructors

this this(): Undocumented in source.
this this(int k, T v): Undocumented in source.

Destructor

~this ~this(): Undocumented in source.

Members

Functions

clear void clear(): Undocumented in source. Be warned that the author may not have intended to support it.
find BST find(int k): Undocumented in source. Be warned that the author may not have intended to support it.
findLeftMost BST findLeftMost(): Undocumented in source. Be warned that the author may not have intended to support it.
insert void insert(int k, T v): Undocumented in source. Be warned that the author may not have intended to support it.
opApply int opApply(int delegate(int, ref T) dg): Undocumented in source. Be warned that the author may not have intended to support it.
remove void remove(int k, BST par): Undocumented in source. Be warned that the author may not have intended to support it.
traverse void traverse(void function(int, T) func): Undocumented in source. Be warned that the author may not have intended to support it.

Variables

key int key;: Undocumented in source.
left BST left;: Undocumented in source.
right BST right;: Undocumented in source.
root bool root;: Undocumented in source.
value T value;: Undocumented in source.

Meta

Source

See Implementation

dlib container bst classes

BST