source: trunk/yat/classifier/DataLookup1D.cc @ 1437

Last change on this file since 1437 was 1437, checked in by Peter, 13 years ago

merge patch release 0.4.2 to trunk. Delta 0.4.2-0.4.1

  • Property svn:eol-style set to native
  • Property svn:keywords set to Author Date ID
File size: 3.8 KB
RevLine 
[467]1// $Id$
2
[675]3/*
[831]4  Copyright (C) 2005 Peter Johansson
[1275]5  Copyright (C) 2006 Jari Häkkinen, Peter Johansson, Markus Ringnér
6  Copyright (C) 2007 Jari Häkkinen, Peter Johansson
7  Copyright (C) 2008 Peter Johansson
[536]8
[1437]9  This file is part of the yat library, http://dev.thep.lu.se/yat
[675]10
11  The yat library is free software; you can redistribute it and/or
12  modify it under the terms of the GNU General Public License as
13  published by the Free Software Foundation; either version 2 of the
14  License, or (at your option) any later version.
15
16  The yat library is distributed in the hope that it will be useful,
17  but WITHOUT ANY WARRANTY; without even the implied warranty of
18  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
19  General Public License for more details.
20
21  You should have received a copy of the GNU General Public License
22  along with this program; if not, write to the Free Software
23  Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
24  02111-1307, USA.
25*/
26
[680]27#include "DataLookup1D.h"
28#include "MatrixLookup.h"
[675]29
[1121]30#include "yat/utility/Matrix.h"
[1120]31#include "yat/utility/Vector.h"
[766]32
[536]33#include <cassert>
[473]34#include <iostream>
[593]35#include <iomanip>
[467]36
37namespace theplu {
[680]38namespace yat {
[467]39namespace classifier {
40
[1146]41  DataLookup1D::DataLookup1D(const MatrixLookup& m, const size_t i, 
[536]42                             const bool row_vector)
[537]43    : column_vector_(!row_vector), index_(i), matrix_(&m), owner_(false)
[467]44  {
[536]45    assert( !column_vector_ || i<m.columns());
46    assert( column_vector_ || i<m.rows());
[467]47  }
48 
[720]49
[537]50  DataLookup1D::DataLookup1D(const size_t size, const double value)
51    : column_vector_(false), index_(0), owner_(true)
52  {
53    matrix_ = new MatrixLookup(1,size,value);
54  }
55
[720]56
[537]57  DataLookup1D::DataLookup1D(const DataLookup1D& other)
58    : column_vector_(other.column_vector_), index_(other.index_),
59      matrix_(other.matrix_), owner_(false)
60  {
61  }
62
[720]63
[1018]64  DataLookup1D::DataLookup1D(const utility::VectorBase& v, 
[766]65                             const std::vector<size_t>& index)
66    : column_vector_(true), index_(0), owner_(true)
67  {
[1121]68    utility::Matrix* m = new utility::Matrix(1,index.size());
[766]69    for (size_t i=0; i<index.size(); ++i){
70      assert(index[i]<v.size());
71      (*m)(0,i)=v(index[i]);
72    }
73    matrix_ = new MatrixLookup(*m, true);
74  }
75
76
[1018]77  DataLookup1D::DataLookup1D(const utility::VectorBase& v)
[820]78    : column_vector_(false), index_(0), owner_(true)
[815]79  {
[1121]80    utility::Matrix* m = new utility::Matrix(1,v.size());
[815]81    for (size_t i=0; i<v.size(); ++i){
82      (*m)(0,i)=v(i);
83    }
84    matrix_ = new MatrixLookup(*m, true);
85  }
86
87
[473]88  DataLookup1D::~DataLookup1D()
89  {
[537]90    if (owner_)
91      delete matrix_;
[473]92  }
[467]93
[593]94
[880]95  DataLookup1D::const_iterator DataLookup1D::begin(void) const
96  {
[1062]97    if (column_vector_)
[1080]98      return const_iterator(const_iterator::iterator_type(*matrix_, 0, index_), 
99                            matrix_->columns());
100    return const_iterator(const_iterator::iterator_type(*matrix_, index_, 0),1);
[880]101  }
102
103
104  DataLookup1D::const_iterator DataLookup1D::end(void) const
105  {
[1062]106    if (column_vector_)
[1080]107      return const_iterator(const_iterator::iterator_type(*matrix_,
108                                                          matrix_->rows(), 
109                                                          index_), 
[1062]110                            matrix_->columns());
[1080]111    return const_iterator(const_iterator::iterator_type(*matrix_,index_+1,0), 1);
[880]112  }
113
114
[720]115  size_t DataLookup1D::size(void) const
116  {
117    return column_vector_ ? matrix_->rows() : matrix_->columns();
118  }
119
120
121  double DataLookup1D::operator()(const size_t i) const
122  { 
123    assert(i<size());
124    return column_vector_ ? (*matrix_)(i,index_) : (*matrix_)(index_,i);
125  }
126
127
[527]128  double DataLookup1D::operator*(const DataLookup1D& other) const
129  {
130    assert(other.size()==size());
131    double res=0;
132    for (size_t i = 0; i<size(); i++)
133      res += (*this)(i)*other(i);
134    return res;
135  }
136
[593]137
138  std::ostream& operator<<(std::ostream& os, const DataLookup1D& x)
[527]139  {
140    os.setf(std::ios::dec);
141    os.precision(12);
[593]142   
143    for (size_t i=0; i<x.size(); ++i) {
[527]144      os << x(i);
[593]145      if ((i+1)<x.size())
146        os << os.fill();
[527]147    }
148    return os;
149  }
[593]150
[680]151}}} // of namespace classifier, yat, and theplu
Note: See TracBrowser for help on using the repository browser.