![]() |
Public API Reference |
![]() |
#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 (K &key) |
Get the next element's value without advancing the iterator. | |
T & | PeekNext () |
Get the next element's value without advancing the iterator. | |
Friends | |
class | csRedBlackTreeMap |
Iterator for map.
Definition at line 1277 of file redblacktree.h.
bool csRedBlackTreeMap< K, T, Allocator, Ordering >::Iterator::HasNext | ( | ) | const [inline] |
Returns a boolean indicating whether or not the map has more elements.
Definition at line 1281 of file redblacktree.h.
T& csRedBlackTreeMap< K, T, Allocator, Ordering >::Iterator::Next | ( | K & | key | ) | [inline] |
Get the next element's value.
Definition at line 1302 of file redblacktree.h.
T& csRedBlackTreeMap< K, T, Allocator, Ordering >::Iterator::PeekNext | ( | K & | key | ) | [inline] |
Get the next element's value without advancing the iterator.
Definition at line 1287 of file redblacktree.h.
T& csRedBlackTreeMap< K, T, Allocator, Ordering >::Iterator::PeekNext | ( | ) | [inline] |
Get the next element's value without advancing the iterator.
Definition at line 1295 of file redblacktree.h.