testImageContainerByHashTree.cpp

#include <iostream>
#include "DGtal/base/Common.h"
#include <cmath>
#include "DGtal/kernel/SpaceND.h"
#include "DGtal/kernel/domains/HyperRectDomain.h"
#include "DGtal/images/ImageContainerByHashTree.h"


#define dim ImageContainerByHashTree<Domain , T, DGtal::uint64_t >::dim
#define defHashKey typename ImageContainerByHashTree<Domain , int,  DGtal::uint64_t >::HashKey

using namespace DGtal;

int iRand ( int iMin, int iMax )
{
  double f = ( double ) rand() / RAND_MAX;
  return (int) (iMin + static_cast<double> ( f * ( iMax - iMin ) ));
}

template<typename Domain, typename T >
bool test_setVal (ImageContainerByHashTree<Domain , T, DGtal::uint64_t >& container, bool checkAfterEachSet )
{
  srand ( (unsigned int)time ( NULL ) );

  //phase 1
  cerr << "Test: set" <<endl;
  cerr << "phase 1..." <<endl;
  //unsigned DepthMask = container.ROOT_KEY << container.getDepth()*dim;
  unsigned DepthMask = 100000;
  //cerr << "DepthMask = " << DepthMask << endl;
  for ( int key = DepthMask; key > 1; --key )
    {
      if ( !container.isKeyValid ( key ) )
        {
          continue;
        }
      //count ++;
      container.setValue ( key, iRand ( 0, 100 ) );
      if ( checkAfterEachSet )
  { 
    if ( !container.checkIntegrity() )
      {
        cerr << "test_set: failure in phase 1" << endl
       << "at key " << Bits::bitString ( key ) << endl;
        return false;
      }
    else
      cerr << "ok"<<endl;
  }
    }
  cerr << "checking the container's validity..." << endl;
  if ( !container.checkIntegrity() )
    {

      cerr << "test_set: failure in phase 1" << endl;
      return false;
    }

  //phase 2
  cerr << "phase 2..." <<endl;
  for ( unsigned key = container.ROOT_KEY; key < DepthMask; ++key )
    {
      if ( !container.isKeyValid ( key ) )
        {
          continue;
        }
      container.setValue ( key, iRand ( 0, 100 ) );
      if ( checkAfterEachSet )
        if ( !container.checkIntegrity() )
          {
            cerr << "test_set: failure in phase 2" << endl
                 << "at key " << Bits::bitString ( key ) << endl;
            return false;
          }
    }

  if ( !container.checkIntegrity() )
    {
      cerr << "test_set: failure in phase 2" << endl;
      return false;
    }

  cerr << "test_set: success !" << endl;
  return true;
}


template<typename Domain, typename T >
bool test_get ( ImageContainerByHashTree<Domain, T, DGtal::uint64_t >& container, bool  )
{
  srand ( (unsigned int)time ( NULL ) );
  unsigned count = 0;
  //unsigned DepthMask = container.ROOT_KEY << container.getDepth()*dim;
  unsigned DepthMask = 100000;
  //cerr << "DepthMask "<< DepthMask << endl;
  for ( unsigned key = DepthMask; key > container.ROOT_KEY; --key )
    {
      if ( !container.isKeyValid ( key ) )
        {
          //cerr << "invalid key "<< Bits::bitString(key) << endl;
          continue;
        }
      ++count;
      T val = iRand ( 0, 100 );
      //cerr << "plop1" << endl;
      //cerr << "___________________________ set: " << Bits::bitString(key, 16) << endl;
      container.setValue ( key, val );


      typename ImageContainerByHashTree<Domain , T, DGtal::uint64_t >::HashKey key2 = key;
      while ( container.isKeyValid ( key2 ) )
        {
          key2 = key2 << dim;
          if ( val != container.get ( key2 ) )
            {
              cerr << "test_get: failure" << endl
                   << "at key " << Bits::bitString ( key2 ) << endl;
              return false;
            }
          //cerr << "check " << Bits::bitString(key2) << " ok." << endl;
        }
      key2 <<=dim;
    }
  cerr << "test_get: success !" << endl
       << "tested with " << count << " keys" << endl;
  return true;
}



int main ( int argc, char** argv )
{
  trace.beginBlock ( "Testing class ImageContainerBenchmark" );
  trace.info() << "Args:";
  for ( int i = 0; i < argc; ++i )
    trace.info() << " " << argv[ i ];
  trace.info() << endl;

  typedef SpaceND<5> Space;
  typedef Space::Point Point;
  typedef HyperRectDomain<Space> Dom;
  typedef DGtal::ImageContainerByHashTree<Dom, int, DGtal::uint64_t> Tree;
  Tree tree ( 12,5,1 );
  // Do not pass concept.
  //BOOST_CONCEPT_ASSERT((CDrawableWithBoard2D<Tree>));

  //tree.printInternalState(cerr, 12);
  Dom::Point p1, p2, p3;
  cerr << "azertyuiop" << endl;
  p1[0] = -32;
  p1[1] = -10;
  p1[2] = -30;
  p1[3] =  20;
  p1[4] =  0;

  p2[0] = 32;
  p2[1] = 32;
  p2[2] = 20;
  p2[3] = 64;
  p2[4] = 120;

  p3[0] = 1;
  p3[1] = 1;
  p3[2] = 1;
  p3[3] = 1;
  p3[4] = 1;
  cerr << "azertyuiop" << endl;
  DGtal::ImageContainerByHashTree<Dom, int, DGtal::uint64_t> tree2 ( 12,p1, p2,1 );
  cerr << "azertyuiop" << endl;
  cerr << "coord get " << tree2.get ( p1 ) << endl;
  cerr << "_-_-_-_-_-_-_-_-_-_-_-_-" << endl;
  cerr << "coord get " << tree2.get ( p3 ) << endl;
  cerr << "coord get " << tree2.get ( p1+=p3 ) << endl;
  cerr << "coord get " << tree2.get ( p1+=p3 ) << endl;
  cerr << "coord get " << tree2.get ( p1+=p3 ) << endl;
  cerr << "coord get " << tree2.get ( p1+=p3 ) << endl;

  // check that the iterator stuff compiles as it should
  typedef DGtal::ImageContainerByHashTree<Dom, int, DGtal::uint64_t>::Iterator HashTreeIterator;
  HashTreeIterator it = tree.begin();
  for ( it = tree.begin(); it != tree.end(); ++it )
    tree ( *it );



  bool res =
    (
      test_setVal ( tree, false ) &&
      test_get ( tree, false )
    );



  trace.emphase() << ( res ? "Passed." : "Error." ) << endl;
  trace.endBlock();
  return res ? 0 : 1;
}