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

Last change on this file since 1487 was 1487, checked in by Jari Häkkinen, 14 years ago

Addresses #436. GPL license copy reference should also be updated.

  • Property svn:eol-style set to native
  • Property svn:keywords set to Author Date ID
File size: 3.8 KB
Line 
1// $Id$
2
3/*
4  Copyright (C) 2005 Peter Johansson
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
8
9  This file is part of the yat library, http://dev.thep.lu.se/yat
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 3 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 yat. If not, see <http://www.gnu.org/licenses/>.
23*/
24
25#include "DataLookup1D.h"
26#include "MatrixLookup.h"
27
28#include "yat/utility/Matrix.h"
29#include "yat/utility/Vector.h"
30
31#include <cassert>
32#include <iostream>
33#include <iomanip>
34
35namespace theplu {
36namespace yat {
37namespace classifier {
38
39  DataLookup1D::DataLookup1D(const MatrixLookup& m, const size_t i, 
40                             const bool row_vector)
41    : column_vector_(!row_vector), index_(i), matrix_(&m), owner_(false)
42  {
43    assert( !column_vector_ || i<m.columns());
44    assert( column_vector_ || i<m.rows());
45  }
46 
47
48  DataLookup1D::DataLookup1D(const size_t size, const double value)
49    : column_vector_(false), index_(0), owner_(true)
50  {
51    matrix_ = new MatrixLookup(1,size,value);
52  }
53
54
55  DataLookup1D::DataLookup1D(const DataLookup1D& other)
56    : column_vector_(other.column_vector_), index_(other.index_),
57      matrix_(other.matrix_), owner_(false)
58  {
59  }
60
61
62  DataLookup1D::DataLookup1D(const utility::VectorBase& v, 
63                             const std::vector<size_t>& index)
64    : column_vector_(true), index_(0), owner_(true)
65  {
66    utility::Matrix* m = new utility::Matrix(1,index.size());
67    for (size_t i=0; i<index.size(); ++i){
68      assert(index[i]<v.size());
69      (*m)(0,i)=v(index[i]);
70    }
71    matrix_ = new MatrixLookup(*m, true);
72  }
73
74
75  DataLookup1D::DataLookup1D(const utility::VectorBase& v)
76    : column_vector_(false), index_(0), owner_(true)
77  {
78    utility::Matrix* m = new utility::Matrix(1,v.size());
79    for (size_t i=0; i<v.size(); ++i){
80      (*m)(0,i)=v(i);
81    }
82    matrix_ = new MatrixLookup(*m, true);
83  }
84
85
86  DataLookup1D::~DataLookup1D()
87  {
88    if (owner_)
89      delete matrix_;
90  }
91
92
93  DataLookup1D::const_iterator DataLookup1D::begin(void) const
94  {
95    if (column_vector_)
96      return const_iterator(const_iterator::iterator_type(*matrix_, 0, index_), 
97                            matrix_->columns());
98    return const_iterator(const_iterator::iterator_type(*matrix_, index_, 0),1);
99  }
100
101
102  DataLookup1D::const_iterator DataLookup1D::end(void) const
103  {
104    if (column_vector_)
105      return const_iterator(const_iterator::iterator_type(*matrix_,
106                                                          matrix_->rows(), 
107                                                          index_), 
108                            matrix_->columns());
109    return const_iterator(const_iterator::iterator_type(*matrix_,index_+1,0), 1);
110  }
111
112
113  size_t DataLookup1D::size(void) const
114  {
115    return column_vector_ ? matrix_->rows() : matrix_->columns();
116  }
117
118
119  double DataLookup1D::operator()(const size_t i) const
120  { 
121    assert(i<size());
122    return column_vector_ ? (*matrix_)(i,index_) : (*matrix_)(index_,i);
123  }
124
125
126  double DataLookup1D::operator*(const DataLookup1D& other) const
127  {
128    assert(other.size()==size());
129    double res=0;
130    for (size_t i = 0; i<size(); i++)
131      res += (*this)(i)*other(i);
132    return res;
133  }
134
135
136  std::ostream& operator<<(std::ostream& os, const DataLookup1D& x)
137  {
138    os.setf(std::ios::dec);
139    os.precision(12);
140   
141    for (size_t i=0; i<x.size(); ++i) {
142      os << x(i);
143      if ((i+1)<x.size())
144        os << os.fill();
145    }
146    return os;
147  }
148
149}}} // of namespace classifier, yat, and theplu
Note: See TracBrowser for help on using the repository browser.