|
| Node0 (const Node0 &node) |
|
| Node0 (Node0 &&node) noexcept |
|
Node0 & | operator= (const Node0 &node) |
| copying assignment
|
|
Node0 & | operator= (Node0 &&node) noexcept |
| moving assigment
|
|
const Node1 * | parent () const |
| get parent node
|
|
Node1 * | parent () |
| get parent node
|
|
const AT & | operator[] (cxuint i) const |
|
AT & | operator[] (cxuint i) |
|
cxuint | lower_boundFree (const K &k, const Comp &comp, const KeyOfVal &kofval) const |
| get lower_bound (first index of element not less than value)
|
|
cxuint | lower_bound (const K &k, const Comp &comp, const KeyOfVal &kofval) const |
| get lower_bound (first index of element not less than value)
|
|
cxuint | upper_bound (const K &k, const Comp &comp, const KeyOfVal &kofval) const |
| get upper_bound (first index of element greater than value)
|
|
cxuint | find (const K &k, const Comp &comp, const KeyOfVal &kofval) const |
| get lower_bound (first index of element not less than value)
|
|
void | setFromArray (cxuint size, const AT *input) |
|
void | allocate (cxuint size) |
|
void | assignArray (AT &toFill, cxuint inSize, cxuint &index, cxuint &pos, const AT *array, uint64_t inBitMask, size_t newSize, cxuint &k, cxuint &factor) |
|
void | merge (const Node0 &node2) |
| merge this node with node2
|
|
void | split (Node0 &node2) |
| split this node and store in this node and node2
|
|
void | resize (cxint extraSize) |
| simple resize
|
|
std::pair< cxuint, bool > | insert (const T &v, const Comp &comp, const KeyOfVal &kofval) |
| insert element
|
|
bool | erase (cxuint index) |
| erase element in index
|
|
bool | erase (const K &k, const Comp &comp, const KeyOfVal &kofval) |
| erase element of value v
|
|
| NodeBase (cxbyte _type) |
|