Searched refs:Traverse (Results 1 – 6 of 6) sorted by relevance
| /haiku/src/bin/bfs_tools/lib/ |
| H A D | BPlusTree.h | 150 status_t Traverse(int8 direction,void *key,uint16 *keyLength,uint16 maxLength,off_t *value);
192 return Traverse(BPLUSTREE_FORWARD,key,keyLength,maxLength,value); in GetNextEntry()
197 return Traverse(BPLUSTREE_BACKWARD,key,keyLength,maxLength,value); in GetPreviousEntry()
|
| H A D | BPlusTree.cpp | 370 status_t BPlusTree::Traverse(int8 direction,void *key,uint16 *keyLength,uint16 maxLength,off_t *val… in Traverse() function in BPlusTree
|
| /haiku/src/add-ons/kernel/file_systems/btrfs/ |
| H A D | BTree.cpp | 573 BTree::Traverse(btree_traversing type, Path* path, const btrfs_key& key) in Traverse() function in BTree
621 status_t status = Traverse(type, path, wanted); in _Find()
675 status_t status = Traverse(BTREE_FORWARD, path, startKey); in MakeEntries()
735 status_t status = Traverse(BTREE_EXACT, path, startKey); in RemoveEntries()
926 status_t status = fTree->Traverse(direction, fPath, fKey); in _Traverse()
|
| H A D | BTree.h | 76 status_t Traverse(btree_traversing type, Path* path,
|
| /haiku/src/add-ons/kernel/file_systems/bfs/ |
| H A D | BPlusTree.h | 401 status_t Traverse(int8 direction, void* key,
534 return Traverse(BPLUSTREE_FORWARD, key, keyLength, maxLength, value, in GetNextEntry()
543 return Traverse(BPLUSTREE_BACKWARD, key, keyLength, maxLength, value, in GetPreviousEntry()
|
| H A D | BPlusTree.cpp | 2640 TreeIterator::Traverse(int8 direction, void* key, uint16* keyLength, in Traverse() function in BFS::TreeIterator
|