|
void | freeArray () |
| helper for freeing array
|
|
void | copyArray (const Node1 &node) |
|
| Node1 (const Node1 &node) |
|
| Node1 (Node1 &&node) noexcept |
|
| Node1 (Node0 &&n0, Node0 &&n1, const KeyOfVal &kofval) |
| create from two Node0's
|
|
| Node1 (Node1 &&n0, Node1 &&n1) |
| create from two Node1's
|
|
Node1 & | operator= (const Node1 &node) |
|
Node1 & | operator= (Node1 &&node) noexcept |
|
Node0 * | getFirstNode0 () |
|
const Node0 * | getFirstNode0 () const |
|
Node0 * | getLastNode0 () |
|
const Node0 * | getLastNode0 () const |
|
const Node1 * | parent () const |
| get parent node
|
|
Node1 * | parent () |
| get parent node
|
|
void | allocate0 (cxuint newCapacity) |
|
void | allocate1 (cxuint newCapacity) |
|
void | reserve0 (cxuint newCapacity) |
| reserve0 elements in Node0's array More...
|
|
void | reserve1 (cxuint newCapacity) |
| reserve1 elements in Node0's array More...
|
|
cxuint | lowerBoundN (const K &v, const Comp &comp, const KeyOfVal &kofval) const |
| find node that hold first element not less than value
|
|
cxuint | upperBoundN (const K &v, const Comp &comp, const KeyOfVal &kofval) const |
| find node that hold first element greater than value
|
|
void | insertNode0 (Node0 &&node, cxuint index, const KeyOfVal &kofval, bool updateTotSize=true) |
| insert Node0 - (move to this node)
|
|
void | insertNode1 (Node1 &&node, cxuint index, bool updateTotSize=true) |
| insert Node1 - (move to this node)
|
|
void | eraseNode0 (cxuint index, const KeyOfVal &kofval, bool updateTotSize=true) |
| remove node0 with index from this node
|
|
void | eraseNode1 (cxuint index, bool updateTotSize=true) |
| remove node1 with index from this node
|
|
void | reorganizeNode0s (cxuint start, cxuint end, bool removeOneNode0=false) |
|
void | merge (Node1 &&n2) |
|
void | splitNode (Node1 &n2, const KeyOfVal &kofval) |
|
void | reorganizeNode1s (cxuint start, cxuint end, const KeyOfVal &kofval, bool removeOneNode1=false) |
|
| NodeBase (cxbyte _type) |
|
template<typename K, typename T = K, typename Comp = std::less<K>, typename KeyOfVal = Identity<K>, typename AT = T>
struct CLRX::DTree< K, T, Comp, KeyOfVal, AT >::Node1
Node1 - main node that holds Node0's or Node1's.
template<typename K, typename T = K, typename Comp = std::less<K>, typename KeyOfVal = Identity<K>, typename AT = T>
void CLRX::DTree< K, T, Comp, KeyOfVal, AT >::Node1::copyArray |
( |
const Node1 & |
node | ) |
|
|
inline |
set parent for this array
set parent for this array