Lines Matching defs:BPlusTree
10 #include "BPlusTree.h"
26 // Node Caching for the BPlusTree class
131 BPlusTree::BPlusTree(Stream *stream)
141 BPlusTree::~BPlusTree()
147 BPlusTree::SetTo(Stream *stream)
202 BPlusTree::InitCheck()
209 BPlusTree::TypeCodeToKeyType(type_code code)
235 BPlusTree::ModeToKeyType(mode_t mode)
260 BPlusTree::CompareKeys(const void *key1, int keyLength1, const void *key2, int keyLength2)
292 BPlusTree::FindKey(bplustree_node *node, const uint8 *key, uint16 keyLength, uint16 *index,
351 BPlusTree::SeekDown(Stack<node_and_key> &stack, const uint8 *key, uint16 keyLength)
386 BPlusTree::FindFreeDuplicateFragment(bplustree_node *node, CachedNode *cached, off_t *_offset,
422 * It's very similar to BPlusTree::SeekDown(), but doesn't fill
433 BPlusTree::Find(const uint8 *key, uint16 keyLength, off_t *_value)
470 TreeIterator::TreeIterator(BPlusTree *tree)
686 /** This is more or less a copy of BPlusTree::Find() - but it just