testHashTree.cpp File Reference

#include <iostream>
#include "DGtal/base/Common.h"
#include "DGtal/io/boards/Board2D.h"
#include "DGtal/io/colormaps/HueShadeColorMap.h"
#include "DGtal/io/colormaps/GrayscaleColorMap.h"
#include "DGtal/io/colormaps/GradientColorMap.h"
#include "DGtal/io/colormaps/ColorBrightnessColorMap.h"
#include "DGtal/kernel/SpaceND.h"
#include "DGtal/kernel/domains/HyperRectDomain.h"
#include "DGtal/images/ImageContainerByHashTree.h"
#include "DGtal/images/ImageContainerBySTLVector.h"
#include "DGtal/helpers/StdDefs.h"

Include dependency graph for testHashTree.cpp:

Go to the source code of this file.

Functions
bool	testHashTree ()
bool	testHashTree2D ()
bool	testGetSetVal ()
bool	testBadKeySizes ()
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

David Coeurjolly (david.nosp@m..coe.nosp@m.urjol.nosp@m.ly@l.nosp@m.iris..nosp@m.cnrs.nosp@m..fr ) Laboratoire d'InfoRmatique en Image et Systèmes d'information - LIRIS (CNRS, UMR 5205), CNRS, France

Date

2010/09/02

Functions for testing class HashTree.

This file is part of the DGtal library.

Definition in file testHashTree.cpp.

Function Documentation

main()

int main	(	int	argc,
		char **	argv )

Definition at line 279 of file testHashTree.cpp.

{
  trace.beginBlock ( "Testing class HashTree" );
  trace.info() << "Args:";
  for ( int i = 0; i < argc; ++i )
    trace.info() << " " << argv[ i ];
  trace.info() << std::endl;
 
  bool res = testHashTree() && testHashTree2D() && testGetSetVal() && testBadKeySizes();  // && ... other tests
  trace.emphase() << ( res ? "Passed." : "Error." ) << std::endl;
  trace.endBlock();
  return res ? 0 : 1;
}

References DGtal::Trace::beginBlock(), DGtal::Trace::emphase(), DGtal::Trace::endBlock(), DGtal::Trace::info(), testBadKeySizes(), testGetSetVal(), testHashTree(), testHashTree2D(), and DGtal::trace.

testBadKeySizes()

bool testBadKeySizes

(

)

This should raise an ASSERT abort if uncommented

Definition at line 241 of file testHashTree.cpp.

{
  typedef SpaceND<2> SpaceType;
  typedef HyperRectDomain<SpaceType> TDomain;
  typedef TDomain::Point Point;
  Board2D board;
  board.setUnit(Board2D::UCentimeter);
 
 
  //Default image selector = STLVector
  typedef experimental::ImageContainerByHashTree<TDomain, char> Image;
  Point d(128,128);
 
  trace.beginBlock ( "Test maximal depth >  number of bits of the HashKey type" );
  Image myImage ( 3, 80, 0 );
  trace.info() << myImage;
  trace.endBlock();
 
  trace.beginBlock ( "Test morton hash size >  number of bits of the HashKey type" );
  //  Image myImage2 ( 80, 8, 0 );
  //trace.info() << myImage2;
  trace.endBlock();
  
  //Default image selector = STLVector
  typedef experimental::ImageContainerByHashTree<TDomain, unsigned int, DGtal::uint32_t> Image2;
  trace.beginBlock ( "Changing the HashKey type" );
  Image2 myImage3( 3, 80, 0 );
  trace.info() << myImage3;
  trace.endBlock();
 
 
  return true;  
}

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

Referenced by main().

testGetSetVal()

bool testGetSetVal

(

)

Example of a test. To be completed.

Domain characterized by points

Domain characterized by points

Definition at line 112 of file testHashTree.cpp.

