CAdjacency.h

 
#pragma once
 
#if defined(CAdjacency_RECURSES)
#error Recursive header files inclusion detected in CAdjacency.h
#else // defined(CAdjacency_RECURSES)
#define CAdjacency_RECURSES
 
#if !defined CAdjacency_h
#define CAdjacency_h
 
// Inclusions
#include <iostream>
#include <vector>
#include "DGtal/base/Common.h"
#include "DGtal/base/ConceptUtils.h"
#include "DGtal/graph/CUndirectedSimpleLocalGraph.h"
 
// @since 0.8 In DGtal::concepts
namespace DGtal {
  namespace concepts {
 
  // class CAdjacency
  template <typename Adj>
  struct CAdjacency : CUndirectedSimpleLocalGraph<Adj>
  {
    // ----------------------- Concept checks ------------------------------
  public:
    
    typedef typename Adj::Space Space;
    typedef typename Adj::Point Point;
    typedef typename Adj::Adjacency Adjacency;
 
    BOOST_CONCEPT_USAGE( CAdjacency )
    {
      // check isAdjacentTo
      ConceptUtils::sameType( myBool, myAdj.isAdjacentTo( myP1, myP2 ) );
      // check isProperlyAdjacentTo
      ConceptUtils::sameType( myBool, 
            myAdj.isProperlyAdjacentTo( myP1, myP2 ) );
    }
 
    // ------------------------- Private Datas --------------------------------
  private:
    Adj myAdj;
    Point myP1;
    Point myP2;
    bool myBool;
    std::back_insert_iterator< std::vector<Point> > myInserter;
 
    // ------------------------- Internals ------------------------------------
  private:
    
  }; // end of concept CAdjacency
  
} // namespace concepts
} // namespace DGtal
 
//                                                                           //
 
#endif // !defined CAdjacency_h
 
#undef CAdjacency_RECURSES
#endif // else defined(CAdjacency_RECURSES)