source: branches/0.4-stable/test/iterator_test.cc @ 1743

// $Id: iterator_test.cc 1743 2009-01-23 14:20:30Z peter $

/*
  Copyright (C) 2007 Jari Häkkinen, Peter Johansson, Markus Ringnér
  Copyright (C) 2008 Peter Johansson, Markus Ringnér

  This file is part of the yat library, http://dev.thep.lu.se/yat

  The yat library is free software; you can redistribute it and/or
  modify it under the terms of the GNU General Public License as
  published by the Free Software Foundation; either version 2 of the
  License, or (at your option) any later version.

  The yat library 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, write to the Free Software
  Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
  02111-1307, USA.
*/

#include "Suite.h"

#include "yat/classifier/DataLookup1D.h"

#include "yat/classifier/DataLookupWeighted1D.h"
#include "yat/classifier/MatrixLookupWeighted.h"
#include "yat/utility/Container2DIterator.h"
#include "yat/utility/Matrix.h"
#include "yat/utility/Vector.h"

#include <algorithm>
#include <fstream>

using namespace theplu::yat;

int main(int argc, char* argv[])
{  
  test::Suite suite(argc, argv);
  suite.err() << "testing iterator" << std::endl;

  suite.err() << "testing utility::vector::iterator" << std::endl;
  utility::Vector vec(12);
  classifier::DataLookup1D lookup(vec);
  utility::Vector::iterator begin=vec.begin();
  // test iterator to const_iterator conversion
  utility::Vector::const_iterator ci = vec.begin();
  ci = begin;
  if (begin!=ci)
    suite.add(false);

  utility::Vector::iterator end=vec.end();
  std::sort(begin, end);

  suite.err() << "testing classifier::DataLookup1D::const_iterator" << std::endl;
  classifier::DataLookup1D::const_iterator lbegin=lookup.begin();
  classifier::DataLookup1D::const_iterator lend=lookup.end();
  
  suite.err() << "copy from DataLookup1D to Vector" << std::endl;
  std::copy(lbegin, lend, begin);
  suite.err() << "copy from Vector to Vector" << std::endl;
  std::copy(begin, end, begin);
  suite.err() << "sort Vector" << std::endl;
  std::sort(begin, end);

  // test std algorithm on IteratorWeighted
  utility::Matrix m(1,3,1);
  m(0,1)=2.0;
  utility::Matrix w(1,3,1);
  classifier::MatrixLookupWeighted mw(m,w);
  classifier::DataLookupWeighted1D aw(mw,0,true);
  size_t nof1=std::count(aw.begin(),aw.end(),
                         std::pair<double, double>(1.0, 1.0));
  if(nof1!=2) {
    suite.err() << "std algoritm with IteratorWeighted failed" << std::endl;
    suite.add(false);
  }
  if (aw.begin()!=mw.begin_row(0))
    suite.add(false);
  if (aw.end()!=mw.end_row(0))
    suite.add(false);
  classifier::DataLookupWeighted1D aw2(mw,0,false);
  if (aw2.begin()!=mw.begin_column(0))
    suite.add(false);
  if (aw2.end()!=mw.end_column(0))
    suite.add(false);

  classifier::MatrixLookup ml(m);
  classifier::DataLookup1D dl1(ml,0,true);
  if (dl1.begin()!=ml.begin_row(0))
    suite.add(false);
  if (dl1.end()!=ml.end_row(0))
    suite.add(false);
  classifier::DataLookup1D dl2(ml,0,false);
  if (dl2.begin()!=ml.begin_column(0))
    suite.add(false);
  if (dl2.end()!=ml.end_column(0))
    suite.add(false);

  return suite.return_value();
}