#include <DS_BPlusTree.h>
Public Attributes | |
bool | isLeaf |
int | size |
KeyType | keys [order] |
DataType | data [order] |
Page< KeyType, DataType, order > * | next |
Page< KeyType, DataType, order > * | previous |
Page * | children [order+1] |
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 15 of file DS_BPlusTree.h.
Page* DataStructures::Page< KeyType, DataType, order >::children[order+1] |
Definition at line 31 of file DS_BPlusTree.h.
DataType DataStructures::Page< KeyType, DataType, order >::data[order] |
Definition at line 26 of file DS_BPlusTree.h.
bool DataStructures::Page< KeyType, DataType, order >::isLeaf |
Definition at line 15 of file DS_BPlusTree.h.
KeyType DataStructures::Page< KeyType, DataType, order >::keys[order] |
Definition at line 23 of file DS_BPlusTree.h.
Page<KeyType, DataType, order>* DataStructures::Page< KeyType, DataType, order >::next |
Definition at line 27 of file DS_BPlusTree.h.
Page<KeyType, DataType, order>* DataStructures::Page< KeyType, DataType, order >::previous |
Definition at line 28 of file DS_BPlusTree.h.
int DataStructures::Page< KeyType, DataType, order >::size |
Definition at line 20 of file DS_BPlusTree.h.