#include <tree.h>

Public Types | |
| typedef tree_iterator< T > | iterator |
| typedef const tree_iterator< T > | const_iterator |
Public Member Functions | |
| tree () | |
| tree (const T &inT) | |
| const bool | operator== (const tree &inTree) const |
| const tree & | operator= (const tree &in) |
| iterator | tree_iterator () const |
| iterator | tree_iterator () |
| tree (const tree &in) | |
| virtual | ~tree () |
| void | copy_tree (const tree &in) |
| const_iterator | begin () const |
| iterator | begin () |
| iterator & | end () const |
| const_iterator | in () const |
| iterator | in () |
| const_iterator | out () const |
| iterator | out () |
| void | clear () |
| T & | operator * () |
| const T & | operator * () const |
| T & | data () |
| const T & | data () const |
| const T & | data (const T &inData) |
| size_t | level () const |
| size_t | size () const |
| iterator | push_front (const T &inT) |
| iterator | push_back (const T &inT) |
| iterator | insert (const T &inT, bool(*pObj)(const T &, const T &)) |
| iterator | insert (const iterator &i) |
| iterator | insert (const T &inT) |
| iterator | reinsert (tree *in, bool(*pObj)(const T &, const T &)) |
| iterator | reinsert (tree *in) |
| bool | remove (const T &inData) |
| bool | erase (const iterator &i) |
| iterator | operator[] (size_t loc) const |
| iterator | operator[] (size_t loc) |
| iterator | find (const T &inT) const |
| iterator | find (const T &inT, bool(*obj)(const T &, const T &)) const |
| iterator | tree_find_depth (const T &inT) const |
| iterator | tree_find_depth (const T &inT, bool(*obj)(const T &, const T &)) const |
| iterator | tree_find_breadth (const T &inT) const |
| iterator | tree_find_breadth (const T &inT, bool(*obj)(const T &, const T &)) const |
| iterator | find (const T &inT, const iterator &iter) const |
| iterator | find (const T &inT, const iterator &iter, bool(*obj)(const T &, const T &)) const |
| iterator | tree_find_depth (const T &inT, const iterator &iter) const |
| iterator | tree_find_depth (const T &inT, const iterator &iter, bool(*obj)(const T &, const T &)) const |
| iterator | tree_find_breadth (const T &inT, const iterator &iter) const |
| iterator | tree_find_breadth (const T &inT, const iterator &iter, bool(*obj)(const T &, const T &)) const |
Protected Member Functions | |
| size_t | size (const tree &in) const |
| size_t | level (const tree &in) const |
| iterator | begin (const tree &in) const |
| const tree * | prev (const tree &in) const |
| const tree * | next (const tree &in) const |
| iterator | in (const tree &in) const |
| iterator | out (const tree &in) const |
| typedef tree_iterator<T> dtUtil::tree< T >::iterator |
Reimplemented in dtUtil::tree_iterator< T >.
| typedef const tree_iterator<T> dtUtil::tree< T >::const_iterator |
Reimplemented in dtUtil::tree_iterator< T >.
| dtUtil::tree< T >::tree | ( | ) | [inline] |
| dtUtil::tree< T >::tree | ( | const T & | inT | ) | [inline] |
| dtUtil::tree< T >::tree | ( | const tree< T > & | in | ) | [inline] |
| virtual dtUtil::tree< T >::~tree | ( | ) | [inline, virtual] |
| size_t dtUtil::tree< T >::size | ( | const tree< T > & | in | ) | const [inline, protected] |
| size_t dtUtil::tree< T >::level | ( | const tree< T > & | in | ) | const [inline, protected] |
| iterator dtUtil::tree< T >::begin | ( | const tree< T > & | in | ) | const [inline, protected] |
| const tree* dtUtil::tree< T >::prev | ( | const tree< T > & | in | ) | const [inline, protected] |
| const tree* dtUtil::tree< T >::next | ( | const tree< T > & | in | ) | const [inline, protected] |
| iterator dtUtil::tree< T >::in | ( | const tree< T > & | in | ) | const [inline, protected] |
| iterator dtUtil::tree< T >::out | ( | const tree< T > & | in | ) | const [inline, protected] |
| const bool dtUtil::tree< T >::operator== | ( | const tree< T > & | inTree | ) | const [inline] |
| const tree& dtUtil::tree< T >::operator= | ( | const tree< T > & | in | ) | [inline] |
| iterator dtUtil::tree< T >::tree_iterator | ( | ) | const [inline] |
| iterator dtUtil::tree< T >::tree_iterator | ( | ) | [inline] |
Reimplemented in dtUtil::tree_iterator< T >.
| void dtUtil::tree< T >::copy_tree | ( | const tree< T > & | in | ) | [inline] |
| const_iterator dtUtil::tree< T >::begin | ( | ) | const [inline] |
Reimplemented in dtUtil::tree_iterator< T >.
| iterator dtUtil::tree< T >::begin | ( | ) | [inline] |
Reimplemented in dtUtil::tree_iterator< T >.
| iterator& dtUtil::tree< T >::end | ( | ) | const [inline] |
Reimplemented in dtUtil::tree_iterator< T >.
| const_iterator dtUtil::tree< T >::in | ( | ) | const [inline] |
Reimplemented in dtUtil::tree_iterator< T >.
| iterator dtUtil::tree< T >::in | ( | ) | [inline] |
Reimplemented in dtUtil::tree_iterator< T >.
| const_iterator dtUtil::tree< T >::out | ( | ) | const [inline] |
Reimplemented in dtUtil::tree_iterator< T >.
| iterator dtUtil::tree< T >::out | ( | ) | [inline] |
Reimplemented in dtUtil::tree_iterator< T >.
| void dtUtil::tree< T >::clear | ( | ) | [inline] |
| T& dtUtil::tree< T >::operator * | ( | ) | [inline] |
Reimplemented in dtUtil::tree_iterator< T >.
| const T& dtUtil::tree< T >::operator * | ( | ) | const [inline] |
Reimplemented in dtUtil::tree_iterator< T >.
| T& dtUtil::tree< T >::data | ( | ) | [inline] |
Reimplemented in dtUtil::tree_iterator< T >.
| const T& dtUtil::tree< T >::data | ( | ) | const [inline] |
Reimplemented in dtUtil::tree_iterator< T >.
| const T& dtUtil::tree< T >::data | ( | const T & | inData | ) | [inline] |
| size_t dtUtil::tree< T >::level | ( | ) | const [inline] |
Reimplemented in dtUtil::tree_iterator< T >.
| size_t dtUtil::tree< T >::size | ( | ) | const [inline] |
Reimplemented in dtUtil::tree_iterator< T >.
| iterator dtUtil::tree< T >::push_front | ( | const T & | inT | ) | [inline] |
Reimplemented in dtUtil::tree_iterator< T >.
| iterator dtUtil::tree< T >::push_back | ( | const T & | inT | ) | [inline] |
Reimplemented in dtUtil::tree_iterator< T >.
| iterator dtUtil::tree< T >::insert | ( | const T & | inT, | |
| bool(*)(const T &, const T &) | pObj | |||
| ) | [inline] |
Reimplemented in dtUtil::tree_iterator< T >.
| iterator dtUtil::tree< T >::insert | ( | const iterator & | i | ) | [inline] |
| iterator dtUtil::tree< T >::insert | ( | const T & | inT | ) | [inline] |
Reimplemented in dtUtil::tree_iterator< T >.
| iterator dtUtil::tree< T >::reinsert | ( | tree< T > * | in, | |
| bool(*)(const T &, const T &) | pObj | |||
| ) | [inline] |
| iterator dtUtil::tree< T >::reinsert | ( | tree< T > * | in | ) | [inline] |
| bool dtUtil::tree< T >::remove | ( | const T & | inData | ) | [inline] |
Reimplemented in dtUtil::tree_iterator< T >.
| bool dtUtil::tree< T >::erase | ( | const iterator & | i | ) | [inline] |
| iterator dtUtil::tree< T >::operator[] | ( | size_t | loc | ) | const [inline] |
Reimplemented in dtUtil::tree_iterator< T >.
| iterator dtUtil::tree< T >::operator[] | ( | size_t | loc | ) | [inline] |
Reimplemented in dtUtil::tree_iterator< T >.
| iterator dtUtil::tree< T >::find | ( | const T & | inT | ) | const [inline] |
Reimplemented in dtUtil::tree_iterator< T >.
| iterator dtUtil::tree< T >::find | ( | const T & | inT, | |
| bool(*)(const T &, const T &) | obj | |||
| ) | const [inline] |
Reimplemented in dtUtil::tree_iterator< T >.
| iterator dtUtil::tree< T >::tree_find_depth | ( | const T & | inT | ) | const [inline] |
Reimplemented in dtUtil::tree_iterator< T >.
| iterator dtUtil::tree< T >::tree_find_depth | ( | const T & | inT, | |
| bool(*)(const T &, const T &) | obj | |||
| ) | const [inline] |
Reimplemented in dtUtil::tree_iterator< T >.
| iterator dtUtil::tree< T >::tree_find_breadth | ( | const T & | inT | ) | const [inline] |
Reimplemented in dtUtil::tree_iterator< T >.
| iterator dtUtil::tree< T >::tree_find_breadth | ( | const T & | inT, | |
| bool(*)(const T &, const T &) | obj | |||
| ) | const [inline] |
Reimplemented in dtUtil::tree_iterator< T >.
| iterator dtUtil::tree< T >::find | ( | const T & | inT, | |
| const iterator & | iter | |||
| ) | const [inline] |
Reimplemented in dtUtil::tree_iterator< T >.
| iterator dtUtil::tree< T >::find | ( | const T & | inT, | |
| const iterator & | iter, | |||
| bool(*)(const T &, const T &) | obj | |||
| ) | const [inline] |
Reimplemented in dtUtil::tree_iterator< T >.
| iterator dtUtil::tree< T >::tree_find_depth | ( | const T & | inT, | |
| const iterator & | iter | |||
| ) | const [inline] |
Reimplemented in dtUtil::tree_iterator< T >.
| iterator dtUtil::tree< T >::tree_find_depth | ( | const T & | inT, | |
| const iterator & | iter, | |||
| bool(*)(const T &, const T &) | obj | |||
| ) | const [inline] |
Reimplemented in dtUtil::tree_iterator< T >.
| iterator dtUtil::tree< T >::tree_find_breadth | ( | const T & | inT, | |
| const iterator & | iter | |||
| ) | const [inline] |
Reimplemented in dtUtil::tree_iterator< T >.
| iterator dtUtil::tree< T >::tree_find_breadth | ( | const T & | inT, | |
| const iterator & | iter, | |||
| bool(*)(const T &, const T &) | obj | |||
| ) | const [inline] |
Reimplemented in dtUtil::tree_iterator< T >.