void * keys [SDS_BPTREE_DEFAULT_CAPACITY]
void * values [SDS_BPTREE_BRANCH]
struct _sds_bptree_node * parent
This is the core of the B+Tree structures. This node represents the branches and leaves of the structure.
The number of values currently stored in this structure.
Statically sized array of pointers to the keys of this structure.
This number of 'rows' above the leaves this node is. 0 represents a true leaf node, anything greater is a branch.
struct _sds_bptree_node* sds_bptree_node::parent
Back reference to our parent. This is faster than creating a traversal list during each insertion (by a large factor).
The id of the transaction that created this node. This is used so that within a transaction, we don't double copy values if we already copied them.
Statically sized array of pointers to values. This is tagged by the level flag. If level is 0, this is a set of values that have been inserted by the consumer. If the level is > 0, this is the pointers to further node structs.
In a leaf, this is [value, value, value, value, value, link -> ]
In a non-leaf, this is [link, link, link, link, link, link]
Generated automatically by Doxygen for dirsrv from the source code.