claw 1.9.0
 
Loading...
Searching...
No Matches
claw::avl< K, Comp > Class Template Reference

Binary search tree AVL implementation. More...

#include <avl.hpp>

Inheritance diagram for claw::avl< K, Comp >:

Public Types

typedef K value_type
 The type of the values in the tree.
 
typedef K key_type
 The type of the keys in the tree.
 
typedef K referent_type
 The type passed to the template.
 
typedef Comp key_less
 The comparator to use to compare the keys.
 
typedef const K & const_reference
 The type of a const reference on the values.
 
typedef impl_type::avl_const_iterator const_iterator
 The type of the iterator on the values of the tree.
 

Public Member Functions

 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
 

Detailed Description

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.

Member Typedef Documentation

◆ const_iterator

template<class K, class Comp = std::less<K>>
typedef impl_type::avl_const_iterator claw::avl< K, Comp >::const_iterator

The type of the iterator on the values of the tree.

Definition at line 66 of file avl.hpp.

◆ const_reference

template<class K, class Comp = std::less<K>>
typedef const K& claw::avl< K, Comp >::const_reference

The type of a const reference on the values.

Definition at line 63 of file avl.hpp.

◆ key_less

template<class K, class Comp = std::less<K>>
typedef Comp claw::avl< K, Comp >::key_less

The comparator to use to compare the keys.

Definition at line 60 of file avl.hpp.

◆ key_type

template<class K, class Comp = std::less<K>>
typedef K claw::avl< K, Comp >::key_type

The type of the keys in the tree.

Definition at line 54 of file avl.hpp.

◆ referent_type

template<class K, class Comp = std::less<K>>
typedef K claw::avl< K, Comp >::referent_type

The type passed to the template.

Definition at line 57 of file avl.hpp.

◆ value_type

template<class K, class Comp = std::less<K>>
typedef K claw::avl< K, Comp >::value_type

The type of the values in the tree.

Definition at line 51 of file avl.hpp.


The documentation for this class was generated from the following file: