PIMapIteratorReverse< Key, T > Class Template Reference

Java-style reverse iterator for PIMap. More...

#include <pimap.h>

Public Member Functions
const Key &	key () const
	Returns current key. More...
T &	value ()
	Returns current value. More...
bool	hasNext () const
	Returns true if iterator can jump to next entry. More...
bool	next ()
	Jump to next entry and return true if new position is valid. More...
void	reset ()
	Reset iterator to initial position. More...

Detailed Description

template<typename Key, typename T>
class PIMapIteratorReverse< Key, T >

Java-style reverse iterator for PIMap.

This class used to easy serial reverse access keys and values in PIMap with write permitions. Use constructor to create iterator, or use PIMap::makeReverseIterator().

PIMap<int, PIString> m;
m[1] = "one";
m[2] = "two";
m[4] = "four";
auto it = m.makeReverseIterator();
while (it.next()) {
    it.value().append("_!");
    piCout << it.key() << it.value();
}
// 4 four_!
// 2 two_!
// 1 one_!

Member Function Documentation

key()

template<typename Key , typename T >

const Key & PIMapIteratorReverse< Key, T >::key ( ) const

inline

Returns current key.

See also

value()

value()

template<typename Key , typename T >

T & PIMapIteratorReverse< Key, T >::value ( )

inline

Returns current value.

See also

key()

hasNext()

template<typename Key , typename T >

bool PIMapIteratorReverse< Key, T >::hasNext ( ) const

inline

Returns true if iterator can jump to next entry.

See also

next()

next()

template<typename Key , typename T >

bool PIMapIteratorReverse< Key, T >::next ( )

inline

Jump to next entry and return true if new position is valid.

See also

hasNext(), reset()

reset()

template<typename Key , typename T >

void PIMapIteratorReverse< Key, T >::reset ( )

inline

Reset iterator to initial position.

See also

next()