{
  unsigned int nbok = 0;
  unsigned int nb = 0;
 
  typedef SpaceND<2> SpaceType;
  typedef HyperRectDomain<SpaceType> TDomain;
  typedef TDomain::Point Point;
  Board2D board;
  typedef HueShadeColorMap<unsigned char,2> HueTwice;
  board.setUnit(LibBoard::Board::UCentimeter);
 
 
  //Default image selector = STLVector
  typedef experimental::ImageContainerByHashTree<TDomain, int > Image;
  typedef ImageContainerBySTLVector<TDomain, int> ImageVector;
 
  Point a( 1,1 );
  Point b ( 50,50 );
  Point c(15,15);
  Point d(128,128);
 
  Point l(0,0);
  Point u(255,255);
 
  trace.beginBlock ( "Image init" );
  Image myImage ( 3, 8, 0 );
 
  ImageVector myImageV(TDomain(l,u));
 
  trace.info() << myImage;
  trace.endBlock();
  
 
  trace.beginBlock("SetVal");
  for( a[1] = 0; a[1] < 256; a[1]++)
    for( a[0] = 0; a[0] < 256; a[0]++)
      {
  if ( pow((double)(a[0]-128),3.0) - pow((double)(a[1]-128),3.0) < pow(32.0,3.0))
    {
      myImage.setValue(a, 30);
      myImageV.setValue(a,30);
    }
 
  else
    if ( pow((double)(a[0]-128),3.0) - pow((double)(a[1]-128),3.0) < pow(64.0,3.0))
      {
        myImage.setValue(a, 10);  
        myImageV.setValue(a,10);
      }
      }
  trace.endBlock();
  
  bool result=true;
  
  trace.beginBlock("GetVal consistency test");
  for( a[1] = 0; a[1] < 256; a[1]++)
    for( a[0] = 0; a[0] < 256; a[0]++)
      {
  if ( pow((a[0]-128),3.0) - pow((a[1]-128),3.0) < pow(32,3.0))
    result = result && (myImage(a) == 30);
  else
    if ( pow((a[0]-128),3.0) - pow((a[1]-128),3.0) < pow(64,3.0))
      result = result && (myImage(a) == 10);      
      }
  trace.endBlock();
  
  if (result)
    trace.info() << "Get/Set test passed"<<std::endl;
  else
    trace.error() << "Get/Set test error"<<std::endl;
  nbok += result ? 1 : 0;
  nb++;
  
  trace.info() << myImage;
  trace.info() << myImageV;
 
  Display2DFactory::drawImageHashTree<HueTwice>(board, myImage, 0, 255);
  board.saveSVG( "hashtree.svg" );
  board.clear();
  Display2DFactory::drawImage<HueTwice>(board, myImageV, 0, 255);
  board.saveSVG( "hashtree-vector.svg" );
  
 
  Image myImage2 ( 5, 8, 0 );
  
  trace.beginBlock("SetVal (keysize=5)");
  for( a[1] = 0; a[1] < 256; a[1]++)
    for( a[0] = 0; a[0] < 256; a[0]++)
      {
  if ( pow((a[0]-128),3.0) - pow((a[1]-128),3.0) < pow(32,3.0))
    myImage2.setValue(a, 30);
  else
    if ( pow((a[0]-128),3.0) - pow((a[1]-128),3.0) < pow(64,3.0))
      myImage2.setValue(a, 10);  
      }
  trace.endBlock();
  
  result=true;
  
  trace.beginBlock("GetVal consistency test  (keysize=5)");
  for( a[1] = 0; a[1] < 256; a[1]++)
    for( a[0] = 0; a[0] < 256; a[0]++)
      {
  if ( pow((a[0]-128),3.0) - pow((a[1]-128),3.0) < pow(32,3.0))
    result = result && (myImage2(a) == 30);
  else
    if ( pow((a[0]-128),3.0) - pow((a[1]-128),3.0) < pow(64,3.0))
      result = result && (myImage2(a) == 10);      
      }
  trace.endBlock();
  
  if (result)
    trace.info() << "Get/Set test passed"<<std::endl;
  else
    trace.error() << "Get/Set test error"<<std::endl;
  nbok += result ? 1 : 0;
  nb++;
  
  trace.warning() << "(" << nbok << "/" << nb << ") "
         << "true == true" << std::endl;
 
 
  return nbok == nb;
}

References DGtal::Trace::beginBlock(), LibBoard::Board::clear(), DGtal::Display2DFactory::drawImage(), DGtal::Display2DFactory::drawImageHashTree(), DGtal::Trace::endBlock(), DGtal::Trace::error(), DGtal::Trace::info(), LibBoard::Board::saveSVG(), LibBoard::Board::setUnit(), DGtal::Image< TImageContainer >::setValue(), DGtal::trace, LibBoard::Board::UCentimeter, and DGtal::Trace::warning().

Referenced by main().

testHashTree()

bool testHashTree

(

)

Example of a test. To be completed.

Image created from depth

Domain characterized by points a and b

Definition at line 58 of file testHashTree.cpp.

{
  trace.beginBlock ( "Testing simple init ..." );
 
 
  typedef SpaceND<4> Space4Type;
  typedef HyperRectDomain<Space4Type> TDomain;
  typedef TDomain::Point Point;
  typedef Space4Type::Integer Integer;
 
  //Default image selector = STLVector
  typedef experimental::ImageContainerByHashTree<TDomain, int > Image;
 
  const Integer t[ ] = { 1, 2, 3 ,4};
  const Integer t2[ ] = { 5, 5, 3 ,4};
  Point a ( t );
  Point b ( t2 );
 
  Image myImage ( 3, 3,0 );
 
  TDomain domain(a,b);
  Image myImage2 ( domain );
 
  trace.info() << myImage;
  trace.info() << myImage2;
 
  trace.endBlock();
 
  return true;
}

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

Referenced by main().

testHashTree2D()

bool testHashTree2D

(

)

Hashtree2D

Definition at line 95 of file testHashTree.cpp.

{
  trace.beginBlock("Testing 2D");
  Z2i::Domain domain(Z2i::Point(0,0), Z2i::Point(255,255));
  typedef experimental::ImageContainerByHashTree<Z2i::Domain, int > Image;
 
  Image myImage(domain);
  trace.info()<< myImage<<std::endl;
  trace.endBlock();
 
  return true;
}

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

Referenced by main().