31 #if defined(GreedySegmentation_RECURSES) 32 #error Recursive header files inclusion detected in GreedySegmentation.h 33 #else // defined(GreedySegmentation_RECURSES) 35 #define GreedySegmentation_RECURSES 37 #if !defined GreedySegmentation_h 39 #define GreedySegmentation_h 44 #include "DGtal/base/Common.h" 45 #include "DGtal/geometry/curves/SegmentComputerUtils.h" 46 #include "DGtal/geometry/curves/CForwardSegmentComputer.h" 148 template <
typename TSegmentComputer>
233 const TSegmentComputer& aSegmentComputer,
413 void setMode(
const std::string& aMode);
511 template <
typename SegmentComputer>
513 operator<< ( std::ostream & out, const GreedySegmentation<SegmentComputer> & object );
520 #include "DGtal/geometry/curves/GreedySegmentation.ih" 525 #endif // !defined GreedySegmentation_h 527 #undef GreedySegmentation_RECURSES 528 #endif // else defined(GreedySegmentation_RECURSES) void selfDisplay(std::ostream &out) const
void setMode(const std::string &aMode)
const ConstIterator end() const
GreedySegmentation::SegmentComputerIterator end() const
MyDigitalSurface::ConstIterator ConstIterator
bool doesIntersectNext(const ConstIterator &it, const ConstIterator &itb, const ConstIterator &ite)
void setSubRange(const ConstIterator &itb, const ConstIterator &ite)
SegmentComputer::ConstIterator ConstIterator
SegmentComputer::ConstIterator ConstIterator
const SegmentComputer * operator->() const
SegmentComputerIterator(const GreedySegmentation< TSegmentComputer > *aSegmentation, const TSegmentComputer &aSegmentComputer, const bool &aFlag)
bool operator!=(const SegmentComputerIterator &aOther) const
Aim: Specific iterator to visit all the segments of a greedy segmentation.
TSegmentComputer SegmentComputer
SegmentComputerIterator & operator++()
const GreedySegmentation< TSegmentComputer > * myS
Aim: Computes the greedy segmentation of a range given by a pair of ConstIterators. The last element of a given segment is the first one one of the next segment.
bool myFlagIntersectPrevious
bool intersectNext() const
SegmentComputerIterator & operator=(const SegmentComputerIterator &aOther)
const SegmentComputer & operator*() const
void longestSegment(const ConstIterator &it)
GreedySegmentation::SegmentComputerIterator begin() const
SegmentComputer mySegmentComputer
SegmentComputer mySegmentComputer
Aim: Defines the concept describing a forward segment computer. Like any model of CIncrementalSegment...
~SegmentComputerIterator()
DGtal is the top-level namespace which contains all DGtal functions and types.
const ConstIterator begin() const
GreedySegmentation & operator=(const GreedySegmentation &other)
bool intersectPrevious() const
BOOST_CONCEPT_ASSERT((concepts::CForwardSegmentComputer< TSegmentComputer >))
GreedySegmentation::SegmentComputer SegmentComputer
bool operator==(const SegmentComputerIterator &aOther) const