STX B+ Tree Template Classes
0.9
|
Extended structure of a inner node in-memory. More...
Public Types | |
typedef _Alloc::template rebind< inner_node >::other | alloc_type |
Define an related allocator for the inner_node structs. More... | |
Public Member Functions | |
void | initialize (const unsigned short l) |
Set variables to initial values. More... | |
bool | isfull () const |
True if the node's slots are full. More... | |
bool | isfew () const |
True if few used entries, less than half full. More... | |
bool | isunderflow () const |
True if node has too few entries. More... | |
![]() | |
void | initialize (const unsigned short l) |
Delayed initialisation of constructed node. More... | |
bool | isleafnode () const |
True if this is a leaf node. More... | |
Public Attributes | |
key_type | slotkey [innerslotmax] |
Keys of children or data pointers. More... | |
node * | childid [innerslotmax+1] |
Pointers to children. More... | |
![]() | |
unsigned short | level |
Level in the b-tree, if level == 0 -> leaf node. More... | |
unsigned short | slotuse |
Number of key slotuse use, so number of valid children or data pointers. More... | |
Extended structure of a inner node in-memory.
Contains only keys and no data items.
typedef _Alloc::template rebind<inner_node>::other stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet >::inner_node::alloc_type |
Define an related allocator for the inner_node structs.
|
inline |
Set variables to initial values.
Definition at line 292 of file btree.h.
References stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet >::node::initialize().
Referenced by stx::btree< key_type, data_type, value_type, key_compare, traits, false, allocator_type, false >::allocate_inner().
|
inline |
True if few used entries, less than half full.
Definition at line 304 of file btree.h.
References stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet >::node::slotuse.
|
inline |
True if the node's slots are full.
Definition at line 298 of file btree.h.
References stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet >::node::slotuse.
|
inline |
True if node has too few entries.
Definition at line 310 of file btree.h.
References stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet >::node::slotuse.
node* stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet >::inner_node::childid[innerslotmax+1] |
key_type stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet >::inner_node::slotkey[innerslotmax] |