DGtal 1.3.0
Loading...
Searching...
No Matches
CDomainAdjacency.h
1
17#pragma once
18
31#if defined(CDomainAdjacency_RECURSES)
32#error Recursive header files inclusion detected in CDomainAdjacency.h
33#else // defined(CDomainAdjacency_RECURSES)
35#define CDomainAdjacency_RECURSES
36
37#if !defined CDomainAdjacency_h
39#define CDomainAdjacency_h
40
42// Inclusions
43#include <iostream>
44#include "boost/concept_check.hpp"
45#include "DGtal/base/Common.h"
46#include "DGtal/topology/CAdjacency.h"
48
49// @since 0.8 In DGtal::concepts
50namespace DGtal {
51 namespace concepts {
52
54 // class CDomainAdjacency
95 template <typename T>
97 {
98 // ----------------------- Concept checks ------------------------------
99 public:
100
101 typedef typename Adj::Domain Domain;
102 typedef typename Adj::Predicate Predicate;
103
104 // ------------------------- Private Datas --------------------------------
105 private:
107 {
108 // check domain()
110 // check predicate()
111 ConceptUtils::sameType( myPredicate, myT.predicate() );
112 }
113
114 // ------------------------- Internals ------------------------------------
115 private:
119
120 }; // end of concept CDomainAdjacency
121
122} // namespace concepts
123} // namespace DGtal
124
125 //
127
128#endif // !defined CDomainAdjacency_h
129
130#undef CDomainAdjacency_RECURSES
131#endif // else defined(CDomainAdjacency_RECURSES)
void sameType(const T &, const T &)
Definition: ConceptUtils.h:117
DGtal is the top-level namespace which contains all DGtal functions and types.
Aim: The concept CAdjacency defines an elementary adjacency relation between points of a digital spac...
Definition: CAdjacency.h:100
Aim: Refines the concept CAdjacency by telling that the adjacency is specific to a given domain of th...