This Iterator sorts the nodes in a sequence based on their values in a DoubleProperty. More...

#include <SortIterator.h>

Inheritance diagram for tlp::SortNodeIterator:

Collaboration diagram for tlp::SortNodeIterator:

Public Member Functions
	SortNodeIterator (Iterator< node > itIn, DoubleProperty metric)
	~SortNodeIterator ()
Public Member Functions inherited from tlp::StableIterator< node >
	StableIterator (Iterator< node > *inputIterator, size_t nbElements=0, bool deleteIterator=true)
	Creates a stable Iterator, that allows to delete elements from a graph while iterating on them.
	~StableIterator ()
node	next ()
	Moves the Iterator on the next element.
bool	hasNext ()
	Tells if the sequence is at its end.
void	restart ()
	Restarts the iteration by moving the Iterator to the beginning of the sequence.
Public Member Functions inherited from tlp::Iterator< node >
	Iterator ()
virtual	~Iterator ()

Additional Inherited Members
Protected Attributes inherited from tlp::StableIterator< node >
std::vector< node >	sequenceCopy
	A copy of the sequence of elements to iterate on.
std::vector< node >::const_iterator	copyIterator
	STL const_iterator on the cloned sequence.

Detailed Description

This Iterator sorts the nodes in a sequence based on their values in a DoubleProperty.

Constructor & Destructor Documentation

tlp::SortNodeIterator::SortNodeIterator	(	Iterator< node > *	itIn,
		DoubleProperty *	metric
	)

inline

tlp::SortNodeIterator::~SortNodeIterator ( )

inline