30 #ifndef __CLAW_AVL_HPP__
31 #define __CLAW_AVL_HPP__
42 template <
class K,
class Comp = std::less<K> >
71 template<
typename InputIterator>
72 avl( InputIterator
first, InputIterator last );
74 void insert(
const K& key );
75 template<
typename InputIterator>
76 void insert( InputIterator
first, InputIterator last );
78 void erase(
const K& key );
81 unsigned int size()
const;
84 const_iterator begin()
const;
85 const_iterator end()
const;
86 const_iterator find(
const K& key )
const;
87 const_iterator find_nearest_greater(
const K& key )
const;
88 const_iterator find_nearest_lower(
const K& key )
const;
89 const_iterator lower_bound()
const;
90 const_iterator upper_bound()
const;
95 bool operator<( const avl<K, Comp>& that )
const;
97 bool operator<=( const avl<K, Comp>& that )
const;
107 #include <claw/impl/avl.tpp>
109 #endif // __CLAW_AVL_HPP__
Binary search tree AVL implementation.
Binary search tree base AVL implementation.
Base implementation for the AVL Binary search tree.
impl_type::avl_const_iterator const_iterator
The type of the iterator on the values of the tree.
K key_type
The type of the keys in the tree.
Fuction object to get the first element of a std::pair.
K referent_type
The type passed to the template.
const K & const_reference
The type of a const reference on the values.
Comp key_less
The comparator to use to compare the keys.
This is the main namespace.
K value_type
The type of the values in the tree.