tlp::stlmapiterator(3)
NAME
tlp::StlMapIterator
SYNOPSIS
#include <StlIterator.h> Inherits Iterator< std::pair< KEY, VALUE > >. Public Member Functions StlMapIterator (typename std::map< KEY, VALUE >::const_iterator startIt, typename std::map< KEY, VALUE >::const_iterator endIt) std::pair< KEY, VALUE > next () StlMapIterator implemetation. bool hasNext () Return true if it exist a next element. template<typename KEY, typename VALUE> struct tlp::StlMapIterator< KEY, VALUE >
Constructor & Destructor Documentation
- template<typename KEY , typename VALUE > tlp::StlMapIterator< KEY, VALUE
- >::StlMapIterator (typename std::map< KEY, VALUE >::const_iterator startIt, typename std::map< KEY, VALUE >::const_iterator endIt) [inline]
Member Function Documentation
- template<typename KEY , typename VALUE > bool tlp::StlMapIterator< KEY,
- VALUE >::hasNext () [inline, virtual] Return true if it exist a next element.
- Implements tlp::Iterator< std::pair< KEY, VALUE > >.
- template<typename KEY , typename VALUE > std::pair< KEY, VALUE >
- tlp::StlMapIterator< KEY, VALUE >::next () [inline, virtual] StlMapIterator implemetation.
- Implements tlp::Iterator< std::pair< KEY, VALUE > >.
Author
- Generated automatically by Doxygen for Tulip Graph Library from the
source code.