bfs/r5/BPlusTree.cpp

0 /* BPlusTree - BFS B+Tree implementation
12 #include "BPlusTree.h"
46 // Node Caching for the BPlusTree class
245 BPlusTree::BPlusTree(Transaction *transaction, Inode *stream, int32 nodeSize)
255 BPlusTree::BPlusTree(Inode *stream)
265 BPlusTree::BPlusTree()
277 BPlusTree::~BPlusTree()
296 BPlusTree::SetTo(Transaction *transaction, Inode *stream, int32 nodeSize)
344 BPlusTree::SetTo(Inode *stream)
397 BPlusTree::InitCheck()
404 BPlusTree::TypeCodeToKeyType(type_code code)
430 BPlusTree::ModeToKeyType(mode_t mode)
458 BPlusTree::UpdateIterators(off_t offset, off_t nextOffset, uint16 keyIndex, uint16 splitAt,
476 BPlusTree::AddIterator(TreeIterator *iterator)
488 BPlusTree::RemoveIterator(TreeIterator *iterator)
500 BPlusTree::CompareKeys(const void *key1, int keyLength1, const void *key2, int keyLength2)
531 BPlusTree::FindKey(bplustree_node *node, const uint8 *key, uint16 keyLength, uint16 *index,
590 BPlusTree::SeekDown(Stack<node_and_key> &stack, const uint8 *key, uint16 keyLength)
625 BPlusTree::FindFreeDuplicateFragment(bplustree_node *node, CachedNode *cached, off_t *_offset,
660 BPlusTree::InsertDuplicate(Transaction *transaction, CachedNode *cached, bplustree_node *node,
813 BPlusTree::InsertKey(bplustree_node *node, uint16 index, uint8 *key, uint16 keyLength,
855 BPlusTree::SplitNode(bplustree_node *node, off_t nodeOffset, bplustree_node *other,
1077 BPlusTree::Insert(Transaction *transaction, const uint8 *key, uint16 keyLength, off_t value)
1202 BPlusTree::RemoveDuplicate(Transaction *transaction, bplustree_node *node, CachedNode *cached,
1382  *	the calling method (BPlusTree::Remove()) have this data.
1386 BPlusTree::RemoveKey(bplustree_node *node, uint16 index)
1446 BPlusTree::Remove(Transaction *transaction, const uint8 *key, uint16 keyLength, off_t value)
1553 BPlusTree::Replace(Transaction *transaction, const uint8 *key, uint16 keyLength, off_t value)
1592  *	It's very similar to BPlusTree::SeekDown(), but doesn't fill
1603 BPlusTree::Find(const uint8 *key, uint16 keyLength, off_t *_value)
1653 TreeIterator::TreeIterator(BPlusTree *tree)
1864 /**	This is more or less a copy of BPlusTree::Find() - but it just