source: branches/0.4-stable/yat/classifier/MatrixLookup.cc @ 1392

// $Id$

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

  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 "MatrixLookup.h"
#include "yat/utility/Matrix.h"

#include <algorithm>
#include <cassert>
#include <fstream>
#include <vector>

namespace theplu {
namespace yat {
namespace classifier {

  MatrixLookup::MatrixLookup(const utility::Matrix& data, const bool own)
    : data_(MatrixP(&data, own))
  {
    column_index_ = utility::Index(data.columns());
    row_index_ = utility::Index(data.rows());
    assert(rows()==data.rows());
    assert(columns()==data.columns());
    assert(validate());
  }
  


  MatrixLookup::MatrixLookup(const utility::Matrix& data, 
                             const utility::Index& row, 
                             const utility::Index& col)
    : column_index_(col),
      data_(MatrixP(&data, false)), 
      row_index_(row)

  {
    assert(rows()==row.size());
    assert(columns()==col.size());
    assert(validate());
  }
  


  MatrixLookup::MatrixLookup(const utility::Matrix& data, 
                             const utility::Index& index, 
                             const bool row)
    : data_(MatrixP(&data, false))
  {
    if (row){
      row_index_=index;
      column_index_ = utility::Index(data.columns());
    }
    else{
      column_index_=index;
      row_index_ = utility::Index(data.rows());
    }
    assert(row || rows()==data.rows());
    assert(row || columns()==index.size());
    assert(!row || rows()==index.size());
    assert(!row || columns()==data.columns());
    assert(validate());
  }
  


  MatrixLookup::MatrixLookup(const MatrixLookup& other)
    : column_index_(other.column_index_), 
      data_(other.data_),
      row_index_(other.row_index_)
  {
    assert(validate());
  }



  MatrixLookup::MatrixLookup(const MatrixLookup& other, 
                             const utility::Index& row, 
                             const utility::Index& col)
    : column_index_(utility::Index(other.column_index_, col)), 
      data_(other.data_), row_index_(utility::Index(other.row_index_, row)) 
  {
    assert(rows()==row.size());
    assert(columns()==col.size());
    assert(validate());
  }
  


  MatrixLookup::MatrixLookup(const MatrixLookup& other, 
                             const utility::Index& index, bool row)
    : data_(other.data_)
  {
    if (row){
      row_index_ = utility::Index(other.row_index_, index);
      column_index_= other.column_index_;
    }
    else{
      column_index_ = utility::Index(other.column_index_, index);
      row_index_= other.row_index_;
    }
    assert(validate());
  }
  


  MatrixLookup::MatrixLookup(const size_t rows, const size_t columns, 
                             const double value)
    : data_(MatrixP(new utility::Matrix(1,1,value)))
  {   
    column_index_ = utility::Index(std::vector<size_t>(columns, 0));
    row_index_ = utility::Index(std::vector<size_t>(rows,0));
    assert(validate());
  }


  MatrixLookup::MatrixLookup(std::istream& is, char sep)
    : data_(MatrixP(new utility::Matrix(is,sep)))
  {
    column_index_ = utility::Index(data_->columns());
    row_index_ = utility::Index(data_->rows());
    assert(validate());
  }


  MatrixLookup::~MatrixLookup(void)
  {
  }


  MatrixLookup::const_iterator MatrixLookup::begin(void) const
  {
    return const_iterator(const_iterator::iterator_type(*this, 0, 0), 1);
  }


  MatrixLookup::const_column_iterator MatrixLookup::begin_column(size_t i) const
  {
    return const_column_iterator(const_column_iterator::iterator_type(*this, 0,
                                                                      i),
                                 columns());
  }


  MatrixLookup::const_row_iterator MatrixLookup::begin_row(size_t i) const
  {
    return const_row_iterator(const_row_iterator::iterator_type(*this,i,0), 1);
  }


  size_t MatrixLookup::columns(void) const
  {
    return column_index_.size();
  }


  MatrixLookup::const_iterator MatrixLookup::end(void) const
  {
    return const_iterator(const_iterator::iterator_type(*this, rows(), 0), 1);
  }


  MatrixLookup::const_column_iterator MatrixLookup::end_column(size_t i) const
  {
    return 
      const_column_iterator(const_column_iterator::iterator_type(*this,rows(),
                                                                      i), 
                            columns());
  }


  MatrixLookup::const_row_iterator MatrixLookup::end_row(size_t i) const
  {
    return const_row_iterator(const_row_iterator::iterator_type(*this,i+1,0),1);
  }


  size_t MatrixLookup::rows(void) const
  {
    return row_index_.size();
  }


  bool MatrixLookup::validate(void) const
  {
    for (size_t i=0; i<row_index_.size(); ++i)
      if (row_index_[i]>=data_->rows())
        return false;
    for (size_t i=0; i<column_index_.size(); ++i)
      if (column_index_[i]>=data_->columns())
        return false;
    return true;
  }


  bool MatrixLookup::weighted(void) const 
  {
    return false;
  }



  double MatrixLookup::operator()(const size_t row, const size_t column) const
  {
    assert(row<rows());
    assert(column<columns());
    assert(row_index_[row]<data_->rows());
    assert(column_index_[column]<data_->columns());
    return (*data_)(row_index_[row], column_index_[column]);
  }



  const MatrixLookup& MatrixLookup::operator=(const MatrixLookup& other)
  {
    if (this!=&other){
      row_index_ = other.row_index_;
      column_index_ = other.column_index_;
      data_ = other.data_;
    }
    assert(validate());
    return *this;
  }


  std::ostream& operator<<(std::ostream& s, const MatrixLookup& m)
  {
    s.setf(std::ios::dec);
    s.precision(12);
    for(size_t i=0, j=0; i<m.rows(); i++)
      for (j=0; j<m.columns(); j++) {
        s << m(i,j);
        if (j<m.columns()-1)
          s << s.fill();
        else if (i<m.rows()-1)
          s << "\n";
      }
    return s;
  }



}}} // of namespace classifier, yat, and theplu