testIteratorFunctions.cpp File Reference

#include <iostream>
#include <list>
#include <vector>
#include "DGtal/base/Common.h"
#include "DGtal/base/IteratorFunctions.h"
#include "DGtal/base/Circulator.h"
#include "DGtal/base/ReverseIterator.h"
#include <forward_list>

Include dependency graph for testIteratorFunctions.cpp:

Go to the source code of this file.

Functions
template<typename Container >
bool	testAdvance (Container c)
template<typename Container >
bool	testSize (Container c)
template<typename Container >
bool	testMiddle (Container c)
template<typename IC >
bool	testIsNotEmpty (const IC &itb, const IC &ite, const bool &aFlagIsNotEmpty)
template<typename Container >
bool	testRange (Container c)
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/11/19

Functions for testing class IteratorFunctions.

This file is part of the DGtal library.

Definition in file testIteratorFunctions.cpp.

Function Documentation

main()

int main	(	int	argc,
		char **	argv )

Definition at line 543 of file testIteratorFunctions.cpp.

{
  trace.beginBlock ( "Testing class IteratorFunctions" );
  trace.info() << "Args:";
  for ( int i = 0; i < argc; ++i )
    trace.info() << " " << argv[ i ];
  trace.info() << endl;
 
  std::forward_list<int> fl;
  std::list<int> bl; 
  std::vector<int> v; 
 
  bool res = 
    testAdvance(fl) && 
    testAdvance(bl) && 
    testAdvance(v) &&
    testMiddle(fl) && 
    testMiddle(bl) && 
    testMiddle(v) &&
    testSize(fl) && 
    testSize(bl) && 
    testSize(v) &&
    testRange(fl) && 
    testRange(bl) && 
    testRange(v);
 
  trace.emphase() << ( res ? "Passed." : "Error." ) << endl;
  trace.endBlock();
  return res ? 0 : 1;
}

References DGtal::Trace::beginBlock(), DGtal::Trace::emphase(), DGtal::Trace::endBlock(), DGtal::Trace::info(), testAdvance(), testMiddle(), testRange(), testSize(), and DGtal::trace.

testAdvance()

template<typename Container >

bool testAdvance

(

Container

c

)

Test of the advance function

Parameters

c	any container

Template Parameters

Container

model of iterable and pushable container

Definition at line 72 of file testIteratorFunctions.cpp.

{
  unsigned int nbok = 0;
  unsigned int nb = 0;
  
  trace.beginBlock ( "Advance..." );
 
  typedef typename Container::iterator I;
  typedef typename IteratorCirculatorTraits<I>::Category Category;  
  trace.info() << typeid(Category()).name() << std::endl;
 
  Tool<Container,int>::add(c,1);  
  Tool<Container,int>::add(c,2);  
  Tool<Container,int>::add(c,3);  
  Tool<Container,int>::add(c,4);  
  Tool<Container,int>::add(c,5);  
 
  //classical iterator
  I res = c.begin(); 
  while ((nb+1) < 5)
    {
      ++res; 
      I i = c.begin(); 
      DGtal::advanceIterator(i, (nb+1)); 
      if ( (i != c.begin()) && ( i == res ) )
        nbok++;  
      nb++; 
      trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
    }
 
  //circulator
  Circulator<I> cres = Circulator<I>(c.begin(), c.begin(), c.end()); 
  while ((nb+1) < 5)
    {
      ++cres; 
      Circulator<I> ci = Circulator<I>(c.begin(), c.begin(), c.end()); 
      DGtal::advanceIterator(ci, (nb+1)); 
      if ( (ci != Circulator<I>(c.begin(), c.begin(), c.end())) 
           && ( ci == cres ) )
        nbok++;  
      nb++; 
      trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
    }
 
  trace.endBlock();
  
  return (nbok == nb);
}

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

Referenced by main().

testIsNotEmpty()

template<typename IC >

bool testIsNotEmpty	(	const IC &	itb,
		const IC &	ite,
		const bool &	aFlagIsNotEmpty )

validity of the range

