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

Last change on this file since 1121 was 1121, checked in by Peter, 14 years ago

fixes #308

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