csRedBlackTreeMap< K, T, Allocator, Ordering >::ReverseIterator Class Reference
Reverse iterator for map. More...
#include <csutil/redblacktree.h>
Public Member Functions | |
bool | HasNext () const |
Returns a boolean indicating whether or not the map has more elements. | |
T & | Next (K &key) |
Get the next element's value. | |
T & | PeekNext () |
Get the next element's value without advancing the iterator. | |
T & | PeekNext (K &key) |
Get the next element's value without advancing the iterator. | |
Friends | |
class | csRedBlackTreeMap |
Detailed Description
template<typename K, typename T, typename Allocator = csFixedSizeAllocator< sizeof(CS::Container::RedBlackTreeNode< csRedBlackTreePayload<K, T> >)>, template< typename K1, typename K2 > class Ordering = CS::Container::RedBlackTreeOrderingTotal>
class csRedBlackTreeMap< K, T, Allocator, Ordering >::ReverseIterator
Reverse iterator for map.
Definition at line 1376 of file redblacktree.h.
Member Function Documentation
template<typename K, typename T, typename Allocator = csFixedSizeAllocator< sizeof(CS::Container::RedBlackTreeNode< csRedBlackTreePayload<K, T> >)>, template< typename K1, typename K2 > class Ordering = CS::Container::RedBlackTreeOrderingTotal>
bool csRedBlackTreeMap< K, T, Allocator, Ordering >::ReverseIterator::HasNext | ( | ) | const [inline] |
Returns a boolean indicating whether or not the map has more elements.
Definition at line 1380 of file redblacktree.h.
template<typename K, typename T, typename Allocator = csFixedSizeAllocator< sizeof(CS::Container::RedBlackTreeNode< csRedBlackTreePayload<K, T> >)>, template< typename K1, typename K2 > class Ordering = CS::Container::RedBlackTreeOrderingTotal>
T& csRedBlackTreeMap< K, T, Allocator, Ordering >::ReverseIterator::Next | ( | K & | key | ) | [inline] |
Get the next element's value.
Definition at line 1401 of file redblacktree.h.
template<typename K, typename T, typename Allocator = csFixedSizeAllocator< sizeof(CS::Container::RedBlackTreeNode< csRedBlackTreePayload<K, T> >)>, template< typename K1, typename K2 > class Ordering = CS::Container::RedBlackTreeOrderingTotal>
T& csRedBlackTreeMap< K, T, Allocator, Ordering >::ReverseIterator::PeekNext | ( | ) | [inline] |
Get the next element's value without advancing the iterator.
Definition at line 1394 of file redblacktree.h.
template<typename K, typename T, typename Allocator = csFixedSizeAllocator< sizeof(CS::Container::RedBlackTreeNode< csRedBlackTreePayload<K, T> >)>, template< typename K1, typename K2 > class Ordering = CS::Container::RedBlackTreeOrderingTotal>
T& csRedBlackTreeMap< K, T, Allocator, Ordering >::ReverseIterator::PeekNext | ( | K & | key | ) | [inline] |
Get the next element's value without advancing the iterator.
Definition at line 1386 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