33 #if defined(SimpleRandomAccessRangeFromPoint_RECURSES)
34 #error Recursive header files inclusion detected in SimpleRandomAccessRangeFromPoint.h
35 #else // defined(SimpleRandomAccessRangeFromPoint_RECURSES)
37 #define SimpleRandomAccessRangeFromPoint_RECURSES
39 #if !defined SimpleRandomAccessRangeFromPoint_h
41 #define SimpleRandomAccessRangeFromPoint_h
45 #include "DGtal/base/BasicFunctors.h"
46 #include "DGtal/base/Circulator.h"
47 #include "DGtal/base/IteratorAdapter.h"
48 #include "DGtal/base/CBidirectionalRangeFromPoint.h"
49 #include "boost/concept_check.hpp"
71 template <
typename TConstIterator,
typename TIterator,
typename DistanceFunctor>
112 const TIterator& ite,
113 const DistanceFunctor & aDistance )
131 if (
this != &other )
163 out <<
"[SimpleRandomAccessRangeFromPoint]" << std::endl;
165 std::copy (
myBegin,
myEnd, std::ostream_iterator<Value> ( out,
", " ) );
174 return "SimpleRandomAccessRangeFromPoint";
367 ReverseCirculator
rc()
376 ConstCirculator
c()
const
385 ConstReverseCirculator
rc()
const
397 #endif // !defined SimpleRandomAccessRangeFromPoint_h
399 #undef SimpleRandomAccessRangeFromPoint_RECURSES
400 #endif // else defined(SimpleRandomAccessRangeFromPoint_RECURSES)
void selfDisplay(std::ostream &out) const
Aim: Provides an adapter for classical iterators that can iterate through the underlying data structu...
std::reverse_iterator< Circulator > ReverseCirculator
DistanceFunctor::Point Point
ReverseOutputIterator routputIterator()
SimpleRandomAccessRangeFromPoint(const TIterator &itb, const TIterator &ite, const DistanceFunctor &aDistance)
OutputIterator outputIterator(const Point &aPoint)
ConstIterator begin(const Point &aPoint) const
std::string className() const
DGtal::Circulator< Iterator > Circulator
std::reverse_iterator< Iterator > ReverseOutputIterator
ConstCirculator c() const
ConstReverseIterator rend() const
std::reverse_iterator< Iterator > ReverseIterator
DGtal is the top-level namespace which contains all DGtal functions and types.
ReverseOutputIterator routputIterator(const Point &aPoint)
Aim: model of CBidirectionalRangeFromPoint that adapts any range of elements bounded by two iterators...
DGtal::Circulator< ConstIterator > ConstCirculator
std::reverse_iterator< ConstIterator > ConstReverseIterator
ConstReverseCirculator rc() const
ReverseIterator rbegin(const Point &aPoint)
Go to http://www.sgi.com/tech/stl/RandomAccessIterator.html.
~SimpleRandomAccessRangeFromPoint()
DistanceFunctor myDistance
Go to http://www.sgi.com/tech/stl/UnaryFunction.html.
ConstReverseIterator rbegin(const Point &aPoint) const
ConstIterator end() const
ConstIterator begin() const
SimpleRandomAccessRangeFromPoint(const SimpleRandomAccessRangeFromPoint &other)
BOOST_CONCEPT_ASSERT((boost::RandomAccessIterator< TIterator >))
ConstReverseIterator rbegin() const
SimpleRandomAccessRangeFromPoint & operator=(const SimpleRandomAccessRangeFromPoint &other)
TConstIterator ConstIterator
std::reverse_iterator< ConstCirculator > ConstReverseCirculator
Iterator begin(const Point &aPoint)
OutputIterator outputIterator()