csRedBlackTree< K, Allocator, Ordering >::Iterator Class Reference
#include <csutil/redblacktree.h>
Public Member Functions | |
bool | HasNext () const |
Returns a boolean indicating whether or not the tree has more elements. | |
K & | Next () |
Get the next element's value. | |
K & | PeekNext () |
Get the next element's value without advancing the iterator. | |
Friends | |
class | csRedBlackTree |
Detailed Description
template<typename K, typename Allocator = CS::Container::DefaultRedBlackTreeAllocator<K>, template< typename K, typename K2 > class Ordering = CS::Container::RedBlackTreeOrderingTotal>
class csRedBlackTree< K, Allocator, Ordering >::Iterator
Iterator for tree.
Definition at line 978 of file redblacktree.h.
Member Function Documentation
template<typename K, typename Allocator = CS::Container::DefaultRedBlackTreeAllocator<K>, template< typename K, typename K2 > class Ordering = CS::Container::RedBlackTreeOrderingTotal>
bool csRedBlackTree< K, Allocator, Ordering >::Iterator::HasNext | ( | ) | const [inline] |
Returns a boolean indicating whether or not the tree has more elements.
Definition at line 982 of file redblacktree.h.
template<typename K, typename Allocator = CS::Container::DefaultRedBlackTreeAllocator<K>, template< typename K, typename K2 > class Ordering = CS::Container::RedBlackTreeOrderingTotal>
K& csRedBlackTree< K, Allocator, Ordering >::Iterator::Next | ( | ) | [inline] |
Get the next element's value.
Definition at line 995 of file redblacktree.h.
template<typename K, typename Allocator = CS::Container::DefaultRedBlackTreeAllocator<K>, template< typename K, typename K2 > class Ordering = CS::Container::RedBlackTreeOrderingTotal>
K& csRedBlackTree< K, Allocator, Ordering >::Iterator::PeekNext | ( | ) | [inline] |
Get the next element's value without advancing the iterator.
Definition at line 988 of file redblacktree.h.
The documentation for this class was generated from the following file:
- csutil/redblacktree.h
Generated for Crystal Space 2.0 by doxygen 1.6.1