testLabels.cpp

//#define TRACE_BITS

#include <cstdio>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <vector>
#include <bitset>
#include "DGtal/base/Common.h"
#include "DGtal/base/Labels.h"

using namespace DGtal;
using namespace std;

template <typename Container1, typename Container2>
bool
isEqual( Container1 & c1, Container2 & c2 )
{
  if ( c1.size() == c2.size() )
    {
      for ( unsigned int i = 0; i < c1.size(); ++i )
        {
          if ( c1.test( i ) != c2.test( i ) )
            return false;
        }
      return true;
    }
  return false;
}

template <typename VContainer1, typename LContainer2>
void insert( VContainer1 & c1, LContainer2 & c2, unsigned int idx )
{
  c1.set( idx );
  c2.set( idx );
}

template <typename VContainer1, typename LContainer2>
bool
checkInsert( VContainer1 & v, LContainer2 & l,
             unsigned int nb )
{
  for ( unsigned int i = 0; i < nb; ++i )
    {
      unsigned int idx = random() % ( l.size() );
      insert( v, l, idx );
    }
  return isEqual( v, l );
}

template <typename VContainer1, typename LContainer2>
void erase( VContainer1 & c1, LContainer2 & c2, unsigned int idx )
{
  c1.reset( idx );
  c2.reset( idx );
}

template <typename VContainer1, typename LContainer2>
bool
checkErase( VContainer1 & v, LContainer2 & l,
            unsigned int nb )
{
  for ( unsigned int i = 0; i < nb; ++i )
    {
      unsigned int idx = random() % ( l.size() );
      erase( v, l, idx );
    }
  return isEqual( v, l );
}


int main()
{
  typedef Labels<80, uint32_t> MyLabels;
  typedef MyLabels::ConstIterator LabelsConstIterator;
  typedef bitset<80> MyBitset;

  BOOST_CONCEPT_ASSERT(( boost::ForwardIterator< LabelsConstIterator > ));

  unsigned int nb = 0;
  unsigned int nbok = 0;
  trace.beginBlock ( "Testing Labels" );
  MyLabels l;
  MyBitset v;
  ++nb, nbok += isEqual( v, l ) ? 1 : 0;
  std::cout << "(" << nbok << "/" << nb << ") l=" << l << std::endl; 
  insert( v, l, 15 );
  insert( v, l, 4 );
  ++nb, nbok += isEqual( v, l ) ? 1 : 0;
  std::cout << "(" << nbok << "/" << nb << ") l=" << l << std::endl; 
  insert( v, l, 62 );
  insert( v, l, 4 );
  insert( v, l, 78 );
  insert( v, l, 31 );
  insert( v, l, 32 );
  ++nb, nbok += isEqual( v, l ) ? 1 : 0;
  std::cout << "(" << nbok << "/" << nb << ") l=" << l << std::endl; 
  checkInsert( v, l, 40 );
  ++nb, nbok += isEqual( v, l ) ? 1 : 0;
  std::cout << "(" << nbok << "/" << nb << ") l=" << l << std::endl; 
  checkErase( v, l, 200 );
  ++nb, nbok += isEqual( v, l ) ? 1 : 0;
  std::cout << "(" << nbok << "/" << nb << ") l=" << l << std::endl; 
  for ( LabelsConstIterator it = l.begin(), it_end = l.end();
        it != it_end; ++it )
    std::cout << " " << *it;
  std::cout << std::endl;
  trace.endBlock();
  return ( nb == nbok ) ? 0 : 1;
}