![]() |
Public API Reference |
![]() |
Const 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 iterator for map.
Definition at line 1227 of file redblacktree.h.
bool csRedBlackTreeMap< K, T, Allocator, Ordering >::ConstIterator::HasNext | ( | ) | const [inline] |
Returns a boolean indicating whether or not the map has more elements.
Definition at line 1231 of file redblacktree.h.
const T& csRedBlackTreeMap< K, T, Allocator, Ordering >::ConstIterator::Next | ( | K & | key | ) | [inline] |
Get the next element's value.
Definition at line 1252 of file redblacktree.h.
const T& csRedBlackTreeMap< K, T, Allocator, Ordering >::ConstIterator::Next | ( | ) | [inline] |
Get the next element's value.
Definition at line 1260 of file redblacktree.h.
const T& csRedBlackTreeMap< K, T, Allocator, Ordering >::ConstIterator::PeekNext | ( | K & | key | ) | [inline] |
Get the next element's value without advancing the iterator.
Definition at line 1237 of file redblacktree.h.
const T& csRedBlackTreeMap< K, T, Allocator, Ordering >::ConstIterator::PeekNext | ( | ) | [inline] |
Get the next element's value without advancing the iterator.
Definition at line 1245 of file redblacktree.h.