Definition at line 417 of file testIteratorFunctions.cpp.

{
  return (isNotEmpty(itb,ite) == aFlagIsNotEmpty ); 
}

References DGtal::isNotEmpty().

Referenced by testRange().

testMiddle()

template<typename Container >

bool testMiddle

(

Container

c

)

Test of the rangeMiddle function

Parameters

c	any container

Template Parameters

Container

model of iterable and pushable container

Definition at line 247 of file testIteratorFunctions.cpp.

{
  unsigned int nbok = 0;
  unsigned int nb = 0;
  
  trace.beginBlock ( "Middle iterator..." );
 
  typedef typename Container::iterator I;
  typedef typename IteratorCirculatorTraits<I>::Category Category;  
  trace.info() << typeid(Category()).name() << std::endl;
 
  trace.info() << "empty underlying range" << std::endl; 
  if ( rangeMiddle(c.begin(), c.end()) == c.begin() )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( rangeMiddle( Circulator<I>(c.begin(), c.begin(), c.end()),
                    Circulator<I>(c.begin(), c.begin(), c.end()) ) 
       == Circulator<I>(c.begin(), c.begin(), c.end()) ) 
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( subRangeMiddle(c.begin(), c.end()) == c.begin() )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( subRangeMiddle( Circulator<I>(c.begin(), c.begin(), c.end()),
                       Circulator<I>(c.end(), c.begin(), c.end()) ) 
       == Circulator<I>(c.begin(), c.begin(), c.end()) ) 
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
 
  Tool<Container,int>::add(c,5);  
 
  trace.info() << "underlying range of one element" << std::endl; 
  if ( rangeMiddle(c.begin(), c.end()) == c.begin() )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( rangeMiddle( Circulator<I>(c.begin(), c.begin(), c.end()),
                    Circulator<I>(c.begin(), c.begin(), c.end()) ) 
       == Circulator<I>(c.begin(), c.begin(), c.end()) )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
 
  Tool<Container,int>::add(c,1);  
  Tool<Container,int>::add(c,2);  
  Tool<Container,int>::add(c,3);  
  Tool<Container,int>::add(c,4);  
  Tool<Container,int>::add(c,5);  
  Tool<Container,int>::add(c,6);  
  Tool<Container,int>::add(c,5);  
 
  trace.info() << "two equal iterators" << std::endl; 
  if ( rangeMiddle(c.begin(), c.begin()) == c.begin() )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( subRangeMiddle(c.begin(), c.begin()) == c.begin() )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( subRangeMiddle( Circulator<I>(c.begin(), c.begin(), c.end()),
                       Circulator<I>(c.begin(), c.begin(), c.end()) ) 
       == Circulator<I>(c.begin(), c.begin(), c.end()) )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
 
  I itb = c.begin();
  I ite = itb; 
  ite++; ite++; ite++;  
  ite++; ite++; ite++; ite++;  
  I res1 = itb; 
  res1++; res1++; res1++; 
  I res2 = res1; 
  res1++;  
 
  trace.info() << "whole range with odd number of elements" << std::endl; 
  if ( rangeMiddle(c.begin(), ite) == res2 )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( rangeMiddle( Circulator<I>(c.begin(), c.begin(), ite),
                    Circulator<I>(c.begin(), c.begin(), ite) ) 
       == Circulator<I>(res2, c.begin(), ite) )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
 
  trace.info() << "whole range with even number of elements" << std::endl; 
  if ( rangeMiddle(c.begin(), c.end()) == res1 )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( rangeMiddle( Circulator<I>(c.begin(), c.begin(), c.end()),
                    Circulator<I>(c.begin(), c.begin(), c.end()) ) 
       == Circulator<I>(res1, c.begin(), c.end()) )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
 
  ite = itb; 
  itb++;  
  ite++; ite++; ite++;  
  ite++; ite++; ite++;  
 
  trace.info() << "subrange with odd number of elements" << std::endl; 
  if ( rangeMiddle(itb, ite) == res2 )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( rangeMiddle( Circulator<I>(itb, c.begin(), c.end()),
                    Circulator<I>(ite, c.begin(), c.end()) ) 
       == Circulator<I>(res2, c.begin(), c.end()) )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( subRangeMiddle(itb, ite) == res2 )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( subRangeMiddle( Circulator<I>(itb, c.begin(), c.end()),
                       Circulator<I>(ite, c.begin(), c.end()) ) 
       == Circulator<I>(res2, c.begin(), c.end()) )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
 
  ite++; 
 
  trace.info() << "subrange with even number of elements" << std::endl; 
  if ( rangeMiddle(itb, ite) == res1 )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( rangeMiddle( Circulator<I>(itb, c.begin(), c.end()),
                    Circulator<I>(ite, c.begin(), c.end()) ) 
       == Circulator<I>(res1, c.begin(), c.end()) )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( subRangeMiddle(itb, ite) == res1 )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( subRangeMiddle( Circulator<I>(itb, c.begin(), c.end()),
                       Circulator<I>(ite, c.begin(), c.end()) ) 
       == Circulator<I>(res1, c.begin(), c.end()) )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
 
  trace.endBlock();
  
  return (nbok == nb);
}

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

