|
Honeycomb
0.1
Component-Model Framework
|
Bidirectional iterator over map key/value pairs. More...
#include <MtMap.h>
Public Types | |
| typedef MtPair< Key, decltype(declval< Head >).get(Key()))> | Pair |
| typedef MtMapIter< Head, Next > | NextIter |
| typedef MtMapIter< Head, Prev > | PrevIter |
Public Member Functions | |
| MtMapIter (Head &head) | |
| NextIter | operator++ () |
| PrevIter | operator-- () |
| template<class Iter > | |
| bool | operator== (const Iter &rhs) const |
| template<class Iter > | |
| bool | operator!= (const Iter &rhs) const |
| const Pair & | operator* () const |
| Pair & | operator* () |
| const Pair * | operator-> () const |
| Pair * | operator-> () |
Friends | |
| class | MtMapIter |
Bidirectional iterator over map key/value pairs.
Every iteration step is a new type of iterator and pair, so this iterator can't be used normally. This iterator should be used in a recursive templated function.
| typedef MtMapIter<Head, Next> honey::MtMapIter< Head, Elem >::NextIter |
| typedef MtPair<Key, decltype(declval<Head>).get(Key()))> honey::MtMapIter< Head, Elem >::Pair |
| typedef MtMapIter<Head, Prev> honey::MtMapIter< Head, Elem >::PrevIter |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
friend |
1.8.10