Lines Matching refs:fCurrentNode
171 fCurrentNode(NULL), in TreeIterator()
189 fCurrentNode = NULL; in SetTo()
192 fCurrentNode = fTree->GetRootNode(); in SetTo()
193 if (fCurrentNode) in SetTo()
194 fCurrentNode->Get(); in SetTo()
208 if (fCurrentNode) { in Unset()
209 fCurrentNode->Put(); in Unset()
210 fCurrentNode = NULL; in Unset()
218 return (fTree && fCurrentNode && fPath ? fPath->InitCheck() : B_NO_INIT); in InitCheck()
225 return fCurrentNode; in GetNode()
233 if (fCurrentNode) in GetLevel()
234 level = fCurrentNode->GetLevel(); in GetLevel()
266 if (fCurrentNode->IsInternal() in GoTo()
267 && fIndex < fCurrentNode->CountItems()) { in GoTo()
276 if (fCurrentNode->IsInternal() && fIndex > 0) in GoTo()
289 if (fCurrentNode->IsInternal()) { in GoTo()
290 InternalNode *internal = fCurrentNode->ToInternalNode(); in GoTo()
323 if (fCurrentNode->IsLeaf()) { in GoToPreviousLeaf()
336 while (error == B_OK && fCurrentNode->IsInternal()) { in GoToPreviousLeaf()
337 fIndex = fCurrentNode->CountItems(); in GoToPreviousLeaf()
343 *node = fCurrentNode->ToLeafNode(); in GoToPreviousLeaf()
365 if (fCurrentNode->IsLeaf()) { in GoToNextLeaf()
374 while (error == B_OK && fCurrentNode->IsInternal()) in GoToNextLeaf()
378 *node = fCurrentNode->ToLeafNode(); in GoToNextLeaf()
402 while (error == B_OK && fCurrentNode->IsInternal()) { in FindRightMostLeaf()
404 error = _SearchRightMost(fCurrentNode->ToInternalNode(), k, &index); in FindRightMostLeaf()
414 *node = fCurrentNode->ToLeafNode(); in FindRightMostLeaf()
438 fCurrentNode = NULL; in Suspend()
453 = (fTree && !fCurrentNode && fPath ? fPath->InitCheck() : B_NO_INIT); in Resume()
463 status_t error = fPath->PushElement(fCurrentNode->GetNumber(), fIndex); in _PushCurrentNode()
465 fCurrentNode->Put(); in _PushCurrentNode()
466 fCurrentNode = newTopNode; in _PushCurrentNode()
482 if (fCurrentNode) in _PopTopNode()
483 fCurrentNode->Put(); in _PopTopNode()
484 fCurrentNode = node; in _PopTopNode()