Point2ShapePredicate.h

 
#pragma once

 
#if defined(Point2ShapePredicate_RECURSES)
#error Recursive header files inclusion detected in Point2ShapePredicate.h
#else // defined(Point2ShapePredicate_RECURSES)
#define Point2ShapePredicate_RECURSES
 
#if !defined Point2ShapePredicate_h
#define Point2ShapePredicate_h

// Inclusions
#include <iostream>
#include <functional>
 
#include "DGtal/base/Common.h"
 
// @since 0.8 In DGtal::functors
namespace DGtal {
  namespace functors {

  // template class Point2ShapePredicate
  template <typename TSurface, bool isUpward, bool isClosed>
  class Point2ShapePredicate
  {
    // ----------------------- Standard services ------------------------------
  public:
 
    typedef typename TSurface::Point Point;
    typedef typename TSurface::Distance Distance;

    Point2ShapePredicate(const TSurface& aSurface);

    Point2ShapePredicate ( const Point2ShapePredicate & other );

    Point2ShapePredicate &operator=( const Point2ShapePredicate & other ) = default;

    bool operator()( const Point & p ) const;

    void selfDisplay ( std::ostream & out ) const;
 

    ~Point2ShapePredicate();
 
 
    // ------------------------- Protected Data ------------------------------
  private:
    // ------------------------- Private Data --------------------------------
  private:
    TSurface myS;
    // ------------------------- Hidden services ------------------------------
  protected:
 
 
  private:
 
    // ------------------------- Internals ------------------------------------
  private:
 
  }; // end of class Point2ShapePredicate

// policy classes for Point2ShapePredicate
// template class Point2ShapePredicateComparator
template <typename T, bool b1, bool b2>
struct Point2ShapePredicateComparator {
  bool operator()(const T& q,
                   const T& t) const {
    std::less<T> c;
    return c(q,t);
  }
};

template <typename T>
struct Point2ShapePredicateComparator<T,false,false> {
  bool operator()(const T& q,
                   const T& t) const {
    std::less<T> c;
    return c(q,t);
  }
};

template <typename T>
struct Point2ShapePredicateComparator<T,false,true> {
  bool operator()(const T& q,
                   const T& t) const {
    std::less_equal<T> c;
    return c(q,t);
  }
};

template <typename T>
struct Point2ShapePredicateComparator<T,true,false> {
  bool operator()(const T& q,
                   const T& t) const {
    std::greater<T> c;
    return c(q,t);
  }
};

template <typename T>
struct Point2ShapePredicateComparator<T,true,true> {
  bool operator()(const T& q,
                   const T& t) const {
    std::greater_equal<T> c;
    return c(q,t);
  }
};
 
} // namespace functors

template <typename TSurface, bool isUpward, bool isClosed>
inline
std::ostream&
operator<< ( std::ostream & out,
             const DGtal::functors::Point2ShapePredicate<TSurface,isUpward,isClosed> & object );
 
} // namespace DGtal
 

// Includes inline functions.
#include "DGtal/shapes/fromPoints/Point2ShapePredicate.ih"
 
//                                                                           //
 
#endif // !defined Point2ShapePredicate_h
 
#undef Point2ShapePredicate_RECURSES
#endif // else defined(Point2ShapePredicate_RECURSES)