source: trunk/test/iterator_test.cc @ 898

// $Id: iterator_test.cc 898 2007-09-26 13:44:19Z markus $

/*
  Copyright (C) 2007 Peter Johansson

  This file is part of the yat library, http://trac.thep.lu.se/trac/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 "yat/classifier/DataLookup1D.h"

#include "yat/classifier/DataLookupWeighted1D.h"
#include "yat/classifier/MatrixLookupWeighted.h"
#include "yat/utility/Iterator.h"
#include "yat/utility/IteratorWeighted.h"
#include "yat/utility/matrix.h"
#include "yat/utility/vector.h"

#include <algorithm>
#include <fstream>

using namespace theplu::yat;

int main(const int argc,const char* argv[])
{  
  std::ostream* message;
  if (argc>1 && argv[1]==std::string("-v"))
    message = &std::cerr;
  else {
    message = new std::ofstream("/dev/null");
    if (argc>1)
      std::cout << "iterator_test -v : for printing extra "  << "information\n";
  }
  *message << "testing iterator" << std::endl;
  bool ok = true;

  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)
    ok = false;
  
  utility::vector::iterator end=vec.end();
  std::sort(begin, end);
  classifier::DataLookup1D::const_iterator lbegin=lookup.begin();
  classifier::DataLookup1D::const_iterator lend=lookup.end();
  
  std::copy(lbegin, lend, begin);
  std::copy(begin, end, begin);
  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(),1.0);
  if(nof1!=2) {
    *message << "std algoritm with IteratorWeighted failed" << std::endl;
    ok=false;
  }

  if (!ok)
    *message << "iterator test failed" << std::endl;
  
  return (ok ? 0 : -1);
}