Prepared IteratorWrapper for key-value container.
More...
#include <OgreIteratorWrapper.h>
|
| MapIteratorWrapper (IteratorType start, IteratorType last) |
| Constructor. More...
|
|
const IteratorType & | begin () |
| Bookmark to the begin of the underlying collection. More...
|
|
IteratorType & | current () |
| Full access to the current iterator. More...
|
|
const IteratorType & | end () |
| Bookmark to the end (one behind the last element) of the underlying collection. More...
|
|
ValueType | getNext () |
| Returns the next(=current) value element in the collection, and advances to the next. More...
|
|
bool | hasMoreElements () const |
| Returns true if there are more items in the collection. More...
|
|
void | moveNext () |
| Moves the iterator on one element. More...
|
|
KeyType | peekNextKey () const |
| Returns the next(=current) key element in the collection, without advancing to the next. More...
|
|
ValueType | peekNextValue () const |
| Returns the next(=current) value element in the collection, without advancing to the next. More...
|
|
const PointerType | peekNextValuePtr () const |
| Returns a pointer to the next/current value element in the collection, without advancing to the next afterwards. More...
|
|
template<typename T, typename IteratorType>
class Ogre::MapIteratorWrapper< T, IteratorType >
Prepared IteratorWrapper for key-value container.
- Template Parameters
-
T | Container (map - or also set ) |
IteratorType | T::iterator or T::const_iterator |
Have a look at MapIterator and ConstMapIterator for a concrete usage
◆ const_iterator
Typedef to fulfill container interface.
Useful if you want to use BOOST_FOREACH
- Note
- there is no distinction between const_iterator and iterator.
keep this in mind if you want to derivate from this class.
◆ iterator
Typedef to fulfill container interface.
Useful if you want to use BOOST_FOREACH
- Note
- there is no distinction between const_iterator and iterator.
keep this in mind if you want to derivate from this class.
◆ KeyType
template<typename T , typename IteratorType >
Type you expect to get by funktions like peekNextKey.
◆ PairType
template<typename T , typename IteratorType >
Unused, just to make it clear that map/set::value_type is not a ValueType.
◆ PointerType
template<typename T , typename IteratorType >
Redefined PointerType for a map/set.
◆ ValueType
template<typename T , typename IteratorType >
Redefined ValueType for a map/set.
◆ MapIteratorWrapper()
template<typename T , typename IteratorType >
◆ begin()
Bookmark to the begin of the underlying collection.
◆ current()
Full access to the current iterator.
◆ end()
Bookmark to the end (one behind the last element) of the underlying collection.
◆ getNext()
template<typename T , typename IteratorType >
◆ hasMoreElements()
Returns true if there are more items in the collection.
◆ moveNext()
Moves the iterator on one element.
◆ peekNextKey()
template<typename T , typename IteratorType >
Returns the next(=current) key element in the collection, without advancing to the next.
◆ peekNextValue()
template<typename T , typename IteratorType >
Returns the next(=current) value element in the collection, without advancing to the next.
◆ peekNextValuePtr()
template<typename T , typename IteratorType >
Returns a pointer to the next/current value element in the collection, without advancing to the next afterwards.
The documentation for this class was generated from the following file: