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

2674

bool forward = direction == BPLUSTREE_FORWARD;

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

528

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

src/bin/bfs_tools/lib/BPlusTree.cpp

374

&& Goto(direction == BPLUSTREE_FORWARD ? BPLUSTREE_BEGIN : BPLUSTREE_END) < B_OK)

src/bin/bfs_tools/lib/BPlusTree.cpp

419

while ((direction == BPLUSTREE_FORWARD && fCurrentKey >= node->all_key_count)

src/bin/bfs_tools/lib/BPlusTree.cpp

422

fCurrentNodeOffset = direction == BPLUSTREE_FORWARD ? node->right_link : node->left_link;

src/bin/bfs_tools/lib/BPlusTree.cpp

432

fCurrentKey = direction == BPLUSTREE_FORWARD ? 0 : node->all_key_count;

src/bin/bfs_tools/lib/BPlusTree.cpp

438

fCurrentKey = direction == BPLUSTREE_FORWARD ? node->all_key_count : -1;

src/bin/bfs_tools/lib/BPlusTree.h

192

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