kernel/util/AVLTreeMap.h

31 	inline AVLTreeNode* GetAVLTreeNode(Node* node) const
32 	inline Node* GetNode(AVLTreeNode* node) const
92 									const AVLTreeNode* node);
93 	virtual	int					CompareNodes(const AVLTreeNode* node1,
94 									const AVLTreeNode* node2);
96 			void				_FreeTree(AVLTreeNode* node);
103 	inline	AVLTreeNode*		_GetAVLTreeNode(const Node* node) const;
104 	inline	Node*				_GetNode(const AVLTreeNode* node) const;
132 			if (AVLTreeNode* node = ConstIterator::fTreeIterator.Remove()) {
175 		if (AVLTreeNode* node = fTreeIterator.Current())
182 		if (AVLTreeNode* node = fTreeIterator.Current())
189 		if (AVLTreeNode* node = fTreeIterator.Current())
196 		if (AVLTreeNode* node = fTreeIterator.Current())
208 		if (AVLTreeNode* node = fTreeIterator.Next())
215 		if (AVLTreeNode* node = fTreeIterator.Next())
222 		if (AVLTreeNode* node = fTreeIterator.Previous())
270 	AVLTreeNode* root = fTree.Root();
281 	if (AVLTreeNode* root = fTree.Root())
295 	AVLTreeNode* treeNode = fTree.Previous(_GetAVLTreeNode(node));
308 	AVLTreeNode* treeNode = fTree.Next(_GetAVLTreeNode(node));
354 	if (AVLTreeNode* node = fTree.Find(&key))
365 	if (AVLTreeNode* node = fTree.FindClosest(&key, less))
383 	AVLTreeNode* node = _GetAVLTreeNode(userNode);
409 	AVLTreeNode* node = _GetAVLTreeNode(userNode);
428 	AVLTreeNode* node = fTree.Remove(&key);
454 	const AVLTreeNode* node)
463 _AVL_TREE_MAP_CLASS_NAME::CompareNodes(const AVLTreeNode* node1,
464 	const AVLTreeNode* node2)
508 inline AVLTreeNode*
518 _AVL_TREE_MAP_CLASS_NAME::_GetNode(const AVLTreeNode* node) const
520 	return fStrategy.GetNode(const_cast<AVLTreeNode*>(node));
545 _AVL_TREE_MAP_CLASS_NAME::_FreeTree(AVLTreeNode* node)
600 	struct Node : AVLTreeNode {
602 			: AVLTreeNode(),
636 	inline AVLTreeNode* GetAVLTreeNode(Node* node) const
641 	inline Node* GetNode(AVLTreeNode* node) const