Lines Matching defs:stack
1104 /*! Prepares the stack to contain all nodes that were passed while
1109 BPlusTree::_SeekDown(Stack<node_and_key>& stack, const uint8* key,
1124 stack.Push(nodeAndKey);
1135 if ((uint32)stack.CountItems() > fHeader.MaxNumberOfLevels()) {
1140 // put the node offset & the correct keyIndex on the stack
1141 stack.Push(nodeAndKey);
1691 Stack<node_and_key> stack;
1692 if (_SeekDown(stack, key, keyLength) != B_OK)
1702 while (stack.Pop(&nodeAndKey)
2107 Stack<node_and_key> stack;
2108 if (_SeekDown(stack, key, keyLength) != B_OK)
2115 while (stack.Pop(&nodeAndKey)
2267 It's very similar to BPlusTree::SeekDown(), but doesn't fill a stack