33 #if defined(SimpleConstRange_RECURSES) 34 #error Recursive header files inclusion detected in SimpleConstRange.h 35 #else // defined(SimpleConstRange_RECURSES) 37 #define SimpleConstRange_RECURSES 39 #if !defined SimpleConstRange_h 41 #define SimpleConstRange_h 47 #include "DGtal/base/BasicFunctors.h" 48 #include "DGtal/base/Circulator.h" 49 #include "DGtal/base/ConstIteratorAdapter.h" 50 #include "boost/concept_check.hpp" 71 template <
typename TConstIterator>
112 if (
this != &other )
139 out <<
"[SimpleConstRange]" << std::endl;
141 std::copy(
myBegin,
myEnd, std::ostream_iterator<Value>(out,
", ") );
150 return "SimpleConstRange";
196 ConstReverseIterator
rend()
const {
204 ConstCirculator
c()
const {
212 ConstReverseCirculator
rc()
const {
223 #endif // !defined SimpleConstRange_h 225 #undef SimpleConstRange_RECURSES 226 #endif // else defined(SimpleConstRange_RECURSES) ConstReverseIterator rbegin() const
SimpleConstRange & operator=(const SimpleConstRange &other)
ConstReverseIterator rend() const
ConstIterator end() const
BOOST_CONCEPT_ASSERT((boost::BidirectionalIterator< TConstIterator >))
TConstIterator ConstIterator
SimpleConstRange(const TConstIterator &itb, const TConstIterator &ite)
std::reverse_iterator< ConstCirculator > ConstReverseCirculator
ConstReverseCirculator rc() const
Circulator< ConstIterator > ConstCirculator
Aim: model of CConstRange that adapts any range of elements bounded by two iterators [itb...
SimpleConstRange(const SimpleConstRange &other)
ConstCirculator c() const
std::reverse_iterator< ConstIterator > ConstReverseIterator
Aim: Provides an adapter for classical iterators that can iterate through the underlying data structu...
DGtal is the top-level namespace which contains all DGtal functions and types.
void selfDisplay(std::ostream &out) const
ConstIterator begin() const
Go to http://www.sgi.com/tech/stl/BidirectionalIterator.html.
std::string className() const