testBasicFunctors.cpp File Reference

#include <iostream>
#include <cmath>
#include <functional>
#include "DGtal/base/Common.h"
#include "DGtal/base/CUnaryFunctor.h"
#include "DGtal/base/BasicFunctors.h"

Include dependency graph for testBasicFunctors.cpp:

Go to the source code of this file.

Functions
template<typename TFunctor , typename TArg , typename TRes >
void	basicFunctorsConceptChecking ()
bool	testBasicFunctors ()
int	main (int argc, char **argv)

Detailed Description

This program is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.

This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

You should have received a copy of the GNU General Public License along with this program. If not, see http://www.gnu.org/licenses/.

Author

Tristan Roussillon (trist.nosp@m.an.r.nosp@m.oussi.nosp@m.llon.nosp@m.@liri.nosp@m.s.cn.nosp@m.rs.fr ) Laboratoire d'InfoRmatique en Image et Systèmes d'information - LIRIS (CNRS, UMR 5205), CNRS, France

Date

2012/01/27

Functions for testing basic functors.

This file is part of the DGtal library.

Definition in file testBasicFunctors.cpp.

Function Documentation

basicFunctorsConceptChecking()

template<typename TFunctor , typename TArg , typename TRes >

void basicFunctorsConceptChecking

(

)

Concept checking

Definition at line 50 of file testBasicFunctors.cpp.

{
  BOOST_CONCEPT_ASSERT(( concepts::CUnaryFunctor<TFunctor, TArg, TRes > ));
}

Referenced by main().

main()

int main	(	int	argc,
		char **	argv )

Definition at line 196 of file testBasicFunctors.cpp.

{
  trace.beginBlock ( "Testing basic functors" );
  trace.info() << "Args:";
  for ( int i = 0; i < argc; ++i )
    trace.info() << " " << argv[ i ];
  trace.info() << endl;
 
  //concept checking
  basicFunctorsConceptChecking<functors::Identity,int,int>(); 
  basicFunctorsConceptChecking<DGtal::functors::ConstValue<int>,int,int >();
  basicFunctorsConceptChecking<functors::Cast<int>,short,int >();
  basicFunctorsConceptChecking<DGtal::functors::Thresholder<int>,int,bool >();
  basicFunctorsConceptChecking<functors::Composer<functors::ConstValue<double>,functors::Cast<int>,int>,char,int >();
 
 
  //run-time tests
  bool res = testBasicFunctors();
  trace.emphase() << ( res ? "Passed." : "Error." ) << endl;
  trace.endBlock();
  return res ? 0 : 1;
}

References basicFunctorsConceptChecking(), DGtal::Trace::beginBlock(), DGtal::Trace::emphase(), DGtal::Trace::endBlock(), DGtal::Trace::info(), testBasicFunctors(), and DGtal::trace.

testBasicFunctors()

bool testBasicFunctors

(

)

Simple test.

Definition at line 58 of file testBasicFunctors.cpp.

