Tulip
5.2.1
Large graphs analysis and drawing
|
#include <SortIterator.h>
Public Member Functions | |
SortIterator (Iterator< T > *itIn, CompareFunction &&compFunc) | |
Public Member Functions inherited from tlp::StableIterator< T > | |
StableIterator (Iterator< T > *inputIterator, size_t nbElements=0, bool deleteIterator=true, bool sortCopy=false) | |
bool | hasNext () |
T | next () |
void | restart () |
Public Member Functions inherited from tlp::Iterator< T > | |
iterator_t | begin () |
iterator_t | end () |
Additional Inherited Members | |
Protected Attributes inherited from tlp::StableIterator< T > | |
std::vector< T >::const_iterator | copyIterator |
std::vector< T > | sequenceCopy |
Iterator that wraps an existing one and sorts its iterated elements based on comparison function.
it | the iterator to sort |
comp | functor or lambda function taking two parameters of type const T& and returning a boolean: true if the first parameter is lesser or equal than the second one, false otherwise |
Definition at line 211 of file SortIterator.h.