DGtal  0.9.3beta
DigitalSetSelector.h
1 
17 #pragma once
18 
35 #if defined(DigitalSetSelector_RECURSES)
36 #error Recursive header files inclusion detected in DigitalSetSelector.h
37 #else // defined(DigitalSetSelector_RECURSES)
38 
39 #define DigitalSetSelector_RECURSES
40 
41 #if !defined DigitalSetSelector_h
42 
43 #define DigitalSetSelector_h
44 
46 // Inclusions
47 #include <iostream>
48 #include "DGtal/base/Common.h"
49 #include "DGtal/kernel/sets/DigitalSetByAssociativeContainer.h"
50 #include "DGtal/kernel/sets/DigitalSetBySTLVector.h"
51 
52 #include "DGtal/kernel/PointHashFunctions.h"
53 #include <unordered_set>
55 
56 namespace DGtal
57 {
58 
59  // ----------------------- Related enumerations -----------------------------
60  enum DigitalSetSize { SMALL_DS = 0, MEDIUM_DS = 1, BIG_DS = 2, WHOLE_DS = 3 };
64 
66  // template class DigitalSetSelector
87  template <typename Domain, int Preferences >
89  {
90  // ----------------------- Local types ------------------------------
95  }; // end of class DigitalSetSelector
96 
97 
98 } // namespace DGtal
99 
100 
102 // Includes inline functions.
103 #include "DGtal/kernel/sets/DigitalSetSelector.ih"
104 
105 // //
107 
108 #endif // !defined DigitalSetSelector_h
109 
110 #undef DigitalSetSelector_RECURSES
111 #endif // else defined(DigitalSetSelector_RECURSES)
DigitalSetBelongTestability
DGtal is the top-level namespace which contains all DGtal functions and types.
Aim: A wrapper class around a STL associative container for storing sets of digital points within som...
Aim: Automatically defines an adequate digital set type according to the hints given by the user...
DigitalSetByAssociativeContainer< Domain, std::unordered_set< typename Domain::Point > > Type