testArithmeticDSS-benchmark.cpp

Go to the documentation of this file.

 
#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"
 
using namespace std;
using namespace DGtal;
 
// Functions for testing class SternBrocot.
 
template <typename DSL>
bool checkSubArithmeticDSS( const DSL & D,
                            const typename DSL::Point & A, 
                            const typename DSL::Point & B ) 
{
  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;
}
 
// template <typename Fraction>
// bool testSubStandardDSLQ0( unsigned int nbtries )
// {
//   typedef StandardDSLQ0<Fraction> DSL;
//   typedef typename Fraction::Integer Integer;
//   typedef typename Fraction::Quotient Quotient;
//   typedef typename DSL::Point Point;
//   typedef typename DSL::ConstIterator ConstIterator;
//   typedef typename DSL::Point2I Point2I;
//   typedef typename DSL::Vector2I Vector2I;
//   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() % 12000 + 1 );
//       Integer b( rand() % 12000 + 1 );
//       if ( ic.gcd( a, b ) == 1 )
//         {
//           for ( Integer mu = 0; mu < 5; ++mu )
//             {
//               DSL D( a, b, rand() % 10000 );
//               for ( Integer x = 0; x < 10; ++x )
//                 {
//                   Integer x1 = rand() % 1000;
//                   Integer x2 = x1 + 1 + ( rand() % 1000 );
//                   Point A = D.lowestY( x1 );
//                   Point B = D.lowestY( x2 );
//                   checkSubArithmeticDSS<DSL>( D, A, B );
//                 }
//             }
//         }
//     }
//   return true;
// }
 
template <typename Fraction>
bool testSubStandardDSLQ0( unsigned int nbtries, 
                           typename Fraction::Integer moda, 
                           typename Fraction::Integer modb, 
                           typename Fraction::Integer modx )
{
  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;
}
 
 
// Standard services - public :
 
int main( int argc, char** argv)
{
  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 true;
}
 
//                                                                           //