src/add-ons/kernel/file_systems/bfs/BPlusTree.h

395

status_t Traverse(int8 direction, void* key,

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

528

return Traverse(BPLUSTREE_FORWARD, key, keyLength, maxLength, value,

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

537

return Traverse(BPLUSTREE_BACKWARD, key, keyLength, maxLength, value,

src/add-ons/kernel/file_systems/btrfs/BTree.cpp

621

status_t status = Traverse(type, path, wanted);

src/add-ons/kernel/file_systems/btrfs/BTree.cpp

675

status_t status = Traverse(BTREE_FORWARD, path, startKey);

src/add-ons/kernel/file_systems/btrfs/BTree.cpp

735

status_t status = Traverse(BTREE_EXACT, path, startKey);

src/add-ons/kernel/file_systems/btrfs/BTree.cpp

927

status_t status = fTree->Traverse(direction, fPath, fKey);

src/add-ons/kernel/file_systems/btrfs/BTree.h

76

status_t Traverse(btree_traversing type, Path* path,

src/bin/bfs_tools/lib/BPlusTree.h

150

status_t Traverse(int8 direction,void *key,uint16 *keyLength,uint16 maxLength,off_t *value);

src/bin/bfs_tools/lib/BPlusTree.h

192

return Traverse(BPLUSTREE_FORWARD,key,keyLength,maxLength,value);

src/bin/bfs_tools/lib/BPlusTree.h

197

return Traverse(BPLUSTREE_BACKWARD,key,keyLength,maxLength,value);