30#ifndef __CLAW_AVL_HPP__
31#define __CLAW_AVL_HPP__
42 template <
class K,
class Comp = std::less<K> >
70 explicit avl(
const avl<K, Comp>& that);
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;
92 avl<K, Comp>& operator=(
const avl<K, Comp>& that);
93 bool operator==(
const avl<K, Comp>& that)
const;
94 bool operator!=(
const avl<K, Comp>& that)
const;
95 bool operator<(
const avl<K, Comp>& that)
const;
96 bool operator>(
const avl<K, Comp>& that)
const;
97 bool operator<=(
const avl<K, Comp>& that)
const;
98 bool operator>=(
const avl<K, Comp>& that)
const;
107#include <claw/avl.tpp>
Base implementation for the AVL Binary search tree.
Binary search tree base AVL implementation.
const K & const_reference
The type of a const reference on the values.
Comp key_less
The comparator to use to compare the keys.
K key_type
The type of the keys in the tree.
K value_type
The type of the values in the tree.
impl_type::avl_const_iterator const_iterator
The type of the iterator on the values of the tree.
K referent_type
The type passed to the template.
Fuction object to get the first element of a std::pair.
This is the main namespace.