source: trunk/test/index_test.cc @ 1237

// $Id: index_test.cc 1237 2008-03-15 16:58:34Z peter $

/*
  Copyright (C) 2008 Peter Johansson

  This file is part of the yat library, http://trac.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/utility/Index.h"
#include "yat/utility/SmartPtr.h"

#include <fstream>
#include <iostream>
#include <vector>

int main(int argc, char* argv[])
{  
  using namespace theplu::yat;
  using utility::Index;

  test::Suite suite(argc, argv);
  suite.err() << "testing Index" << std::endl;

  Index index;
  if (index.size()){
    suite.add(false);
    suite.err() << "Default constructor failed\n";
  }

  Index index2(10);
  if (index2.size()!=10){
    suite.add(false);
    suite.err() << "Constructor Index(10) failed\n";
  }
  for (size_t i=0; i<index2.size(); ++i)
    if (index2[i]!=i){
      suite.add(false);
      suite.err() << "index[" << i << "]=" << index2[i] << " expected " << i 
             << "\n";
    }

  std::vector<size_t> vec;
  vec.push_back(1);
  vec.push_back(3);
  vec.push_back(5);
  utility::SmartPtr<const std::vector<size_t> > 
    sp(new const std::vector<size_t>(vec));
  Index index3(sp);
  if (index3.size()!=vec.size()){
    suite.add(false);
    suite.err() << "Constructor from SmartPtr failed\n";
  }
  for (size_t i=0; i<index3.size(); ++i)
    if (index3[i]!=vec[i]){
      suite.add(false);
      suite.err() << "index[" << i << "]=" << index3[i] << " expected " << vec[i] 
             << "\n";
    }

  suite.err() << "  testing creation of sub index\n";
  Index index4(index2, index3);
  if (index4.size()!=index3.size()){
    suite.add(false);
    suite.err() << "failed\n";
  }
  for (size_t i=0; i<index4.size(); ++i)
    if (index4[i]!=index2[index3[i]]){
      suite.add(false);
      suite.err() << "index[" << i << "]=" << index4[i] << " expected " 
             << index2[index3[i]] << "\n";
    }

  Index index5(index4);
  if (index5.size()!=index4.size()){
    suite.add(false);
    suite.err() << "failed\n";
  }
  for (size_t i=0; i<index5.size(); ++i)
    if (index5[i]!=index4[i]){
      suite.add(false);
      suite.err() << "index[" << i << "]=" << index5[i] << " expected " 
             << index4[i] << "\n";
    }
    
  return suite.return_value();
}