DGtal 1.4.0
Loading...
Searching...
No Matches
CBidirectionalRangeFromPoint.h
1
17#pragma once
18
31#if defined(CBidirectionalRangeFromPoint_RECURSES)
32#error Recursive header files inclusion detected in CBidirectionalRangeFromPoint.h
33#else // defined(CBidirectionalRangeFromPoint_RECURSES)
35#define CBidirectionalRangeFromPoint_RECURSES
36
37#if !defined CBidirectionalRangeFromPoint_h
39#define CBidirectionalRangeFromPoint_h
40
42// Inclusions
43#include "DGtal/base/Common.h"
44#include "DGtal/base/CBidirectionalRange.h"
45#include "DGtal/base/CConstBidirectionalRangeFromPoint.h"
47
48namespace DGtal
49{
50
51 namespace concepts
52 {
53
55 // class CBidirectionalRangeFromPoint
93 template <typename T>
94
98 {
99 // ----------------------- Concept checks ------------------------------
100
101 public:
102 // 1. define first provided types (i.e. inner types), like
103 typedef typename T::Point Point;
104 typedef typename T::ReverseIterator ReverseIterator;
105
106
107 // 2. then check the presence of data members, operators and methods with
112
113 // ------------------------- Private Datas --------------------------------
114
115 private:
116 T myX; // do not require T to be default constructible.
119
120 // ------------------------- Internals ------------------------------------
121
122 private:
123
124 }; // end of concept CBidirectionalRangeFromPoint
125
126 } // namespace concepts
127
128} // namespace DGtal
129
130// //
132
133#endif // !defined CBidirectionalRangeFromPoint_h
134
135#undef CBidirectionalRangeFromPoint_RECURSES
136#endif // else defined(CBidirectionalRangeFromPoint_RECURSES)
void sameType(const T &, const T &)
DGtal is the top-level namespace which contains all DGtal functions and types.
Aim: refined concept of single pass range with a begin() method from a point.
Aim: Defines the concept describing a bidirectional range.
Aim: refined concept of const bidirectional range with a begin() method from a point.