Referenced by main().

testRange()

template<typename Container >

bool testRange

(

Container

c

)

Test of the isNotEmpty function

Parameters

c	any container

Template Parameters

Container

model of iterable and pushable container

Definition at line 428 of file testIteratorFunctions.cpp.

{
  unsigned int nbok = 0;
  unsigned int nb = 0;
  
  trace.beginBlock ( "empty / not empty..." );
 
  typedef typename Container::iterator I;
  typedef typename IteratorCirculatorTraits<I>::Category Category;  
  trace.info() << typeid(Category()).name() << std::endl;
 
  trace.info() << "empty underlying range" << std::endl; 
  if ( testIsNotEmpty(c.begin(), c.end(), false) )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( testIsNotEmpty(Circulator<I>(c.begin(), c.begin(), c.end()), 
                      Circulator<I>(c.begin(), c.begin(), c.end()), false) )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( testIsNotEmpty(ReverseIterator<Circulator<I> >(Circulator<I>(c.begin(), c.begin(), c.end())), 
                      ReverseIterator<Circulator<I> >(Circulator<I>(c.begin(), c.begin(), c.end())), false) )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
 
  Tool<Container,int>::add(c,5);  
 
  trace.info() << "underlying range of one element" << std::endl; 
  if ( testIsNotEmpty(c.begin(), c.end(), true) )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( testIsNotEmpty(Circulator<I>(c.begin(), c.begin(), c.end()), 
                      Circulator<I>(c.begin(), c.begin(), c.end()), true) )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( testIsNotEmpty(ReverseIterator<Circulator<I> >(Circulator<I>(c.begin(), c.begin(), c.end())), 
                      ReverseIterator<Circulator<I> >(Circulator<I>(c.begin(), c.begin(), c.end())), true) )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
 
  Tool<Container,int>::add(c,1);  
  Tool<Container,int>::add(c,2);  
  Tool<Container,int>::add(c,3);  
  Tool<Container,int>::add(c,4);  
  Tool<Container,int>::add(c,5);  
  Tool<Container,int>::add(c,6);  
  Tool<Container,int>::add(c,5);  
 
  trace.info() << "two equal iterators" << std::endl; 
  if ( testIsNotEmpty(c.begin(), c.begin(), false) )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( testIsNotEmpty(Circulator<I>(c.begin(), c.begin(), c.end()), 
                      Circulator<I>(c.begin(), c.begin(), c.end()), true) )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
 
  I itb = c.begin(); itb++; 
  I ite = itb; 
  ite++; ite++;  
  ite++; ite++;
 
  trace.info() << "whole range" << std::endl; 
  if ( testIsNotEmpty(c.begin(), c.end(), true) )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( testIsNotEmpty(Circulator<I>(itb, c.begin(), c.end()), 
                      Circulator<I>(itb, c.begin(), c.end()), true) )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( testIsNotEmpty(ReverseIterator<Circulator<I> >(Circulator<I>(itb, c.begin(), c.end())), 
                      ReverseIterator<Circulator<I> >(Circulator<I>(itb, c.begin(), c.end())), true) )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
 
 
  trace.info() << "subrange" << std::endl; 
  if ( testIsNotEmpty(itb, ite, true) )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( testIsNotEmpty(Circulator<I>(itb, c.begin(), c.end()), 
                      Circulator<I>(ite, c.begin(), c.end()), true) )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( testIsNotEmpty(ReverseIterator<Circulator<I> >(Circulator<I>(itb, c.begin(), c.end())), 
                      ReverseIterator<Circulator<I> >(Circulator<I>(ite, c.begin(), c.end())), true) )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
 
 
  trace.endBlock();
  
  return (nbok == nb);
}

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

