|
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. | |
Public Member Functions | |
| void | initialize (const unsigned short l) |
| Set variables to initial values. | |
| bool | isfull () const |
| True if the node's slots are full. | |
| bool | isfew () const |
| True if few used entries, less than half full. | |
| bool | isunderflow () const |
| True if node has too few entries. | |
Public Attributes | |
| key_type | slotkey [innerslotmax] |
| Keys of children or data pointers. | |
| node * | childid [innerslotmax+1] |
| Pointers to children. | |
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.
| void stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet >::inner_node::initialize | ( | const unsigned short | l | ) | [inline] |
Set variables to initial values.
Reimplemented from stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet >::node.
Definition at line 292 of file btree.h.
Referenced by stx::btree< key_type, data_type, value_type, key_compare, traits, false, allocator_type, false >::allocate_inner().
| bool stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet >::inner_node::isfew | ( | ) | const [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 >::mininnerslots, and stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet >::node::slotuse.
| bool stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet >::inner_node::isfull | ( | ) | const [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 >::innerslotmax, and stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet >::node::slotuse.
| bool stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet >::inner_node::isunderflow | ( | ) | const [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 >::mininnerslots, and 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] |
1.7.6.1