Tulip
5.2.1
Large graphs analysis and drawing
|
#include <UniqueIterator.h>
Public Member Functions | |
UniqueIterator (Iterator< T > *it, CheckFunc checkFunctor=CheckFunc()) | |
bool | hasNext () |
T | next () |
void | update () |
Public Member Functions inherited from tlp::Iterator< T > | |
iterator_t | begin () |
iterator_t | end () |
UniqueIterator enables to remove duplicated elements in an iterator.
it | the iterator in which we want to filter out duplicated elements |
checkFunctor | a functor or a lambda function that enables to indicate whether or not the element could be duplicated (default test all elements) |
The functor function shoul have the following form
checkFunctor are used for optimization purpose to prevent to log(n) test for all elements when not necessary.
Definition at line 66 of file UniqueIterator.h.
|
inlinevirtual |
Tells if the sequence is at its end.
Implements tlp::Iterator< T >.
Definition at line 83 of file UniqueIterator.h.
|
inlinevirtual |
Moves the Iterator on the next element.
Implements tlp::Iterator< T >.
Definition at line 77 of file UniqueIterator.h.