Home
last modified time | relevance | path

Searched refs:_GetAVLTreeNode (Results 1 – 2 of 2) sorted by relevance

/haiku/headers/private/kernel/util/
H A DAVLTree.h78 inline AVLTreeNode* _GetAVLTreeNode(Value* value) const;
242 AVLTreeNode* node = fTree.Previous(_GetAVLTreeNode(value)); in Previous()
254 AVLTreeNode* node = fTree.Next(_GetAVLTreeNode(value)); in Next()
275 AVLTreeNode* node = fTree.LeftMost(_GetAVLTreeNode(value)); in LeftMost()
296 AVLTreeNode* node = fTree.RightMost(_GetAVLTreeNode(value)); in RightMost()
321 return Iterator(this, fTree.GetIterator(_GetAVLTreeNode(value))); in GetIterator()
329 return ConstIterator(this, fTree.GetIterator(_GetAVLTreeNode(value))); in GetIterator()
357 AVLTreeNode* node = _GetAVLTreeNode(value); in Insert()
382 return fTree.Remove(_GetAVLTreeNode(value)); in Remove()
406 AVLTree<Definition>::_GetAVLTreeNode(Value* value) const in _GetAVLTreeNode() function
H A DAVLTreeMap.h103 inline AVLTreeNode* _GetAVLTreeNode(const Node* node) const;
295 AVLTreeNode* treeNode = fTree.Previous(_GetAVLTreeNode(node)); in Previous()
308 AVLTreeNode* treeNode = fTree.Next(_GetAVLTreeNode(node)); in Next()
336 return Iterator(this, fTree.GetIterator(_GetAVLTreeNode(node))); in GetIterator()
345 return ConstIterator(this, fTree.GetIterator(_GetAVLTreeNode(node))); in GetIterator()
383 AVLTreeNode* node = _GetAVLTreeNode(userNode); in Insert()
409 AVLTreeNode* node = _GetAVLTreeNode(userNode); in Insert()
509 _AVL_TREE_MAP_CLASS_NAME::_GetAVLTreeNode(const Node* node) const in _GetAVLTreeNode() function