bfs_tools/lib/BPlusTree.cpp

370 status_t BPlusTree::Traverse(int8 direction,void *key,uint16 *keyLength,uint16 maxLength,off_t *value)
446 	uint16 length;
564 status_t BPlusTree::FindKey(bplustree_node *node,uint8 *key,uint16 keyLength,uint16 *index,off_t *next)
581 		uint16 i = (first + last) >> 1;
583 		uint16 searchLength;
619 status_t BPlusTree::SeekDown(Stack<node_and_key> &stack,uint8 *key,uint16 keyLength)
651 void BPlusTree::InsertKey(bplustree_node *node,uint8 *key,uint16 keyLength,off_t value,uint16 index)
658 	uint16 *keyLengths = node->KeyLengths();
665 	uint16 *newKeyLengths = node->KeyLengths();
674 	for (uint16 i = node->all_key_count;i-- > index + 1;)
676 	memmove(newKeyLengths,keyLengths,sizeof(uint16) * index);
690 status_t BPlusTree::InsertDuplicate(bplustree_node */*node*/,uint16 /*index*/)
721 status_t BPlusTree::SplitNode(bplustree_node *node,off_t nodeOffset,uint16 *_keyIndex,uint8 *key,uint16 *_keyLength,off_t *_value)
735 	uint16 *inKeyLengths = node->KeyLengths();
739 	uint16 keyIndex = *_keyIndex;
766 						out * (sizeof(uint16) + sizeof(off_t)) >= size) {
788 	uint16 *outKeyLengths = other->KeyLengths();
795 		memcpy(outKeyLengths,inKeyLengths,keys * sizeof(uint16));
808 			memcpy(outKeyLengths + keyIndex + 1,inKeyLengths + keyIndex,keys * sizeof(uint16));
859 		//				out * (sizeof(uint16) + sizeof(off_t)));
899 		memmove(outKeyLengths,inKeyLengths + skip,keys * sizeof(uint16));
902 		memmove(outKeyLengths + keyIndex + 1,inKeyLengths + skip + keyIndex,in * sizeof(uint16));
940 	uint16 length;
950 status_t BPlusTree::Insert(uint8 *key,uint16 keyLength,off_t value)
992 			+ (node->all_key_count + 1) * (sizeof(uint16) + sizeof(off_t))) < fNodeSize)
1040 status_t BPlusTree::Find(uint8 *key,uint16 keyLength,off_t *value)
1148 uint8 *bplustree_node::KeyAt(int32 index,uint16 *keyLength) const
1154 	uint16 *keyLengths = KeyLengths();