bfs_tools/lib/BPlusTree.h

57 	uint16	all_key_count;
58 	uint16	all_key_length;
60 	inline uint16 *KeyLengths() const;
64 	uint8 *KeyAt(int32 index, uint16 *keyLength) const;
121 		status_t	GetNextEntry(void *key,uint16 *keyLength,uint16 maxLength,off_t *value);
122 		status_t	GetPreviousEntry(void *key,uint16 *keyLength,uint16 maxLength,off_t *value);
124 		status_t	Insert(uint8 *key, uint16 keyLength, off_t value);
134 		status_t	Find(uint8 *key, uint16 keyLength, off_t *value);
144 			uint16	keyIndex;
150 		status_t	Traverse(int8 direction,void *key,uint16 *keyLength,uint16 maxLength,off_t *value);
153 		status_t	FindKey(bplustree_node *node, uint8 *key, uint16 keyLength, uint16 *index = NULL, off_t *next = NULL);
154 		status_t	SeekDown(Stack<node_and_key> &stack, uint8 *key, uint16 keyLength);
156 		status_t	SplitNode(bplustree_node *node, off_t nodeOffset, uint16 *_keyIndex, uint8 *key, uint16 *_keyLength, off_t *_value);
158 		void		InsertKey(bplustree_node *node, uint8 *key, uint16 keyLength, off_t value, uint16 index);
159 		status_t	InsertDuplicate(bplustree_node *node,uint16 index);
179 		uint16		fDuplicate, fNumDuplicates;
190 inline status_t BPlusTree::GetNextEntry(void *key,uint16 *keyLength,uint16 maxLength,off_t *value)
195 inline status_t BPlusTree::GetPreviousEntry(void *key,uint16 *keyLength,uint16 maxLength,off_t *value)
264 inline uint16 *bplustree_node::KeyLengths() const
266 	return (uint16 *)(((char *)this) + round_up(sizeof(bplustree_node) + all_key_length));
271 	return (off_t *)((char *)KeyLengths() + all_key_count * sizeof(uint16));
281 	return round_up(sizeof(bplustree_node) + all_key_length) + all_key_count * (sizeof(uint16) + sizeof(off_t));