source: trunk/c++_tools/classifier/DataLookup1D.cc @ 624

// $Id$

#include <c++_tools/classifier/DataLookup1D.h>
#include <c++_tools/classifier/DataLookup2D.h>
#include <c++_tools/classifier/MatrixLookup.h>

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

namespace theplu {
namespace classifier {

  DataLookup1D::DataLookup1D(const DataLookup2D& 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()
  {
    if (owner_)
      delete matrix_;
  }


  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 and namespace theplu