B-Trees
B-tree implementation in C++ to index documents based on numerical id's and title strings.
Public Attributes | List of all members
BTree< T, M, BlockSize >::OverflowResult Struct Reference

Provides information to deal with an insertion overflow. More...

Public Attributes

middle
 The value that, after splitting nodes, shall be used as the middle value and must be inserted in the parent node. More...
 
long rightNode
 Offset of the node that'll have to be the pointer to the right of the OverflowResult::middle value. More...
 

Detailed Description

template<typename T, std::size_t M, unsigned int BlockSize = BLOCK_SIZE>
struct BTree< T, M, BlockSize >::OverflowResult

Provides information to deal with an insertion overflow.

Member Data Documentation

template<typename T, std::size_t M, unsigned int BlockSize = BLOCK_SIZE>
T BTree< T, M, BlockSize >::OverflowResult::middle

The value that, after splitting nodes, shall be used as the middle value and must be inserted in the parent node.

template<typename T, std::size_t M, unsigned int BlockSize = BLOCK_SIZE>
long BTree< T, M, BlockSize >::OverflowResult::rightNode

Offset of the node that'll have to be the pointer to the right of the OverflowResult::middle value.


The documentation for this struct was generated from the following file: