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

// $Id$

/*
  Copyright (C) 2005 Peter Johansson
  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 "DataLookup1D.h"
#include "MatrixLookup.h"

#include "yat/utility/Matrix.h"
#include "yat/utility/Vector.h"

#include <cassert>
#include <iostream>
#include <iomanip>

namespace theplu {
namespace yat {
namespace classifier {

  DataLookup1D::DataLookup1D(const MatrixLookup& m, const size_t i, 
                             const bool row_vector)
    : column_vector_(!row_vector), index_(i), matrix_(&m), owner_(false)
  {
    assert( !column_vector_ || i<m.columns());
    assert( column_vector_ || i<m.rows());
  }
  

  DataLookup1D::DataLookup1D(const size_t size, const double value)
    : column_vector_(false), index_(0), owner_(true)
  {
    matrix_ = new MatrixLookup(1,size,value);
  }


  DataLookup1D::DataLookup1D(const DataLookup1D& other)
    : column_vector_(other.column_vector_), index_(other.index_),
      matrix_(other.matrix_), owner_(false)
  {
  }


  DataLookup1D::DataLookup1D(const utility::VectorBase& v, 
                             const std::vector<size_t>& index)
    : column_vector_(true), index_(0), owner_(true)
  {
    utility::Matrix* m = new utility::Matrix(1,index.size());
    for (size_t i=0; i<index.size(); ++i){
      assert(index[i]<v.size());
      (*m)(0,i)=v(index[i]);
    }
    matrix_ = new MatrixLookup(*m, true);
  }


  DataLookup1D::DataLookup1D(const utility::VectorBase& v)
    : column_vector_(false), index_(0), owner_(true)
  {
    utility::Matrix* m = new utility::Matrix(1,v.size());
    for (size_t i=0; i<v.size(); ++i){
      (*m)(0,i)=v(i);
    }
    matrix_ = new MatrixLookup(*m, true);
  }


  DataLookup1D::~DataLookup1D()
  {
    if (owner_)
      delete matrix_;
  }


  DataLookup1D::const_iterator DataLookup1D::begin(void) const
  {
    if (column_vector_)
      return const_iterator(const_iterator::iterator_type(*matrix_, 0, index_), 
                            matrix_->columns());
    return const_iterator(const_iterator::iterator_type(*matrix_, index_, 0),1);
  }


  DataLookup1D::const_iterator DataLookup1D::end(void) const
  {
    if (column_vector_)
      return const_iterator(const_iterator::iterator_type(*matrix_,
                                                          matrix_->rows(), 
                                                          index_), 
                            matrix_->columns());
    return const_iterator(const_iterator::iterator_type(*matrix_,index_+1,0), 1);
  }


  size_t DataLookup1D::size(void) const
  {
    return column_vector_ ? matrix_->rows() : matrix_->columns();
  }


  double DataLookup1D::operator()(const size_t i) const
  { 
    assert(i<size());
    return column_vector_ ? (*matrix_)(i,index_) : (*matrix_)(index_,i);
  }


  double DataLookup1D::operator*(const DataLookup1D& other) const
  {
    assert(other.size()==size());
    double res=0;
    for (size_t i = 0; i<size(); i++)
      res += (*this)(i)*other(i);
    return res;
  }


  std::ostream& operator<<(std::ostream& os, const DataLookup1D& x)
  {
    os.setf(std::ios::dec);
    os.precision(12);
    
    for (size_t i=0; i<x.size(); ++i) {
      os << x(i);
      if ((i+1)<x.size())
        os << os.fill();
    }
    return os;
  }

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