|
| | avl () |
| | AVL constructor. More...
|
| |
| | avl (const avl< K, Comp > &that) |
| | AVL copy constructor. More...
|
| |
| template<typename InputIterator > |
| | avl (InputIterator first, InputIterator last) |
| | Constructor from a range. More...
|
| |
| void | insert (const K &key) |
| | Add a value in a tree. More...
|
| |
| template<typename InputIterator > |
| void | insert (InputIterator first, InputIterator last) |
| | Add a range of items in the tree. More...
|
| |
| void | erase (const K &key) |
| | Delete a value in a tree. More...
|
| |
| void | clear () |
| | Clear a tree. More...
|
| |
| unsigned int | size () const |
| | Get the size of a tree. More...
|
| |
| bool | empty () const |
| | Tell if a tree is empty or not. More...
|
| |
|
const_iterator | begin () const |
| | Get an iterator on the nodes of the tree.
|
| |
|
const_iterator | end () const |
| | Get an iterator after the end of the tree.
|
| |
| const_iterator | find (const K &key) const |
| | Get an iterator on the nodes of the tree from a specified key. More...
|
| |
| const_iterator | find_nearest_greater (const K &key) const |
| | Get an iterator on the nodes of the tree on the key imediatly after from a specified key. More...
|
| |
| const_iterator | find_nearest_lower (const K &key) const |
| | Get an iterator on the nodes of the tree on the key imediatly before from a specified key. More...
|
| |
|
const_iterator | lower_bound () const |
| | Get an iterator on the lowest value of the tree.
|
| |
|
const_iterator | upper_bound () const |
| | Get an iterator on the gratest value of the tree.
|
| |
| avl< K, Comp > & | operator= (const avl< K, Comp > &that) |
| | Assignment. More...
|
| |
| bool | operator== (const avl< K, Comp > &that) const |
| | Equality. More...
|
| |
| bool | operator!= (const avl< K, Comp > &that) const |
| | Disequality. More...
|
| |
| bool | operator< (const avl< K, Comp > &that) const |
| | Less than operator. More...
|
| |
| bool | operator> (const avl< K, Comp > &that) const |
| | Greater than operator. More...
|
| |
| bool | operator<= (const avl< K, Comp > &that) const |
| | Less or equal operator. More...
|
| |
| bool | operator>= (const avl< K, Comp > &that) const |
| | Greater or equal operator. More...
|
| |
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.