| accessTuple(BTreeNode const &node, uint iEntry)=0 | BTreeNodeAccessor | [pure virtual] |
| accessTupleInline(BTreeNode const &node, uint iEntry)=0 | BTreeNodeAccessor | [pure virtual] |
| allocateEntry(BTreeNode &node, uint iEntry, uint cbEntry) | BTreeHeapNodeAccessor | [virtual] |
| binarySearch(BTreeNode const &node, TupleDescriptor const &keyDescriptor, TupleData const &searchKey, DuplicateSeek dupSeek, bool leastUpper, TupleData &scratchKey, bool &found)=0 | BTreeNodeAccessor | [pure virtual] |
| BTreeHeapNodeAccessor() | BTreeHeapNodeAccessor | [explicit] |
| calculateCapacity(BTreeNode const &node, uint cbEntry) | BTreeHeapNodeAccessor | [virtual] |
| CAN_FIT enum value | BTreeNodeAccessor | |
| CAN_FIT_WITH_COMPACTION enum value | BTreeNodeAccessor | |
| CAN_NOT_FIT enum value | BTreeNodeAccessor | |
| Capacity enum name | BTreeNodeAccessor | |
| clearNode(BTreeNode &node, uint cbPage) | BTreeHeapNodeAccessor | [virtual] |
| compactNode(BTreeNode &node, BTreeNode &scratchNode) | BTreeNodeAccessor | [virtual] |
| compareFirstKey(BTreeNode const &node, TupleDescriptor const &keyDescriptor, TupleData const &searchKey, TupleData &scratchKey)=0 | BTreeNodeAccessor | [pure virtual] |
| deallocateEntry(BTreeNode &node, uint iEntry) | BTreeHeapNodeAccessor | [virtual] |
| dumpNode(std::ostream &os, BTreeNode const &node, PageId pageId) | BTreeNodeAccessor | |
| EntryOffset typedef | BTreeHeapNodeAccessor | [private] |
| getEntryByteCount(uint cbTuple) | BTreeHeapNodeAccessor | [virtual] |
| getEntryForRead(BTreeNode const &node, uint iEntry)=0 | BTreeNodeAccessor | [pure virtual] |
| getEntryForReadInline(BTreeNode const &node, uint iEntry) | BTreeHeapNodeAccessor | [inline] |
| getEntryOffset(BTreeNode const &node, uint iEntry) | BTreeHeapNodeAccessor | [inline, private] |
| getEntryOffsetArrayByteSize(uint nEntries) | BTreeHeapNodeAccessor | [inline, private] |
| getEntryOffsetPointer(BTreeNode const &node, uint iEntry) | BTreeHeapNodeAccessor | [inline, private] |
| getEntryOffsetPointer(BTreeNode &node, uint iEntry) | BTreeHeapNodeAccessor | [inline, private] |
| getEntrySizeWithOverhead(uint cbEntry) | BTreeHeapNodeAccessor | [inline, private] |
| getKeyCount(BTreeNode const &node) const | BTreeNodeAccessor | [inline] |
| hasFixedWidthEntries() const | BTreeHeapNodeAccessor | [virtual] |
| onInit() | BTreeNodeAccessor | [virtual] |
| splitNode(BTreeNode &node, BTreeNode &newNode, uint cbNewTuple, bool monotonic) | BTreeNodeAccessor | [virtual] |
| tupleAccessor | BTreeNodeAccessor | |
| tupleData | BTreeNodeAccessor | |
| tupleDescriptor | BTreeNodeAccessor | |
| unmarshalKey(TupleData &keyData)=0 | BTreeNodeAccessor | [pure virtual] |
| ~BTreeNodeAccessor() | BTreeNodeAccessor | [virtual] |
