Mercurial > hg > octave-lyh
annotate liboctave/dColVector.cc @ 8920:eb63fbe60fab
update copyright notices
| author | John W. Eaton <jwe@octave.org> |
|---|---|
| date | Sat, 07 Mar 2009 10:41:27 -0500 |
| parents | 82be108cc558 |
| children | dc07bc4157b8 |
| rev | line source |
|---|---|
| 1993 | 1 // ColumnVector manipulations. |
| 458 | 2 /* |
| 3 | |
| 7017 | 4 Copyright (C) 1994, 1995, 1996, 1997, 2000, 2001, 2002, 2003, 2004, |
| 8920 | 5 2005, 2007, 2008 John W. Eaton |
| 458 | 6 |
| 7 This file is part of Octave. | |
| 8 | |
| 9 Octave is free software; you can redistribute it and/or modify it | |
| 10 under the terms of the GNU General Public License as published by the | |
| 7016 | 11 Free Software Foundation; either version 3 of the License, or (at your |
| 12 option) any later version. | |
| 458 | 13 |
| 14 Octave is distributed in the hope that it will be useful, but WITHOUT | |
| 15 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| 16 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
| 17 for more details. | |
| 18 | |
| 19 You should have received a copy of the GNU General Public License | |
| 7016 | 20 along with Octave; see the file COPYING. If not, see |
| 21 <http://www.gnu.org/licenses/>. | |
| 458 | 22 |
| 23 */ | |
| 24 | |
| 25 #ifdef HAVE_CONFIG_H | |
| 1192 | 26 #include <config.h> |
| 458 | 27 #endif |
| 28 | |
| 3503 | 29 #include <iostream> |
| 458 | 30 |
| 4669 | 31 #include "Array-util.h" |
| 1847 | 32 #include "f77-fcn.h" |
|
7503
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7482
diff
changeset
|
33 #include "functor.h" |
| 1368 | 34 #include "lo-error.h" |
| 458 | 35 #include "mx-base.h" |
| 36 #include "mx-inlines.cc" | |
| 1650 | 37 #include "oct-cmplx.h" |
| 458 | 38 |
| 39 // Fortran functions we call. | |
| 40 | |
| 41 extern "C" | |
| 42 { | |
| 4552 | 43 F77_RET_T |
| 44 F77_FUNC (dgemv, DGEMV) (F77_CONST_CHAR_ARG_DECL, | |
| 5275 | 45 const octave_idx_type&, const octave_idx_type&, const double&, |
| 46 const double*, const octave_idx_type&, const double*, | |
| 47 const octave_idx_type&, const double&, double*, | |
| 48 const octave_idx_type& | |
| 4552 | 49 F77_CHAR_ARG_LEN_DECL); |
| 458 | 50 } |
| 51 | |
| 1360 | 52 // Column Vector class. |
| 458 | 53 |
| 2386 | 54 bool |
| 458 | 55 ColumnVector::operator == (const ColumnVector& a) const |
| 56 { | |
| 5275 | 57 octave_idx_type len = length (); |
| 458 | 58 if (len != a.length ()) |
| 59 return 0; | |
| 3769 | 60 return mx_inline_equal (data (), a.data (), len); |
| 458 | 61 } |
| 62 | |
| 2386 | 63 bool |
| 458 | 64 ColumnVector::operator != (const ColumnVector& a) const |
| 65 { | |
| 66 return !(*this == a); | |
| 67 } | |
| 68 | |
| 69 ColumnVector& | |
| 5275 | 70 ColumnVector::insert (const ColumnVector& a, octave_idx_type r) |
| 458 | 71 { |
| 5275 | 72 octave_idx_type a_len = a.length (); |
| 4316 | 73 |
| 1699 | 74 if (r < 0 || r + a_len > length ()) |
| 458 | 75 { |
| 76 (*current_liboctave_error_handler) ("range error for insert"); | |
| 77 return *this; | |
| 78 } | |
| 79 | |
| 4316 | 80 if (a_len > 0) |
| 81 { | |
| 82 make_unique (); | |
| 83 | |
| 5275 | 84 for (octave_idx_type i = 0; i < a_len; i++) |
| 4316 | 85 xelem (r+i) = a.elem (i); |
| 86 } | |
| 458 | 87 |
| 88 return *this; | |
| 89 } | |
| 90 | |
| 91 ColumnVector& | |
| 92 ColumnVector::fill (double val) | |
| 93 { | |
| 5275 | 94 octave_idx_type len = length (); |
| 4316 | 95 |
| 458 | 96 if (len > 0) |
| 4316 | 97 { |
| 98 make_unique (); | |
| 99 | |
| 5275 | 100 for (octave_idx_type i = 0; i < len; i++) |
| 4316 | 101 xelem (i) = val; |
| 102 } | |
| 103 | |
| 458 | 104 return *this; |
| 105 } | |
| 106 | |
| 107 ColumnVector& | |
| 5275 | 108 ColumnVector::fill (double val, octave_idx_type r1, octave_idx_type r2) |
| 458 | 109 { |
| 5275 | 110 octave_idx_type len = length (); |
| 4316 | 111 |
| 458 | 112 if (r1 < 0 || r2 < 0 || r1 >= len || r2 >= len) |
| 113 { | |
| 114 (*current_liboctave_error_handler) ("range error for fill"); | |
| 115 return *this; | |
| 116 } | |
| 117 | |
| 5275 | 118 if (r1 > r2) { octave_idx_type tmp = r1; r1 = r2; r2 = tmp; } |
| 458 | 119 |
| 4316 | 120 if (r2 >= r1) |
| 121 { | |
| 122 make_unique (); | |
| 123 | |
| 5275 | 124 for (octave_idx_type i = r1; i <= r2; i++) |
| 4316 | 125 xelem (i) = val; |
| 126 } | |
| 458 | 127 |
| 128 return *this; | |
| 129 } | |
| 130 | |
| 131 ColumnVector | |
| 132 ColumnVector::stack (const ColumnVector& a) const | |
| 133 { | |
| 5275 | 134 octave_idx_type len = length (); |
| 135 octave_idx_type nr_insert = len; | |
| 458 | 136 ColumnVector retval (len + a.length ()); |
| 137 retval.insert (*this, 0); | |
| 138 retval.insert (a, nr_insert); | |
| 139 return retval; | |
| 140 } | |
| 141 | |
| 142 RowVector | |
| 143 ColumnVector::transpose (void) const | |
| 144 { | |
|
7789
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7503
diff
changeset
|
145 return MArray<double>::transpose(); |
| 458 | 146 } |
| 147 | |
| 1205 | 148 ColumnVector |
| 149 real (const ComplexColumnVector& a) | |
| 150 { | |
| 5275 | 151 octave_idx_type a_len = a.length (); |
| 1205 | 152 ColumnVector retval; |
| 153 if (a_len > 0) | |
| 3769 | 154 retval = ColumnVector (mx_inline_real_dup (a.data (), a_len), a_len); |
| 1205 | 155 return retval; |
| 156 } | |
| 157 | |
| 158 ColumnVector | |
| 159 imag (const ComplexColumnVector& a) | |
| 160 { | |
| 5275 | 161 octave_idx_type a_len = a.length (); |
| 1205 | 162 ColumnVector retval; |
| 163 if (a_len > 0) | |
| 3769 | 164 retval = ColumnVector (mx_inline_imag_dup (a.data (), a_len), a_len); |
| 1205 | 165 return retval; |
| 166 } | |
| 167 | |
| 458 | 168 // resize is the destructive equivalent for this one |
| 169 | |
| 170 ColumnVector | |
| 5275 | 171 ColumnVector::extract (octave_idx_type r1, octave_idx_type r2) const |
| 458 | 172 { |
| 5275 | 173 if (r1 > r2) { octave_idx_type tmp = r1; r1 = r2; r2 = tmp; } |
| 458 | 174 |
| 5275 | 175 octave_idx_type new_r = r2 - r1 + 1; |
| 458 | 176 |
| 177 ColumnVector result (new_r); | |
| 178 | |
| 5275 | 179 for (octave_idx_type i = 0; i < new_r; i++) |
| 4316 | 180 result.xelem (i) = elem (r1+i); |
| 181 | |
| 182 return result; | |
| 183 } | |
| 184 | |
| 185 ColumnVector | |
| 5275 | 186 ColumnVector::extract_n (octave_idx_type r1, octave_idx_type n) const |
| 4316 | 187 { |
| 188 ColumnVector result (n); | |
| 189 | |
| 5275 | 190 for (octave_idx_type i = 0; i < n; i++) |
| 4316 | 191 result.xelem (i) = elem (r1+i); |
| 458 | 192 |
| 193 return result; | |
| 194 } | |
| 195 | |
| 1205 | 196 // matrix by column vector -> column vector operations |
| 458 | 197 |
| 1205 | 198 ColumnVector |
| 199 operator * (const Matrix& m, const ColumnVector& a) | |
| 458 | 200 { |
| 1947 | 201 ColumnVector retval; |
| 202 | |
| 5275 | 203 octave_idx_type nr = m.rows (); |
| 204 octave_idx_type nc = m.cols (); | |
| 1947 | 205 |
| 5275 | 206 octave_idx_type a_len = a.length (); |
| 2386 | 207 |
| 208 if (nc != a_len) | |
| 209 gripe_nonconformant ("operator *", nr, nc, a_len, 1); | |
| 1947 | 210 else |
| 458 | 211 { |
| 1947 | 212 if (nr == 0 || nc == 0) |
| 213 retval.resize (nr, 0.0); | |
| 214 else | |
| 215 { | |
| 5275 | 216 octave_idx_type ld = nr; |
| 1947 | 217 |
| 218 retval.resize (nr); | |
| 219 double *y = retval.fortran_vec (); | |
| 220 | |
| 4552 | 221 F77_XFCN (dgemv, DGEMV, (F77_CONST_CHAR_ARG2 ("N", 1), |
| 222 nr, nc, 1.0, m.data (), ld, | |
| 223 a.data (), 1, 0.0, y, 1 | |
| 224 F77_CHAR_ARG_LEN (1))); | |
| 1947 | 225 } |
| 458 | 226 } |
| 227 | |
| 1947 | 228 return retval; |
| 458 | 229 } |
| 230 | |
| 1205 | 231 // diagonal matrix by column vector -> column vector operations |
| 232 | |
| 233 ColumnVector | |
| 234 operator * (const DiagMatrix& m, const ColumnVector& a) | |
| 458 | 235 { |
| 1947 | 236 ColumnVector retval; |
| 237 | |
| 5275 | 238 octave_idx_type nr = m.rows (); |
| 239 octave_idx_type nc = m.cols (); | |
| 1947 | 240 |
| 5275 | 241 octave_idx_type a_len = a.length (); |
| 1947 | 242 |
| 1205 | 243 if (nc != a_len) |
| 2386 | 244 gripe_nonconformant ("operator *", nr, nc, a_len, 1); |
| 1947 | 245 else |
| 458 | 246 { |
| 1947 | 247 if (nr == 0 || nc == 0) |
| 248 retval.resize (nr, 0.0); | |
| 249 else | |
| 250 { | |
| 251 retval.resize (nr); | |
| 252 | |
| 5275 | 253 for (octave_idx_type i = 0; i < a_len; i++) |
| 1947 | 254 retval.elem (i) = a.elem (i) * m.elem (i, i); |
| 255 | |
| 5275 | 256 for (octave_idx_type i = a_len; i < nr; i++) |
| 1947 | 257 retval.elem (i) = 0.0; |
| 258 } | |
| 458 | 259 } |
| 260 | |
| 1947 | 261 return retval; |
| 458 | 262 } |
| 263 | |
| 264 // other operations | |
| 265 | |
| 266 ColumnVector | |
|
7503
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7482
diff
changeset
|
267 ColumnVector::map (dmapper fcn) const |
| 458 | 268 { |
|
7503
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7482
diff
changeset
|
269 return MArray<double>::map<double> (func_ptr (fcn)); |
| 458 | 270 } |
| 271 | |
|
7503
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7482
diff
changeset
|
272 ComplexColumnVector |
|
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7482
diff
changeset
|
273 ColumnVector::map (cmapper fcn) const |
| 1205 | 274 { |
|
7503
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7482
diff
changeset
|
275 return MArray<double>::map<Complex> (func_ptr (fcn)); |
| 458 | 276 } |
| 277 | |
| 278 double | |
| 279 ColumnVector::min (void) const | |
| 280 { | |
| 5275 | 281 octave_idx_type len = length (); |
| 458 | 282 if (len == 0) |
| 283 return 0.0; | |
| 284 | |
| 285 double res = elem (0); | |
| 286 | |
| 5275 | 287 for (octave_idx_type i = 1; i < len; i++) |
| 458 | 288 if (elem (i) < res) |
| 289 res = elem (i); | |
| 290 | |
| 291 return res; | |
| 292 } | |
| 293 | |
| 294 double | |
| 295 ColumnVector::max (void) const | |
| 296 { | |
| 5275 | 297 octave_idx_type len = length (); |
| 458 | 298 if (len == 0) |
| 299 return 0.0; | |
| 300 | |
| 301 double res = elem (0); | |
| 302 | |
| 5275 | 303 for (octave_idx_type i = 1; i < len; i++) |
| 458 | 304 if (elem (i) > res) |
| 305 res = elem (i); | |
| 306 | |
| 307 return res; | |
| 308 } | |
| 309 | |
| 3504 | 310 std::ostream& |
| 311 operator << (std::ostream& os, const ColumnVector& a) | |
| 458 | 312 { |
| 313 // int field_width = os.precision () + 7; | |
| 5275 | 314 for (octave_idx_type i = 0; i < a.length (); i++) |
| 458 | 315 os << /* setw (field_width) << */ a.elem (i) << "\n"; |
| 316 return os; | |
| 317 } | |
| 318 | |
| 3504 | 319 std::istream& |
| 320 operator >> (std::istream& is, ColumnVector& a) | |
| 458 | 321 { |
| 5275 | 322 octave_idx_type len = a.length(); |
| 458 | 323 |
| 324 if (len < 1) | |
| 3504 | 325 is.clear (std::ios::badbit); |
| 458 | 326 else |
| 327 { | |
| 328 double tmp; | |
| 5275 | 329 for (octave_idx_type i = 0; i < len; i++) |
| 458 | 330 { |
| 331 is >> tmp; | |
| 332 if (is) | |
| 333 a.elem (i) = tmp; | |
| 334 else | |
| 335 break; | |
| 336 } | |
| 337 } | |
| 532 | 338 return is; |
| 458 | 339 } |
| 340 | |
| 341 /* | |
| 342 ;;; Local Variables: *** | |
| 343 ;;; mode: C++ *** | |
| 344 ;;; End: *** | |
| 345 */ |