source: trunk/test/target_test.cc @ 1134

// $Id: target_test.cc 1134 2008-02-23 22:52:43Z peter $

/*
  Copyright (C) 2006 Jari Häkkinen, 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 "yat/classifier/Target.h"
#include "yat/utility/Index.h"

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

using namespace theplu::yat;

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

  // This test assumes classes are introduced in order of appearence
  std::vector<std::string> color(10,"default");
  color[2]=color[7]="white";
  color[4]=color[5]="black";
  color[6]=color[3]="green";
  color[8]=color[9]="red";
  classifier::Target target3(color);
  std::vector<size_t> facit(10);
  facit[2]=facit[7]=1;
  facit[4]=facit[5]=3;
  facit[6]=facit[3]=2;
  facit[8]=facit[9]=4;
  
  for (size_t i=0; i<facit.size(); i++){
    if (target3(i)!=facit[i]){
      ok=false;
      *error << "target(" << i << ") is " << target3(0) << " expected " 
             << facit[i] << std::endl;
    }
  }
  std::vector<size_t> sub;
  sub.push_back(2);
  sub.push_back(1);
  classifier::Target sub_target(target3,utility::Index(sub));
  if (target3(sub[0])!=sub_target(0) || target3(sub[1])!=sub_target(1)){
    ok = false;
    *error << "error in constructor Target(const Target&, std::vector<size_t>&)"
           << "\nclasses are not preserved" << std::endl;
  }
  if (target3.binary(sub[0])!=sub_target.binary(0) || 
      target3.binary(sub[1])!=sub_target.binary(1)){
    ok = false;
    *error << "error in constructor Target(const Target&, std::vector<size_t>&)"
           << "\nbinary classes are not preserved" << std::endl;
  }


  std::vector<std::string> label(31,"negative");
  for (size_t i=0; i<16; i++) 
    label[i] = "positive";
  label[20]="neither";
  classifier::Target target(label);
  if (target.nof_classes()!=3){
    ok=false;
    *error << "Expected number of classes to be 3" << std::endl;
  }
  if (target(0)!=0){
    ok=false;
    *error << "Error: target(0)!=0" << std::endl;
  }
  if (target(20)!=2){
    ok=false;
    *error << "Error: target(20)!=2" << std::endl;
  }
  if (!target.binary(0)){
    ok=false;
    *error << "Error: target.binary(0) not true" << std::endl;
  }   
  if (target.binary(20)){
    ok=false;
    *error << "Error: target.binary(20) not false" << std::endl;
  }   
  target.set_binary(2,true);
  if (!target.binary(20)){
    ok=false;
    *error << "Error: target.binary(20) not true" << std::endl;
  }   
  std::ifstream is("data/rank_target.txt");
  classifier::Target target2(is);
  is.close();
  if (target2.size()!=6){
    ok=false;
    *error << "ERROR: size of target is " << target2.size() << " expected 6." 
           << std::endl;
  }   

  if (ok)
    return 0;
  return -1;
}