Lines Matching defs:fTree
41 inline int Count() const { return fTree.Count(); }
42 inline bool IsEmpty() const { return fTree.IsEmpty(); }
68 void CheckTree() const { fTree.CheckTree(); }
87 AVLTreeBase fTree;
196 fTree(this),
205 fTree(this),
221 fTree.MakeEmpty();
229 if (AVLTreeNode* root = fTree.Root())
242 AVLTreeNode* node = fTree.Previous(_GetAVLTreeNode(value));
254 AVLTreeNode* node = fTree.Next(_GetAVLTreeNode(value));
263 AVLTreeNode* node = fTree.LeftMost();
275 AVLTreeNode* node = fTree.LeftMost(_GetAVLTreeNode(value));
284 AVLTreeNode* node = fTree.RightMost();
296 AVLTreeNode* node = fTree.RightMost(_GetAVLTreeNode(value));
305 return Iterator(this, fTree.GetIterator());
313 return ConstIterator(this, fTree.GetIterator());
321 return Iterator(this, fTree.GetIterator(_GetAVLTreeNode(value)));
329 return ConstIterator(this, fTree.GetIterator(_GetAVLTreeNode(value)));
337 if (AVLTreeNode* node = fTree.Find(&key))
347 if (AVLTreeNode* node = fTree.FindClosest(&key, less))
358 status_t error = fTree.Insert(node);
363 *iterator = Iterator(this, fTree.GetIterator(node));
373 AVLTreeNode* node = fTree.Remove(&key);
382 return fTree.Remove(_GetAVLTreeNode(value));