Go to the documentation of this file.
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;
107 #include <claw/impl/avl.tpp>
109 #endif // __CLAW_AVL_HPP__
K value_type
The type of the values in the tree.
Fuction object to get the first element of a std::pair.
Binary search tree base AVL implementation.
This is the main namespace.
const typedef K & const_reference
The type of a const reference on the values.
K referent_type
The type passed to the template.
impl_type::avl_const_iterator const_iterator
The type of the iterator on the values of the tree.
Base implementation for the AVL Binary search tree.
K key_type
The type of the keys in the tree.
Binary search tree AVL implementation.
Comp key_less
The comparator to use to compare the keys.