B-Trees
B-tree implementation in C++ to index documents based on numerical id's and title strings.
Main Page
Classes
Files
Class List
Class Index
Class Members
All
Functions
Variables
Typedefs
a
b
c
i
m
o
p
r
s
t
u
v
y
- a -
authors :
Entry
- b -
blockCount :
BTree< T, M, BlockSize >::FileHeader
,
HashfileHeader
blocksCreated :
BTree< T, M, BlockSize >::Statistics
blocksInDisk :
BTree< T, M, BlockSize >::Statistics
BlockSizeInUse :
BTree< T, M, BlockSize >
blocksRead :
BTree< T, M, BlockSize >::Statistics
- c -
children :
BTree< T, M, BlockSize >::BNode
citations :
Entry
- i -
id :
Entry
,
IdIndex
isLeaf :
BTree< T, M, BlockSize >::BNode
- m -
m_file :
BTree< T, M, BlockSize >
m_root :
BTree< T, M, BlockSize >
m_stats :
BTree< T, M, BlockSize >
middle :
BTree< T, M, BlockSize >::OverflowResult
- o -
offset :
BTree< T, M, BlockSize >::BNode
,
IdIndex
,
TitleIndex
Order :
BTree< T, M, BlockSize >
- p -
padding :
Block< T, BlockSize >
- r -
rightNode :
BTree< T, M, BlockSize >::OverflowResult
rootAddress :
BTree< T, M, BlockSize >::FileHeader
- s -
size :
BTree< T, M, BlockSize >::BNode
snippet :
Entry
- t -
title :
Entry
,
TitleIndex
- u -
updateTimestamp :
Entry
- v -
valid :
Entry
values :
BTree< T, M, BlockSize >::BNode
var :
Block< T, BlockSize >
- y -
year :
Entry
Generated by
1.8.11