bfs_tools/lib/BPlusTree.cpp

0 /* BPlusTree - BFS B+Tree implementation
7 #include "BPlusTree.h"
47 NodeCache::NodeCache(BPlusTree *tree)
72 BPlusTree::BPlusTree(int32 keyType,int32 nodeSize,bool allowDuplicates)
83 BPlusTree::BPlusTree(BPositionIO *stream,bool allowDuplicates)
94 BPlusTree::BPlusTree()
107 BPlusTree::~BPlusTree()
113 void BPlusTree::Initialize(int32 nodeSize)
131 status_t BPlusTree::SetTo(int32 keyType,int32 nodeSize,bool allowDuplicates)
153 status_t BPlusTree::SetTo(BPositionIO *stream,bool allowDuplicates)
211 status_t BPlusTree::InitCheck()
225 BPlusTree::Validate(bool verbose)
296 BPlusTree::WriteTo(BPositionIO *stream)
319 void BPlusTree::SetCurrentNode(bplustree_node *node,off_t offset,int8 to)
327 status_t BPlusTree::Goto(int8 to)
366 status_t BPlusTree::Traverse(int8 direction,void *key,uint16 *keyLength,uint16 maxLength,off_t *value)
490 int32 BPlusTree::CompareKeys(const void *key1, int keyLength1, const void *key2, int keyLength2)
560 status_t BPlusTree::FindKey(bplustree_node *node,uint8 *key,uint16 keyLength,uint16 *index,off_t *next)
615 status_t BPlusTree::SeekDown(Stack<node_and_key> &stack,uint8 *key,uint16 keyLength)
647 void BPlusTree::InsertKey(bplustree_node *node,uint8 *key,uint16 keyLength,off_t value,uint16 index)
686 status_t BPlusTree::InsertDuplicate(bplustree_node */*node*/,uint16 /*index*/)
717 status_t BPlusTree::SplitNode(bplustree_node *node,off_t nodeOffset,uint16 *_keyIndex,uint8 *key,uint16 *_keyLength,off_t *_value)
946 status_t BPlusTree::Insert(uint8 *key,uint16 keyLength,off_t value)
1036 status_t BPlusTree::Find(uint8 *key,uint16 keyLength,off_t *value)
1072 BPlusTree::CheckNode(bplustree_node *node)
1084 bplustree_node *BPlusTree::Node(off_t nodeOffset,bool check)
1135 void BPlusTree::SetHoldChanges(bool hold)