bfs_tools/lib/BPlusTree.h

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);
126 		status_t	Insert(const char *key, off_t value);
127 		status_t	Insert(int32 key, off_t value);
128 		status_t	Insert(uint32 key, off_t value);
129 		status_t	Insert(int64 key, off_t value);
130 		status_t	Insert(uint64 key, off_t value);
131 		status_t	Insert(float key, off_t value);
132 		status_t	Insert(double key, off_t value);
134 		status_t	Find(uint8 *key, uint16 keyLength, off_t *value);
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);
190 inline status_t BPlusTree::GetNextEntry(void *key,uint16 *keyLength,uint16 maxLength,off_t *value)
192 	return Traverse(BPLUSTREE_FORWARD,key,keyLength,maxLength,value);
195 inline status_t BPlusTree::GetPreviousEntry(void *key,uint16 *keyLength,uint16 maxLength,off_t *value)
197 	return Traverse(BPLUSTREE_BACKWARD,key,keyLength,maxLength,value);
200 inline status_t BPlusTree::Insert(const char *key,off_t value)
204 	return Insert((uint8 *)key, strlen(key), value);
207 inline status_t BPlusTree::Insert(int32 key, off_t value)
211 	return Insert((uint8 *)&key, sizeof(key), value);
214 inline status_t BPlusTree::Insert(uint32 key, off_t value)
218 	return Insert((uint8 *)&key, sizeof(key), value);
221 inline status_t BPlusTree::Insert(int64 key, off_t value)
225 	return Insert((uint8 *)&key, sizeof(key), value);
228 inline status_t BPlusTree::Insert(uint64 key, off_t value)
232 	return Insert((uint8 *)&key, sizeof(key), value);
235 inline status_t BPlusTree::Insert(float key, off_t value)
239 	return Insert((uint8 *)&key, sizeof(key), value);
242 inline status_t BPlusTree::Insert(double key, off_t value)
246 	return Insert((uint8 *)&key, sizeof(key), value);