No default construction if an allocator must be provided.
Use allocator to allocate and free nodes in the tree.
Inserts the given value into the tree.
tree ~= item operator overload.
Removes a value from the tree.
Tree range
the element type
the allocator to use. Defaults to Mallocator.
if true, duplicate values will be allowed in the tree
the comparitor function to use
Nodes will be sized to fit within this number of bytes.
true if the container should support holding references to GC-allocated memory.
Implements a binary search tree with multiple items per tree node.
T-tree Nodes are (by default) sized to fit within a 64-byte cache line. The number of items stored per node can be read from the nodeCapacity field. Each node has 0, 1, or 2 children. Each node has between 1 and nodeCapacity items, or it has nodeCapacity items and 0 or more children.