![]() |
Shadowrun: Awakened 29 September 2011 - Build 871
|
#include <DS_BPlusTree.h>
Inheritance diagram for DataStructures::Page< KeyType, DataType, order >:Public Attributes | |
| Page * | children [order+1] |
| DataType | data [order] |
| bool | isLeaf |
| KeyType | keys [order] |
| Page< KeyType, DataType, order > * | next |
| Page< KeyType, DataType, order > * | previous |
| int | size |
Used in the BPlusTree. Used for both leaf and index nodes. Don't use a constructor or destructor, due to the memory pool I am using
Definition at line 37 of file DS_BPlusTree.h.
| Page* DataStructures::Page< KeyType, DataType, order >::children[order+1] |
Definition at line 58 of file DS_BPlusTree.h.
Referenced by DataStructures::BPlusTree< KeyType, DataType, order >::CanRotateLeft(), DataStructures::BPlusTree< KeyType, DataType, order >::CanRotateRight(), DataStructures::BPlusTree< KeyType, DataType, order >::Delete(), DataStructures::BPlusTree< KeyType, DataType, order >::DeleteFromPageAtIndex(), DataStructures::BPlusTree< KeyType, DataType, order >::FindDeleteRebalance(), DataStructures::BPlusTree< KeyType, DataType, order >::FixUnderflow(), DataStructures::BPlusTree< KeyType, DataType, order >::FreePages(), DataStructures::BPlusTree< KeyType, DataType, order >::GetLeafFromKey(), DataStructures::BPlusTree< KeyType, DataType, order >::Insert(), DataStructures::BPlusTree< KeyType, DataType, order >::InsertBranchDown(), DataStructures::BPlusTree< KeyType, DataType, order >::InsertIntoNode(), DataStructures::BPlusTree< KeyType, DataType, order >::PrintGraph(), DataStructures::BPlusTree< KeyType, DataType, order >::RotateLeft(), DataStructures::BPlusTree< KeyType, DataType, order >::RotateRight(), DataStructures::BPlusTree< KeyType, DataType, order >::ShiftNodeLeft(), DataStructures::BPlusTree< KeyType, DataType, order >::ShiftNodeRight(), and DataStructures::BPlusTree< KeyType, DataType, order >::ValidateTreeRecursive().
| DataType DataStructures::Page< KeyType, DataType, order >::data[order] |
Definition at line 53 of file DS_BPlusTree.h.
Referenced by DataStructures::BPlusTree< KeyType, DataType, order >::DeleteFromPageAtIndex(), DataStructures::BPlusTree< KeyType, DataType, order >::FindDeleteRebalance(), DataStructures::BPlusTree< KeyType, DataType, order >::FixUnderflow(), DataStructures::BPlusTree< KeyType, DataType, order >::ForEachData(), DataStructures::BPlusTree< KeyType, DataType, order >::Get(), DataStructures::BPlusTree< KeyType, DataType, order >::InsertBranchDown(), DataStructures::BPlusTree< KeyType, DataType, order >::InsertIntoNode(), DataStructures::BPlusTree< KeyType, DataType, order >::PrintLeaf(), DataStructures::BPlusTree< KeyType, DataType, order >::RotateLeft(), DataStructures::BPlusTree< KeyType, DataType, order >::RotateRight(), DataStructures::BPlusTree< KeyType, DataType, order >::ShiftNodeLeft(), and DataStructures::BPlusTree< KeyType, DataType, order >::ShiftNodeRight().
| bool DataStructures::Page< KeyType, DataType, order >::isLeaf |
Definition at line 42 of file DS_BPlusTree.h.
Referenced by DataStructures::BPlusTree< KeyType, DataType, order >::DeleteFromPageAtIndex(), DataStructures::BPlusTree< KeyType, DataType, order >::FindDeleteRebalance(), DataStructures::BPlusTree< KeyType, DataType, order >::FixUnderflow(), DataStructures::BPlusTree< KeyType, DataType, order >::FreePages(), DataStructures::BPlusTree< KeyType, DataType, order >::GetLeafFromKey(), DataStructures::BPlusTree< KeyType, DataType, order >::Insert(), DataStructures::BPlusTree< KeyType, DataType, order >::InsertBranchDown(), DataStructures::BPlusTree< KeyType, DataType, order >::InsertIntoNode(), DataStructures::BPlusTree< KeyType, DataType, order >::PrintGraph(), DataStructures::BPlusTree< KeyType, DataType, order >::ShiftNodeLeft(), DataStructures::BPlusTree< KeyType, DataType, order >::ShiftNodeRight(), and DataStructures::BPlusTree< KeyType, DataType, order >::ValidateTreeRecursive().
| KeyType DataStructures::Page< KeyType, DataType, order >::keys[order] |
Definition at line 50 of file DS_BPlusTree.h.
Referenced by DataStructures::BPlusTree< KeyType, DataType, order >::DeleteFromPageAtIndex(), DataStructures::BPlusTree< KeyType, DataType, order >::FindDeleteRebalance(), DataStructures::BPlusTree< KeyType, DataType, order >::FixUnderflow(), DataStructures::BPlusTree< KeyType, DataType, order >::GetIndexOf(), DataStructures::BPlusTree< KeyType, DataType, order >::Insert(), DataStructures::BPlusTree< KeyType, DataType, order >::InsertBranchDown(), DataStructures::BPlusTree< KeyType, DataType, order >::InsertIntoNode(), DataStructures::BPlusTree< KeyType, DataType, order >::PrintGraph(), DataStructures::BPlusTree< KeyType, DataType, order >::RotateLeft(), DataStructures::BPlusTree< KeyType, DataType, order >::RotateRight(), DataStructures::BPlusTree< KeyType, DataType, order >::ShiftKeysLeft(), DataStructures::BPlusTree< KeyType, DataType, order >::ShiftNodeLeft(), DataStructures::BPlusTree< KeyType, DataType, order >::ShiftNodeRight(), and DataStructures::BPlusTree< KeyType, DataType, order >::ValidateTreeRecursive().
| Page<KeyType, DataType, order>* DataStructures::Page< KeyType, DataType, order >::next |
Definition at line 54 of file DS_BPlusTree.h.
Referenced by DataStructures::MemoryPool< MemoryBlockType >::Allocate(), DataStructures::BPlusTree< KeyType, DataType, order >::FixUnderflow(), DataStructures::BPlusTree< KeyType, DataType, order >::ForEachData(), DataStructures::BPlusTree< KeyType, DataType, order >::ForEachLeaf(), DataStructures::BPlusTree< KeyType, DataType, order >::InsertIntoNode(), DataStructures::MemoryPool< MemoryBlockType >::Release(), and DataStructures::BPlusTree< KeyType, DataType, order >::Size().
| Page<KeyType, DataType, order>* DataStructures::Page< KeyType, DataType, order >::previous |
Definition at line 55 of file DS_BPlusTree.h.
Referenced by DataStructures::BPlusTree< KeyType, DataType, order >::FixUnderflow(), and DataStructures::BPlusTree< KeyType, DataType, order >::InsertIntoNode().
| int DataStructures::Page< KeyType, DataType, order >::size |
Definition at line 47 of file DS_BPlusTree.h.
Referenced by DataStructures::BPlusTree< KeyType, DataType, order >::CanRotateLeft(), DataStructures::BPlusTree< KeyType, DataType, order >::CanRotateRight(), DataStructures::BPlusTree< KeyType, DataType, order >::DeleteFromPageAtIndex(), DataStructures::BPlusTree< KeyType, DataType, order >::FindDeleteRebalance(), DataStructures::BPlusTree< KeyType, DataType, order >::FixUnderflow(), DataStructures::BPlusTree< KeyType, DataType, order >::ForEachData(), DataStructures::BPlusTree< KeyType, DataType, order >::FreePages(), DataStructures::BPlusTree< KeyType, DataType, order >::GetIndexOf(), DataStructures::BPlusTree< KeyType, DataType, order >::Insert(), DataStructures::BPlusTree< KeyType, DataType, order >::InsertBranchDown(), DataStructures::BPlusTree< KeyType, DataType, order >::InsertIntoNode(), DataStructures::BPlusTree< KeyType, DataType, order >::PrintGraph(), DataStructures::BPlusTree< KeyType, DataType, order >::PrintLeaf(), DataStructures::BPlusTree< KeyType, DataType, order >::RotateLeft(), DataStructures::BPlusTree< KeyType, DataType, order >::RotateRight(), DataStructures::BPlusTree< KeyType, DataType, order >::ShiftKeysLeft(), DataStructures::BPlusTree< KeyType, DataType, order >::ShiftNodeLeft(), DataStructures::BPlusTree< KeyType, DataType, order >::ShiftNodeRight(), DataStructures::BPlusTree< KeyType, DataType, order >::Size(), and DataStructures::BPlusTree< KeyType, DataType, order >::ValidateTreeRecursive().
Copyright © 2007-2010 by The Shadowrun: Awakened Team. This work is licensed under the GNU Lesser General Public License 3.