33#if defined(SimpleRandomAccessRangeFromPoint_RECURSES)
34#error Recursive header files inclusion detected in SimpleRandomAccessRangeFromPoint.h
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>
84 typedef typename DistanceFunctor::Point
Point;
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
399#undef SimpleRandomAccessRangeFromPoint_RECURSES
Aim: Provides an adapter for classical iterators that can iterate through the underlying data structu...
Aim: model of CBidirectionalRangeFromPoint that adapts any range of elements bounded by two iterators...
void selfDisplay(std::ostream &out) const
BOOST_CONCEPT_ASSERT((boost::UnaryFunction< DistanceFunctor, typename DistanceFunctor::Difference, typename DistanceFunctor::Point >))
DGtal::Circulator< Iterator > Circulator
DistanceFunctor myDistance
ConstReverseIterator rend() const
ConstIterator begin() const
BOOST_CONCEPT_ASSERT((boost::RandomAccessIterator< TConstIterator >))
DistanceFunctor::Point Point
Iterator begin(const Point &aPoint)
std::reverse_iterator< Iterator > ReverseOutputIterator
~SimpleRandomAccessRangeFromPoint()
std::string className() const
ConstReverseCirculator rc() const
ConstReverseIterator rbegin(const Point &aPoint) const
std::reverse_iterator< Iterator > ReverseIterator
OutputIterator outputIterator(const Point &aPoint)
std::reverse_iterator< ConstCirculator > ConstReverseCirculator
TConstIterator ConstIterator
ConstCirculator c() const
ConstIterator begin(const Point &aPoint) const
std::reverse_iterator< Circulator > ReverseCirculator
SimpleRandomAccessRangeFromPoint(const SimpleRandomAccessRangeFromPoint &other)
DGtal::Circulator< ConstIterator > ConstCirculator
ReverseOutputIterator routputIterator(const Point &aPoint)
ConstIterator end() const
SimpleRandomAccessRangeFromPoint(const TIterator &itb, const TIterator &ite, const DistanceFunctor &aDistance)
BOOST_CONCEPT_ASSERT((boost::RandomAccessIterator< TIterator >))
SimpleRandomAccessRangeFromPoint & operator=(const SimpleRandomAccessRangeFromPoint &other)
std::reverse_iterator< ConstIterator > ConstReverseIterator
ReverseOutputIterator routputIterator()
ConstReverseIterator rbegin() const
OutputIterator outputIterator()
ReverseIterator rbegin(const Point &aPoint)
DGtal is the top-level namespace which contains all DGtal functions and types.
Go to http://www.sgi.com/tech/stl/RandomAccessIterator.html.
Go to http://www.sgi.com/tech/stl/UnaryFunction.html.