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.
A disabled default is present on this object. To use it, use one of the other constructors or a factory function.
Use allocator to allocate and free nodes in the tree.
A destructor is present on this object, but not explicitly documented in the source.
Copying this object is disabled.
A postblit is present on this object, but not explicitly documented in the source.
Inserts the given value into the tree.
tree ~= item operator overload.
Removes a value from the tree.