![]() |
Public API Reference |
![]() |
Const 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. | |
const T & | Next (K &key) |
Get the next element's value. | |
const T & | Next () |
Get the next element's value. | |
const T & | PeekNext (K &key) |
Get the next element's value without advancing the iterator. | |
const T & | PeekNext () |
Get the next element's value without advancing the iterator. | |
Friends | |
class | csRedBlackTreeMap |
Const reverse iterator for map.
Definition at line 1326 of file redblacktree.h.
bool csRedBlackTreeMap< K, T, Allocator, Ordering >::ConstReverseIterator::HasNext | ( | ) | const [inline] |
Returns a boolean indicating whether or not the map has more elements.
Definition at line 1330 of file redblacktree.h.
const T& csRedBlackTreeMap< K, T, Allocator, Ordering >::ConstReverseIterator::Next | ( | K & | key | ) | [inline] |
Get the next element's value.
Definition at line 1351 of file redblacktree.h.
const T& csRedBlackTreeMap< K, T, Allocator, Ordering >::ConstReverseIterator::Next | ( | ) | [inline] |
Get the next element's value.
Definition at line 1359 of file redblacktree.h.
const T& csRedBlackTreeMap< K, T, Allocator, Ordering >::ConstReverseIterator::PeekNext | ( | K & | key | ) | [inline] |
Get the next element's value without advancing the iterator.
Definition at line 1336 of file redblacktree.h.
const T& csRedBlackTreeMap< K, T, Allocator, Ordering >::ConstReverseIterator::PeekNext | ( | ) | [inline] |
Get the next element's value without advancing the iterator.
Definition at line 1344 of file redblacktree.h.