DGtal 1.3.0
|
#include <DGtal/topology/CubicalComplex.h>
Public Member Functions | |
bool | operator() (const CellMapIterator &it1, const CellMapIterator &it2) const |
This structure is used to order cells (represented by their iterator in the CubicalComplex container) in a priority queue. By default, it compares the values associated to each cell (the value is the cell data masked by VALUE).
Definition at line 282 of file CubicalComplex.h.
|
inline |
This operator compares two cells specified by their iterators it1 and it2 and returns true whenever it1 has smallest data & VALUE than it2.
it1 | any iterator on a cell of this cubical complex. |
it2 | any iterator on a cell of this cubical complex. |
Definition at line 293 of file CubicalComplex.h.