|
| avl (const avl< K, Comp > &that) |
|
template<typename InputIterator> |
| avl (InputIterator first, InputIterator last) |
|
void | insert (const K &key) |
|
template<typename InputIterator> |
void | insert (InputIterator first, InputIterator last) |
|
void | erase (const K &key) |
|
void | clear () |
|
unsigned int | size () const |
|
bool | empty () const |
|
const_iterator | begin () const |
|
const_iterator | end () const |
|
const_iterator | find (const K &key) const |
|
const_iterator | find_nearest_greater (const K &key) const |
|
const_iterator | find_nearest_lower (const K &key) const |
|
const_iterator | lower_bound () const |
|
const_iterator | upper_bound () const |
|
avl< K, Comp > & | operator= (const avl< K, Comp > &that) |
|
bool | operator== (const avl< K, Comp > &that) const |
|
bool | operator!= (const avl< K, Comp > &that) const |
|
bool | operator< (const avl< K, Comp > &that) const |
|
bool | operator> (const avl< K, Comp > &that) const |
|
bool | operator<= (const avl< K, Comp > &that) const |
|
bool | operator>= (const avl< K, Comp > &that) const |
|
template<class K, class Comp = std::less<K>>
class claw::avl< K, Comp >
Binary search tree AVL implementation.
- Author
- Julien Jorge
Definition at line 43 of file avl.hpp.