B-Trees
B-tree implementation in C++ to index documents based on numerical id's and title strings.
BTree< T, M, BlockSize > Member List

This is the complete list of members for BTree< T, M, BlockSize >, including all inherited members.

BlockSizeInUseBTree< T, M, BlockSize >static
BNodeBlock typedefBTree< T, M, BlockSize >private
BTree()BTree< T, M, BlockSize >
create(const char *filepath)BTree< T, M, BlockSize >
FileHeaderBlock typedefBTree< T, M, BlockSize >private
finishInsertions()BTree< T, M, BlockSize >
getStatistics(bool includeFileBlockCount=false) const BTree< T, M, BlockSize >
insert(const T &value)BTree< T, M, BlockSize >
insert(BNodeBlock &node, T value, long rightNodeOffset=-1)BTree< T, M, BlockSize >private
load(const char *filepath)BTree< T, M, BlockSize >
m_fileBTree< T, M, BlockSize >private
m_rootBTree< T, M, BlockSize >private
m_statsBTree< T, M, BlockSize >mutableprivate
OrderBTree< T, M, BlockSize >static
readFromDisk(long offset)BTree< T, M, BlockSize >private
readHeader() const BTree< T, M, BlockSize >private
resetStatistics()BTree< T, M, BlockSize >
seek(const U &key)BTree< T, M, BlockSize >
ValueType typedefBTree< T, M, BlockSize >
writeHeader(const FileHeaderBlock &header)BTree< T, M, BlockSize >private
writeToDisk(BNodeBlock &node)BTree< T, M, BlockSize >private
~BTree()BTree< T, M, BlockSize >