|
| enum | { hdr_sz = sizeof(generic_page_header) + 48,
data_sz = sizeof(generic_page) - hdr_sz
} |
| |
| bool | eq (const btree_page_data &) const |
| |
| typedef uint16_t | poor_man_key |
| | The type of poor_man_key data. More...
|
| |
| void | init_items () |
| |
| void | remove_items (const int item_count, const w_keystr_t &high) |
| |
| int | number_of_items () const |
| |
| int | number_of_ghosts () const |
| | return number of current items that are ghosts More...
|
| |
| bool | is_ghost (int item) const |
| | is the given item a ghost? More...
|
| |
| void | set_ghost (int item) |
| | turn the given item into a ghost item More...
|
| |
| void | unset_ghost (int item) |
| | turn the given item into a non-ghost item More...
|
| |
| poor_man_key | item_poor (int item) const |
| | return the poor_man_key data for the given item More...
|
| |
| poor_man_key & | item_poor (int item) |
| | return a reference to the poor_man_key data for the given item More...
|
| |
| PageID & | item_child (int item) |
| |
| char * | item_data (int item) |
| |
| size_t | item_length (int item) const |
| |
| bool | insert_item (int item, bool ghost, poor_man_key poor, PageID child, size_t data_length) |
| |
| bool | insert_item (int item, bool ghost, poor_man_key poor, PageID child, const cvec_t &data) |
| |
| bool | resize_item (int item, size_t new_length, size_t keep_old) |
| |
| bool | replace_item_data (int item, size_t offset, const cvec_t &new_data) |
| |
| void | delete_item (int item) |
| |
| void | delete_range (int from, int to) |
| |
| void | truncate_all (size_t amount, size_t pos) |
| |
| size_t | item_space (int item) const |
| |
| size_t | predict_item_space (size_t data_length) const |
| |
| size_t | usable_space () const |
| |
| void | compact () |
| | compact item space, making all freed space available. More...
|
| |
| char * | unused_part (size_t &length) |
| |
| bool | _items_are_consistent () const |
| |
| PageID | btree_root |
| |
| PageID | btree_pid0 |
| | First child pointer in non-leaf nodes. More...
|
| |
| PageID | btree_foster |
| | Foster link page ID (0 if not linked). More...
|
| |
| int16_t | btree_level |
| |
| int16_t | btree_fence_low_length |
| |
| int16_t | btree_fence_high_length |
| |
| int16_t | btree_chain_fence_high_length |
| |
| int16_t | btree_prefix_length |
| |
| int16_t | btree_consecutive_skewed_insertions |
| |
| lsn_t | btree_pid0_emlsn |
| |
| lsn_t | btree_foster_emlsn |
| |
| static const size_t | max_item_overhead |
| |
B-tree page.
These pages contain the data that makes up B-trees.
The implementation is spread between this class' superclass, btree_page_data, and its handle class, btree_page_h. The superclass contains the basic fields and dynamically-sized–item list implementation while the secrets of their usage are contained in the handle class.
This class itself contains only friend declarations; those classes/members it friends have access to the protected but not private members of the superclass.