1993
|
1 // ColumnVector manipulations. |
458
|
2 /* |
|
3 |
7017
|
4 Copyright (C) 1994, 1995, 1996, 1997, 2000, 2001, 2002, 2003, 2004, |
|
5 2005, 2007 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" |
1368
|
33 #include "lo-error.h" |
458
|
34 #include "mx-base.h" |
|
35 #include "mx-inlines.cc" |
1650
|
36 #include "oct-cmplx.h" |
458
|
37 |
|
38 // Fortran functions we call. |
|
39 |
|
40 extern "C" |
|
41 { |
4552
|
42 F77_RET_T |
|
43 F77_FUNC (dgemv, DGEMV) (F77_CONST_CHAR_ARG_DECL, |
5275
|
44 const octave_idx_type&, const octave_idx_type&, const double&, |
|
45 const double*, const octave_idx_type&, const double*, |
|
46 const octave_idx_type&, const double&, double*, |
|
47 const octave_idx_type& |
4552
|
48 F77_CHAR_ARG_LEN_DECL); |
458
|
49 } |
|
50 |
1360
|
51 // Column Vector class. |
458
|
52 |
2386
|
53 bool |
458
|
54 ColumnVector::operator == (const ColumnVector& a) const |
|
55 { |
5275
|
56 octave_idx_type len = length (); |
458
|
57 if (len != a.length ()) |
|
58 return 0; |
3769
|
59 return mx_inline_equal (data (), a.data (), len); |
458
|
60 } |
|
61 |
2386
|
62 bool |
458
|
63 ColumnVector::operator != (const ColumnVector& a) const |
|
64 { |
|
65 return !(*this == a); |
|
66 } |
|
67 |
|
68 ColumnVector& |
5275
|
69 ColumnVector::insert (const ColumnVector& a, octave_idx_type r) |
458
|
70 { |
5275
|
71 octave_idx_type a_len = a.length (); |
4316
|
72 |
1699
|
73 if (r < 0 || r + a_len > length ()) |
458
|
74 { |
|
75 (*current_liboctave_error_handler) ("range error for insert"); |
|
76 return *this; |
|
77 } |
|
78 |
4316
|
79 if (a_len > 0) |
|
80 { |
|
81 make_unique (); |
|
82 |
5275
|
83 for (octave_idx_type i = 0; i < a_len; i++) |
4316
|
84 xelem (r+i) = a.elem (i); |
|
85 } |
458
|
86 |
|
87 return *this; |
|
88 } |
|
89 |
|
90 ColumnVector& |
|
91 ColumnVector::fill (double val) |
|
92 { |
5275
|
93 octave_idx_type len = length (); |
4316
|
94 |
458
|
95 if (len > 0) |
4316
|
96 { |
|
97 make_unique (); |
|
98 |
5275
|
99 for (octave_idx_type i = 0; i < len; i++) |
4316
|
100 xelem (i) = val; |
|
101 } |
|
102 |
458
|
103 return *this; |
|
104 } |
|
105 |
|
106 ColumnVector& |
5275
|
107 ColumnVector::fill (double val, octave_idx_type r1, octave_idx_type r2) |
458
|
108 { |
5275
|
109 octave_idx_type len = length (); |
4316
|
110 |
458
|
111 if (r1 < 0 || r2 < 0 || r1 >= len || r2 >= len) |
|
112 { |
|
113 (*current_liboctave_error_handler) ("range error for fill"); |
|
114 return *this; |
|
115 } |
|
116 |
5275
|
117 if (r1 > r2) { octave_idx_type tmp = r1; r1 = r2; r2 = tmp; } |
458
|
118 |
4316
|
119 if (r2 >= r1) |
|
120 { |
|
121 make_unique (); |
|
122 |
5275
|
123 for (octave_idx_type i = r1; i <= r2; i++) |
4316
|
124 xelem (i) = val; |
|
125 } |
458
|
126 |
|
127 return *this; |
|
128 } |
|
129 |
|
130 ColumnVector |
|
131 ColumnVector::stack (const ColumnVector& a) const |
|
132 { |
5275
|
133 octave_idx_type len = length (); |
|
134 octave_idx_type nr_insert = len; |
458
|
135 ColumnVector retval (len + a.length ()); |
|
136 retval.insert (*this, 0); |
|
137 retval.insert (a, nr_insert); |
|
138 return retval; |
|
139 } |
|
140 |
|
141 RowVector |
|
142 ColumnVector::transpose (void) const |
|
143 { |
1858
|
144 return RowVector (*this); |
458
|
145 } |
|
146 |
1205
|
147 ColumnVector |
|
148 real (const ComplexColumnVector& a) |
|
149 { |
5275
|
150 octave_idx_type a_len = a.length (); |
1205
|
151 ColumnVector retval; |
|
152 if (a_len > 0) |
3769
|
153 retval = ColumnVector (mx_inline_real_dup (a.data (), a_len), a_len); |
1205
|
154 return retval; |
|
155 } |
|
156 |
|
157 ColumnVector |
|
158 imag (const ComplexColumnVector& a) |
|
159 { |
5275
|
160 octave_idx_type a_len = a.length (); |
1205
|
161 ColumnVector retval; |
|
162 if (a_len > 0) |
3769
|
163 retval = ColumnVector (mx_inline_imag_dup (a.data (), a_len), a_len); |
1205
|
164 return retval; |
|
165 } |
|
166 |
458
|
167 // resize is the destructive equivalent for this one |
|
168 |
|
169 ColumnVector |
5275
|
170 ColumnVector::extract (octave_idx_type r1, octave_idx_type r2) const |
458
|
171 { |
5275
|
172 if (r1 > r2) { octave_idx_type tmp = r1; r1 = r2; r2 = tmp; } |
458
|
173 |
5275
|
174 octave_idx_type new_r = r2 - r1 + 1; |
458
|
175 |
|
176 ColumnVector result (new_r); |
|
177 |
5275
|
178 for (octave_idx_type i = 0; i < new_r; i++) |
4316
|
179 result.xelem (i) = elem (r1+i); |
|
180 |
|
181 return result; |
|
182 } |
|
183 |
|
184 ColumnVector |
5275
|
185 ColumnVector::extract_n (octave_idx_type r1, octave_idx_type n) const |
4316
|
186 { |
|
187 ColumnVector result (n); |
|
188 |
5275
|
189 for (octave_idx_type i = 0; i < n; i++) |
4316
|
190 result.xelem (i) = elem (r1+i); |
458
|
191 |
|
192 return result; |
|
193 } |
|
194 |
1205
|
195 // matrix by column vector -> column vector operations |
458
|
196 |
1205
|
197 ColumnVector |
|
198 operator * (const Matrix& m, const ColumnVector& a) |
458
|
199 { |
1947
|
200 ColumnVector retval; |
|
201 |
5275
|
202 octave_idx_type nr = m.rows (); |
|
203 octave_idx_type nc = m.cols (); |
1947
|
204 |
5275
|
205 octave_idx_type a_len = a.length (); |
2386
|
206 |
|
207 if (nc != a_len) |
|
208 gripe_nonconformant ("operator *", nr, nc, a_len, 1); |
1947
|
209 else |
458
|
210 { |
1947
|
211 if (nr == 0 || nc == 0) |
|
212 retval.resize (nr, 0.0); |
|
213 else |
|
214 { |
5275
|
215 octave_idx_type ld = nr; |
1947
|
216 |
|
217 retval.resize (nr); |
|
218 double *y = retval.fortran_vec (); |
|
219 |
4552
|
220 F77_XFCN (dgemv, DGEMV, (F77_CONST_CHAR_ARG2 ("N", 1), |
|
221 nr, nc, 1.0, m.data (), ld, |
|
222 a.data (), 1, 0.0, y, 1 |
|
223 F77_CHAR_ARG_LEN (1))); |
1947
|
224 } |
458
|
225 } |
|
226 |
1947
|
227 return retval; |
458
|
228 } |
|
229 |
1205
|
230 // diagonal matrix by column vector -> column vector operations |
|
231 |
|
232 ColumnVector |
|
233 operator * (const DiagMatrix& m, const ColumnVector& a) |
458
|
234 { |
1947
|
235 ColumnVector retval; |
|
236 |
5275
|
237 octave_idx_type nr = m.rows (); |
|
238 octave_idx_type nc = m.cols (); |
1947
|
239 |
5275
|
240 octave_idx_type a_len = a.length (); |
1947
|
241 |
1205
|
242 if (nc != a_len) |
2386
|
243 gripe_nonconformant ("operator *", nr, nc, a_len, 1); |
1947
|
244 else |
458
|
245 { |
1947
|
246 if (nr == 0 || nc == 0) |
|
247 retval.resize (nr, 0.0); |
|
248 else |
|
249 { |
|
250 retval.resize (nr); |
|
251 |
5275
|
252 for (octave_idx_type i = 0; i < a_len; i++) |
1947
|
253 retval.elem (i) = a.elem (i) * m.elem (i, i); |
|
254 |
5275
|
255 for (octave_idx_type i = a_len; i < nr; i++) |
1947
|
256 retval.elem (i) = 0.0; |
|
257 } |
458
|
258 } |
|
259 |
1947
|
260 return retval; |
458
|
261 } |
|
262 |
|
263 // other operations |
|
264 |
|
265 ColumnVector |
2676
|
266 ColumnVector::map (d_d_Mapper f) const |
458
|
267 { |
2676
|
268 ColumnVector b (*this); |
|
269 return b.apply (f); |
458
|
270 } |
|
271 |
2676
|
272 ColumnVector& |
|
273 ColumnVector::apply (d_d_Mapper f) |
1205
|
274 { |
2676
|
275 double *d = fortran_vec (); // Ensures only one reference to my privates! |
1205
|
276 |
5275
|
277 for (octave_idx_type i = 0; i < length (); i++) |
2676
|
278 d[i] = f (d[i]); |
|
279 |
|
280 return *this; |
458
|
281 } |
|
282 |
|
283 double |
|
284 ColumnVector::min (void) const |
|
285 { |
5275
|
286 octave_idx_type len = length (); |
458
|
287 if (len == 0) |
|
288 return 0.0; |
|
289 |
|
290 double res = elem (0); |
|
291 |
5275
|
292 for (octave_idx_type i = 1; i < len; i++) |
458
|
293 if (elem (i) < res) |
|
294 res = elem (i); |
|
295 |
|
296 return res; |
|
297 } |
|
298 |
|
299 double |
|
300 ColumnVector::max (void) const |
|
301 { |
5275
|
302 octave_idx_type len = length (); |
458
|
303 if (len == 0) |
|
304 return 0.0; |
|
305 |
|
306 double res = elem (0); |
|
307 |
5275
|
308 for (octave_idx_type i = 1; i < len; i++) |
458
|
309 if (elem (i) > res) |
|
310 res = elem (i); |
|
311 |
|
312 return res; |
|
313 } |
|
314 |
3504
|
315 std::ostream& |
|
316 operator << (std::ostream& os, const ColumnVector& a) |
458
|
317 { |
|
318 // int field_width = os.precision () + 7; |
5275
|
319 for (octave_idx_type i = 0; i < a.length (); i++) |
458
|
320 os << /* setw (field_width) << */ a.elem (i) << "\n"; |
|
321 return os; |
|
322 } |
|
323 |
3504
|
324 std::istream& |
|
325 operator >> (std::istream& is, ColumnVector& a) |
458
|
326 { |
5275
|
327 octave_idx_type len = a.length(); |
458
|
328 |
|
329 if (len < 1) |
3504
|
330 is.clear (std::ios::badbit); |
458
|
331 else |
|
332 { |
|
333 double tmp; |
5275
|
334 for (octave_idx_type i = 0; i < len; i++) |
458
|
335 { |
|
336 is >> tmp; |
|
337 if (is) |
|
338 a.elem (i) = tmp; |
|
339 else |
|
340 break; |
|
341 } |
|
342 } |
532
|
343 return is; |
458
|
344 } |
|
345 |
|
346 /* |
|
347 ;;; Local Variables: *** |
|
348 ;;; mode: C++ *** |
|
349 ;;; End: *** |
|
350 */ |