testArithmeticDSS-benchmark.cpp File Reference

#include <cstdlib>
#include <iostream>
#include "DGtal/base/Common.h"
#include "DGtal/kernel/CPointPredicate.h"
#include "DGtal/arithmetic/IntegerComputer.h"
#include "DGtal/arithmetic/SternBrocot.h"
#include "DGtal/arithmetic/Pattern.h"
#include "DGtal/arithmetic/StandardDSLQ0.h"
#include "DGtal/geometry/curves/ArithmeticalDSSComputer.h"

Include dependency graph for testArithmeticDSS-benchmark.cpp:

Go to the source code of this file.

Functions
template<typename DSL >
bool	checkSubArithmeticDSS (const DSL &D, const typename DSL::Point &A, const typename DSL::Point &B)
template<typename Fraction >
bool	testSubStandardDSLQ0 (unsigned int nbtries, typename Fraction::Integer moda, typename Fraction::Integer modb, typename Fraction::Integer modx)
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

Jacques-Olivier Lachaud (jacqu.nosp@m.es-o.nosp@m.livie.nosp@m.r.la.nosp@m.chaud.nosp@m.@uni.nosp@m.v-sav.nosp@m.oie..nosp@m.fr ) Laboratory of Mathematics (CNRS, UMR 5127), University of Savoie, France

Date

2012/03/05

Functions for testing class SternBrocot.

This file is part of the DGtal library.

Definition in file testArithmeticDSS-benchmark.cpp.

Function Documentation

checkSubArithmeticDSS()

template<typename DSL >

bool checkSubArithmeticDSS	(	const DSL &	D,
		const typename DSL::Point &	A,
		const typename DSL::Point &	B )

Definition at line 50 of file testArithmeticDSS-benchmark.cpp.

{
  typedef typename DSL::Integer Integer;
  typedef typename DSL::ConstIterator ConstIterator;
  typedef ArithmeticalDSSComputer<ConstIterator, Integer, 4> ADSS;
 
  ConstIterator it = D.begin( A );
  ConstIterator it_end = D.end( B );
  ADSS dss;
  dss.init( it );
  while ( ( dss.end() != it_end )
          && ( dss.extendFront() ) ) {}
  std::cout << D.a() << " " << D.b() << " " << D.mu() << " "
            << dss.a() << " " << dss.b() << " " << dss.mu() << " "
            << A[0] << " " << A[1] << " " << B[0] << " " << B[1] 
            << std::endl;
 
  return true;
}

References DGtal::ArithmeticalDSSComputer< TIterator, TInteger, adjacency >::begin().

Referenced by testSubStandardDSLQ0().

main()

int main	(	int	argc,
		char **	argv )

Definition at line 147 of file testArithmeticDSS-benchmark.cpp.

{
  typedef SternBrocot<DGtal::int64_t,DGtal::int32_t> SB;
  typedef SB::Fraction Fraction;
  typedef Fraction::Integer Integer;
  unsigned int nbtries = ( argc > 1 ) ? atoi( argv[ 1 ] ) : 10000;
  Integer moda = ( argc > 2 ) ? atoll( argv[ 2 ] ) : 12000;
  Integer modb = ( argc > 3 ) ? atoll( argv[ 3 ] ) : 12000;
  Integer modx = ( argc > 4 ) ? atoll( argv[ 4 ] ) : 1000;
  testSubStandardDSLQ0<Fraction>( nbtries, moda, modb, modx );
  return 0;
}

References testSubStandardDSLQ0().

testSubStandardDSLQ0()

template<typename Fraction >

bool testSubStandardDSLQ0	(	unsigned int	nbtries,
		typename Fraction::Integer	moda,
		typename Fraction::Integer	modb,
		typename Fraction::Integer	modx )

Definition at line 109 of file testArithmeticDSS-benchmark.cpp.

{
  typedef StandardDSLQ0<Fraction> DSL;
  typedef typename Fraction::Integer Integer;
  typedef typename DSL::Point Point;
  IntegerComputer<Integer> ic;
 
  std::cout << "# a b mu a1 b1 mu1 Ax Ay Bx By" << std::endl;
  for ( unsigned int i = 0; i < nbtries; ++i )
    {
      Integer a( rand() % moda + 1 );
      Integer b( rand() % modb + 1 );
      if ( ic.gcd( a, b ) == 1 )
        {
          for ( Integer mu = 0; mu < 5; ++mu )
            {
              DSL D( a, b, rand() % (moda+modb) );
              for ( Integer x = 0; x < 10; ++x )
                {
                  Integer x1 = rand() % modx;
                  Integer x2 = x1 + 1 + ( rand() % modx );
                  Point A = D.lowestY( x1 );
                  Point B = D.lowestY( x2 );
                  checkSubArithmeticDSS<DSL>( D, A, B );
                }
            }
        }
    }
  return true;
}

References checkSubArithmeticDSS(), and DGtal::IntegerComputer< TInteger >::gcd().