Tulip  5.6.3
Large graphs analysis and drawing
tlp::StlIterator< T, ITERATOR > Class Template Reference

#include <StlIterator.h>

+ Inheritance diagram for tlp::StlIterator< T, ITERATOR >:
+ Collaboration diagram for tlp::StlIterator< T, ITERATOR >:

Public Member Functions

 StlIterator (const ITERATOR &startIt, const ITERATOR &endIt)
 
bool hasNext ()
 
next ()
 
- Public Member Functions inherited from tlp::Iterator< T >
iterator_t begin ()
 
iterator_t end ()
 

Detailed Description

template<typename T, typename ITERATOR>
class tlp::StlIterator< T, ITERATOR >

StlIterator wraps a stl iterator.

Creates a Tulip Iterator from two stl iterators.

Parameters
startIta stl iterator from which to begin the iteration
endIta stl iterator on which to end the iteration

Definition at line 44 of file StlIterator.h.

Member Function Documentation

◆ hasNext()

template<typename T , typename ITERATOR >
bool tlp::StlIterator< T, ITERATOR >::hasNext ( )
inlinevirtual

Tells if the sequence is at its end.

Returns
bool Whether there are more elements to iterate.

Implements tlp::Iterator< T >.

Definition at line 51 of file StlIterator.h.

◆ next()

template<typename T , typename ITERATOR >
T tlp::StlIterator< T, ITERATOR >::next ( )
inlinevirtual

Moves the Iterator on the next element.

Returns
The current element pointed by the Iterator.

Implements tlp::Iterator< T >.

Definition at line 46 of file StlIterator.h.