kernel/util/AVLTreeMap.h

26 	typename Node;
27 	inline Node* Allocate(const Key& key, const Value& value)
28 	inline void Free(Node* node)
29 	inline const Key GetKey(const Node* node) const
30 	inline Value& GetValue(Node* node) const
31 	inline AVLTreeNode* GetAVLTreeNode(Node* node) const
32 	inline Node* GetNode(AVLTreeNode* node) const
33 	inline int CompareKeyNode(const Key& a, const Node* b)
34 	inline int CompareNodes(const Node* a, const Node* b)
50 	typedef typename NodeStrategy::Node	Node;
66 			Node*				RootNode() const;
68 			Node*				Previous(Node* node) const;
69 			Node*				Next(Node* node) const;
74 	inline	Iterator			GetIterator(Node* node);
75 	inline	ConstIterator		GetIterator(Node* node) const;
83 									Node** _node = NULL);
85 			status_t			Remove(Node* node);
99 	inline	Node*				_Allocate(const Key& key, const Value& value);
100 	inline	void				_Free(Node* node);
101 	inline	Key					_GetKey(Node* node) const;
102 	inline	Value&				_GetValue(Node* node) const;
103 	inline	AVLTreeNode*		_GetAVLTreeNode(const Node* node) const;
104 	inline	Node*				_GetNode(const AVLTreeNode* node) const;
105 	inline	int					_CompareKeyNode(const Key& a, const Node* b);
106 	inline	int					_CompareNodes(const Node* a, const Node* b);
194 	inline Node* CurrentNode()
278 inline typename _AVL_TREE_MAP_CLASS_NAME::Node*
289 inline typename _AVL_TREE_MAP_CLASS_NAME::Node*
290 _AVL_TREE_MAP_CLASS_NAME::Previous(Node* node) const
302 inline typename _AVL_TREE_MAP_CLASS_NAME::Node*
303 _AVL_TREE_MAP_CLASS_NAME::Next(Node* node) const
334 _AVL_TREE_MAP_CLASS_NAME::GetIterator(Node* node)
343 _AVL_TREE_MAP_CLASS_NAME::GetIterator(Node* node) const
378 	Node* userNode = _Allocate(key, value);
401 	Node** _node)
404 	Node* userNode = _Allocate(key, value);
440 _AVL_TREE_MAP_CLASS_NAME::Remove(Node* node)
472 inline typename _AVL_TREE_MAP_CLASS_NAME::Node*
482 _AVL_TREE_MAP_CLASS_NAME::_Free(Node* node)
491 _AVL_TREE_MAP_CLASS_NAME::_GetKey(Node* node) const
500 _AVL_TREE_MAP_CLASS_NAME::_GetValue(Node* node) const
509 _AVL_TREE_MAP_CLASS_NAME::_GetAVLTreeNode(const Node* node) const
511 	return fStrategy.GetAVLTreeNode(const_cast<Node*>(node));
517 inline typename _AVL_TREE_MAP_CLASS_NAME::Node*
527 _AVL_TREE_MAP_CLASS_NAME::_CompareKeyNode(const Key& a, const Node* b)
536 _AVL_TREE_MAP_CLASS_NAME::_CompareNodes(const Node* a, const Node* b)
600 	struct Node : AVLTreeNode {
601 		Node(const Key &key, const Value &value)
612 	inline Node* Allocate(const Key& key, const Value& value)
614 		Node* result = fAllocator.Allocate();
620 	inline void Free(Node* node)
626 	inline const Key& GetKey(const Node* node) const
631 	inline Value& GetValue(Node* node) const
636 	inline AVLTreeNode* GetAVLTreeNode(Node* node) const
641 	inline Node* GetNode(AVLTreeNode* node) const
643 		return static_cast<Node*>(node);
646 	inline int CompareKeyNode(const Key& a, const Node* b) const
651 	inline int CompareNodes(const Node* a, const Node* b) const
658 	Allocator<Node>	fAllocator;