kernel/util/AVLTreeMap.h

20 	template <typename Key, typename Value,
21 			  typename KeyOrder = Ascending<Key>,
27 	inline Node* Allocate(const Key& key, const Value& value)
29 	inline const Key GetKey(const Node* node) const
33 	inline int CompareKeyNode(const Key& a, const Node* b)
40 #define _AVL_TREE_MAP_TEMPLATE_LIST template<typename Key, typename Value, \
42 #define _AVL_TREE_MAP_CLASS_NAME AVLTreeMap<Key, Value, NodeStrategy>
46 template<typename Key, typename Value,
47 		 typename NodeStrategy = AVLTreeMapStrategy::Auto<Key, Value> >
77 			Iterator			Find(const Key& key);
78 			Iterator			FindClose(const Key& key, bool less);
80 			status_t			Insert(const Key& key, const Value& value,
82 			status_t			Insert(const Key& key, const Value& value,
84 			status_t			Remove(const Key& key);
99 	inline	Node*				_Allocate(const Key& key, const Value& value);
101 	inline	Key					_GetKey(Node* node) const;
105 	inline	int					_CompareKeyNode(const Key& a, const Node* b);
173 	inline Key CurrentKey()
177 		return Key();
351 _AVL_TREE_MAP_CLASS_NAME::Find(const Key& key)
362 _AVL_TREE_MAP_CLASS_NAME::FindClose(const Key& key, bool less)
373 _AVL_TREE_MAP_CLASS_NAME::Insert(const Key& key, const Value& value,
399 _AVL_TREE_MAP_CLASS_NAME::Insert(const Key& key, const Value& value,
425 _AVL_TREE_MAP_CLASS_NAME::Remove(const Key& key)
455 	return _CompareKeyNode(*(const Key*)key, _GetNode(node));
472 _AVL_TREE_MAP_CLASS_NAME::_Allocate(const Key& key, const Value& value)
489 inline Key
526 _AVL_TREE_MAP_CLASS_NAME::_CompareKeyNode(const Key& a, const Node* b)
595 template <typename Key, typename Value, typename KeyOrder,
600 		Node(const Key &key, const Value &value)
607 		Key		key;
611 	inline Node* Allocate(const Key& key, const Value& value)
625 	inline const Key& GetKey(const Node* node) const
645 	inline int CompareKeyNode(const Key& a, const Node* b) const