Unigine::Tree Class
| Header: | #include <UnigineTree.h> |
Tree Class
Members
Iterator back( )
Returns the back iterator.Return value
Back iterator.ConstIterator back( ) const
Returns the back const iterator.Return value
Back const iterator.Iterator begin( )
Returns the begin iterator.Return value
Begin iterator.ConstIterator begin( ) const
Returns the begin const iterator.Return value
Begin const iterator.void clear( )
Clears a tree.int empty( ) const
Returns the 1 if the tree is empty; otherwise, 0 is returned.Return value
The empty flag.Iterator end( )
Returns the end iterator.Return value
End iterator.ConstIterator end( ) const
Returns the end const iterator.Return value
End const iterator.Iterator find( const T & key )
Finds an item in the tree.Arguments
- const T & key - Key.
Return value
The iterator.ConstIterator find( const T & key ) const
Finds an item in the tree.Arguments
- const T & key - Key.
Return value
The const iterator.Tree< Key, Data > & operator=( const Tree< Key, Data > & tree )
Assignment operator for the tree.Arguments
- const Tree< Key, Data > & tree - Tree.
void remove( const Key & key )
Removes an item from the tree.Arguments
- const Key & key - Key.
int size( ) const
Returns the size of the tree.Return value
The size of the tree.Tree( )
Default constructor that produces an empty tree.Tree( const Tree< Key, Data > & tree )
Copy constructor.Arguments
- const Tree< Key, Data > & tree - tree.
~Tree( )
Destructor.Last update:
2018-12-27
Help improve this article
Was this article helpful?
(or select a word/phrase and press Ctrl+Enter)