Referenced by main().

testSize()

template<typename Container >

bool testSize

(

Container

c

)

Test of the rangeSize function

Parameters

c	any container

Template Parameters

Container

model of iterable and pushable container

Definition at line 129 of file testIteratorFunctions.cpp.

{
  unsigned int nbok = 0;
  unsigned int nb = 0;
  
  trace.beginBlock ( "Size..." );
 
  typedef typename Container::iterator I;
  typedef typename IteratorCirculatorTraits<I>::Category Category;  
  trace.info() << typeid(Category()).name() << std::endl;
 
  trace.info() << "empty underlying range" << std::endl; 
  if ( rangeSize(c.begin(), c.end()) == 0 )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( rangeSize( Circulator<I>(c.begin(), c.begin(), c.end()),
                  Circulator<I>(c.end(), c.begin(), c.end()) ) == 0 )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( subRangeSize(c.begin(), c.end()) == 0 )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( subRangeSize( Circulator<I>(c.begin(), c.begin(), c.end()),
                     Circulator<I>(c.end(), c.begin(), c.end()) ) == 0 )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
 
  Tool<Container,int>::add(c,5);  
 
  trace.info() << "underlying range of one element" << std::endl; 
  if ( rangeSize(c.begin(), c.end()) == 1 )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( rangeSize( Circulator<I>(c.begin(), c.begin(), c.end()),
                  Circulator<I>(c.begin(), c.begin(), c.end()) ) == 1 )
    nbok++;  
  nb++;
 
  Tool<Container,int>::add(c,1);  
  Tool<Container,int>::add(c,2);  
  Tool<Container,int>::add(c,3);  
  Tool<Container,int>::add(c,4);  
  Tool<Container,int>::add(c,5);  
  Tool<Container,int>::add(c,6);  
 
  trace.info() << "two equal iterators" << std::endl; 
  if ( rangeSize(c.begin(), c.begin()) == 0 )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( subRangeSize(c.begin(), c.begin()) == 0 )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( subRangeSize( Circulator<I>(c.begin(), c.begin(), c.end()),
                     Circulator<I>(c.begin(), c.begin(), c.end()) ) == 0 )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
 
 
  trace.info() << "whole range (of 7 elements)" << std::endl; 
  if ( rangeSize(c.begin(), c.end()) == 7 )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( rangeSize( Circulator<I>(c.begin(), c.begin(), c.end()),
                  Circulator<I>(c.begin(), c.begin(), c.end()) ) == 7 )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
 
  I itb = c.begin(); ++itb; 
  I ite = itb; 
  ite++; ite++; ite++;  ite++; 
 
  trace.info() << "subrange (of 4 elements)" << std::endl; 
  if ( rangeSize(itb, ite) == 4 )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( rangeSize( Circulator<I>(itb, c.begin(), c.end()),
                  Circulator<I>(ite, c.begin(), c.end()) ) == 4 )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( subRangeSize(itb, ite) == 4 )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
  if ( subRangeSize( Circulator<I>(itb, c.begin(), c.end()),
                     Circulator<I>(ite, c.begin(), c.end()) ) == 4 )
    nbok++;  
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
 
 
  trace.endBlock();
  
  return (nbok == nb);
}

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

Referenced by main().