{
  unsigned int nbok = 0;
  unsigned int nb = 0;
  
  trace.beginBlock ( "Testing basic functors ..." );
  
  //default functor
  {
    functors::Identity f; 
    int a = 5; 
    nbok += ( f(a) == 5 ) ? 1 : 0; 
    nb++;
  }
 
  {//constant functor
    const int v = -1;
    DGtal::functors::ConstValue<int> f(v);
    char c = 'a'; 
    nbok += ( f(c) == v ) ? 1 : 0; 
    nb++;
    double d = 5.2; 
    nbok += ( f(d) == v ) ? 1 : 0; 
    nb++;
  }
 
  //cast functor
  {
    functors::Cast<int> f;
    char c = 'a'; 
    nbok += ( f(c) == 97 ) ? 1 : 0; 
    nb++;
  }
 
  //rounding functors
  {
    const double v1 = -3.5;
    const double v2 = 3.5;
 
    { const DGtal::functors::Round<double> f; nbok += ( f(v1) == -4. && f(v2) == 4. ) ? 1 : 0; }
    { const DGtal::functors::Round<> f;       nbok += ( f(v1) == -4. && f(v2) == 4. ) ? 1 : 0; }
    { const DGtal::functors::Floor<double> f; nbok += ( f(v1) == -4. && f(v2) == 3. ) ? 1 : 0; }
    { const DGtal::functors::Floor<> f;       nbok += ( f(v1) == -4. && f(v2) == 3. ) ? 1 : 0; }
    { const DGtal::functors::Ceil<double> f;  nbok += ( f(v1) == -3. && f(v2) == 4. ) ? 1 : 0; }
    { const DGtal::functors::Ceil<> f;        nbok += ( f(v1) == -3. && f(v2) == 4. ) ? 1 : 0; }
    { const DGtal::functors::Trunc<double> f; nbok += ( f(v1) == -3. && f(v2) == 3. ) ? 1 : 0; }
    { const DGtal::functors::Trunc<> f;       nbok += ( f(v1) == -3. && f(v2) == 3. ) ? 1 : 0; }
 
    nb += 8;
  }
 
  //composer quantizer
  {
    //need to explicitely specialized std::ptr_fun because there are several
    //overloaded versions of std::floor if used intead ctor of 
    //std::pointer_to_unary_function<double, double>
    // JOL: pointer_to_unary_function is deprecated as of C++11
    double (*pF)(double) = &floor;
    double (*pC)(double) = &ceil;
    std::function<double(double)> f = pF;
    std::function<double(double)> c = pC;
    functors::Cast<int> o;
 
    //composer
    typedef DGtal::functors::Composer< std::function<double(double)>,
    functors::Cast<int>, int > Quantizer;
    double d = 5.2; 
 
    Quantizer q(f, o); 
    nbok += ( q(d) == 5 ) ? 1 : 0; 
    nb++;
 
    Quantizer q2(c, o); 
    nbok += ( q2(d) == 6 ) ? 1 : 0; 
    nb++;
  }
 
  //binary to unary functor
  {
    int i = -5; 
    // With function and bind:
    std::function<int(int)> b = std::bind(std::minus<int>(), std::placeholders::_1, 0);
    //i - 0
    nbok += ( b(i) == -5 ) ? 1 : 0; 
    nb++;
    // With a lambda:
    auto b2 = [](int v) -> int {
      return v + 2;
    };
    //i + 2
    nbok += ( b2(i) == -3 ) ? 1 : 0; 
    nb++;
  }
 
  {//thresholder
    int i = -3; 
    DGtal::functors::Thresholder< int > t;
    nbok += ( t(i) == true ) ? 1 : 0; 
    nb++;    
    DGtal::functors::Thresholder< int, true, true > t1;
    nbok += ( t1(i) == true ) ? 1 : 0; 
    nb++;    
    DGtal::functors::Thresholder< int, true, false > t2;
    nbok += ( t2(0) == false ) ? 1 : 0; 
    nb++;    
    DGtal::functors::Thresholder< int, false, true > t3;
    nbok += ( t3(i) == false ) ? 1 : 0; 
    nb++;    
    DGtal::functors::Thresholder< int, false, false > t4;
    nbok += ( t4(i) == false ) ? 1 : 0; 
    nb++;    
  }
 
  {//interval thresholder
    const int low = 1;
    const int up = 5; 
    DGtal::functors::IntervalThresholder< int > t(low, up);
    nbok += ( t(0) == false ) ? 1 : 0; 
    nb++;    
    for (int i = low; i <= up; ++i)
      {
        nbok += ( t(i) == true ) ? 1 : 0; 
        nb++;    
      }
    nbok += ( t(6) == false ) ? 1 : 0; 
    nb++;    
  }
 
 
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  trace.endBlock();
  
  return nbok == nb;
}

References DGtal::Trace::beginBlock(), DGtal::Trace::endBlock(), DGtal::Trace::info(), and DGtal::trace.

Referenced by main().