|
1993
|
1 // Template array classes |
|
1988
|
2 /* |
|
|
3 |
|
|
4 Copyright (C) 1996 John W. Eaton |
|
|
5 |
|
|
6 This file is part of Octave. |
|
|
7 |
|
|
8 Octave is free software; you can redistribute it and/or modify it |
|
|
9 under the terms of the GNU General Public License as published by the |
|
|
10 Free Software Foundation; either version 2, or (at your option) any |
|
|
11 later version. |
|
|
12 |
|
|
13 Octave is distributed in the hope that it will be useful, but WITHOUT |
|
|
14 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
|
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
16 for more details. |
|
|
17 |
|
|
18 You should have received a copy of the GNU General Public License |
|
|
19 along with Octave; see the file COPYING. If not, write to the Free |
|
|
20 Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
|
|
21 |
|
|
22 */ |
|
|
23 |
|
|
24 #include "Array-flags.h" |
|
|
25 #include "idx-vector.h" |
|
|
26 #include "lo-error.h" |
|
|
27 |
|
|
28 template <class T> |
|
|
29 Array2<T> |
|
|
30 Array2<T>::value (void) |
|
|
31 { |
|
|
32 Array2<T> retval; |
|
|
33 |
|
|
34 int n_idx = index_count (); |
|
|
35 |
|
|
36 if (n_idx == 2) |
|
|
37 { |
|
|
38 idx_vector *tmp = get_idx (); |
|
|
39 idx_vector idx_i = tmp[0]; |
|
|
40 idx_vector idx_j = tmp[1]; |
|
|
41 |
|
2382
|
42 return index (idx_i, idx_j); |
|
1988
|
43 } |
|
|
44 else if (n_idx == 1) |
|
|
45 { |
|
2382
|
46 idx_vector *tmp = get_idx (); |
|
|
47 idx_vector idx = tmp[0]; |
|
1988
|
48 |
|
2382
|
49 return index (idx); |
|
1988
|
50 } |
|
|
51 else |
|
|
52 (*current_liboctave_error_handler) |
|
|
53 ("invalid number of indices for matrix expression"); |
|
|
54 |
|
|
55 clear_index (); |
|
|
56 |
|
|
57 return retval; |
|
|
58 } |
|
|
59 |
|
|
60 template <class T> |
|
2382
|
61 Array2<T> |
|
|
62 Array2<T>::index (idx_vector& idx) const |
|
|
63 { |
|
|
64 Array2<T> retval; |
|
|
65 |
|
|
66 int nr = d1; |
|
|
67 int nc = d2; |
|
|
68 |
|
|
69 if (nr == 1 && nc == 1) |
|
|
70 { |
|
|
71 Array<T> tmp = Array<T>::index (idx); |
|
|
72 |
|
|
73 int len = tmp.length (); |
|
|
74 |
|
|
75 if (len == 0) |
|
|
76 retval = Array2<T> (0, 0); |
|
|
77 else |
|
|
78 { |
|
|
79 if (liboctave_pcv_flag) |
|
|
80 retval = Array2<T> (tmp, len, 1); |
|
|
81 else |
|
|
82 retval = Array2<T> (tmp, 1, len); |
|
|
83 } |
|
|
84 } |
|
|
85 else if (nr == 1 || nc == 1) |
|
|
86 { |
|
|
87 int result_is_column_vector = (nc == 1); |
|
|
88 |
|
|
89 if (liboctave_dfi_flag && idx.is_colon ()) |
|
|
90 result_is_column_vector = 1; |
|
|
91 |
|
|
92 Array<T> tmp = Array<T>::index (idx); |
|
|
93 |
|
|
94 int len = tmp.length (); |
|
|
95 |
|
|
96 if (len == 0) |
|
|
97 retval = Array2<T> (0, 0); |
|
|
98 else |
|
|
99 { |
|
|
100 if (result_is_column_vector) |
|
|
101 retval = Array2<T> (tmp, len, 1); |
|
|
102 else |
|
|
103 retval = Array2<T> (tmp, 1, len); |
|
|
104 } |
|
|
105 } |
|
|
106 else if (liboctave_dfi_flag) |
|
|
107 { |
|
|
108 // This code is only for indexing matrices. The vector |
|
|
109 // cases are handled above. |
|
|
110 |
|
2830
|
111 idx.freeze (nr * nc, "matrix"); |
|
2382
|
112 |
|
|
113 if (idx) |
|
|
114 { |
|
|
115 int result_nr = idx.orig_rows (); |
|
|
116 int result_nc = idx.orig_columns (); |
|
|
117 |
|
|
118 if (idx.is_colon ()) |
|
|
119 { |
|
|
120 result_nr = nr * nc; |
|
|
121 result_nc = 1; |
|
|
122 } |
|
|
123 else if (idx.one_zero_only ()) |
|
|
124 { |
|
|
125 result_nr = idx.ones_count (); |
|
|
126 result_nc = (result_nr > 0 ? 1 : 0); |
|
|
127 } |
|
|
128 |
|
|
129 retval.resize (result_nr, result_nc); |
|
|
130 |
|
|
131 int k = 0; |
|
|
132 for (int j = 0; j < result_nc; j++) |
|
|
133 { |
|
|
134 for (int i = 0; i < result_nr; i++) |
|
|
135 { |
|
|
136 int ii = idx.elem (k++); |
|
|
137 int fr = ii % nr; |
|
|
138 int fc = (ii - fr) / nr; |
|
|
139 retval.elem (i, j) = elem (fr, fc); |
|
|
140 } |
|
|
141 } |
|
|
142 } |
|
|
143 // idx_vector::freeze() printed an error message for us. |
|
|
144 } |
|
|
145 else |
|
|
146 (*current_liboctave_error_handler) |
|
|
147 ("single index only valid for row or column vector"); |
|
|
148 |
|
|
149 return retval; |
|
|
150 } |
|
|
151 |
|
|
152 template <class T> |
|
|
153 Array2<T> |
|
|
154 Array2<T>::index (idx_vector& idx_i, idx_vector& idx_j) const |
|
|
155 { |
|
|
156 Array2<T> retval; |
|
|
157 |
|
|
158 int nr = d1; |
|
|
159 int nc = d2; |
|
|
160 |
|
2830
|
161 int n = idx_i.freeze (nr, "row"); |
|
|
162 int m = idx_j.freeze (nc, "column"); |
|
2382
|
163 |
|
|
164 if (idx_i && idx_j) |
|
|
165 { |
|
2663
|
166 if (idx_i.orig_empty () || idx_j.orig_empty ()) |
|
2382
|
167 { |
|
2663
|
168 retval.resize (n, m); |
|
|
169 } |
|
|
170 else if (n == 0) |
|
|
171 { |
|
2673
|
172 if (m == 0) |
|
2382
|
173 retval.resize (0, 0); |
|
2663
|
174 else if (idx_j.is_colon_equiv (nc, 1)) |
|
|
175 retval.resize (0, nc); |
|
2382
|
176 else |
|
2663
|
177 (*current_liboctave_error_handler) ("invalid row index = 0"); |
|
2382
|
178 } |
|
|
179 else if (m == 0) |
|
|
180 { |
|
2663
|
181 if (n == 0) |
|
2382
|
182 retval.resize (0, 0); |
|
2663
|
183 else if (idx_i.is_colon_equiv (nr, 1)) |
|
|
184 retval.resize (nr, 0); |
|
2382
|
185 else |
|
2663
|
186 (*current_liboctave_error_handler) ("invalid column index = 0"); |
|
2382
|
187 } |
|
|
188 else if (idx_i.is_colon_equiv (nr) && idx_j.is_colon_equiv (nc)) |
|
|
189 { |
|
|
190 retval = *this; |
|
|
191 } |
|
|
192 else |
|
|
193 { |
|
|
194 retval.resize (n, m); |
|
|
195 |
|
|
196 for (int j = 0; j < m; j++) |
|
|
197 { |
|
|
198 int jj = idx_j.elem (j); |
|
|
199 for (int i = 0; i < n; i++) |
|
|
200 { |
|
|
201 int ii = idx_i.elem (i); |
|
|
202 retval.elem (i, j) = elem (ii, jj); |
|
|
203 } |
|
|
204 } |
|
|
205 } |
|
|
206 } |
|
|
207 |
|
|
208 // idx_vector::freeze() printed an error message for us. |
|
|
209 |
|
|
210 return retval; |
|
|
211 } |
|
|
212 |
|
|
213 template <class T> |
|
1988
|
214 void |
|
|
215 Array2<T>::maybe_delete_elements (idx_vector& idx_i, idx_vector& idx_j) |
|
|
216 { |
|
|
217 int nr = d1; |
|
|
218 int nc = d2; |
|
|
219 |
|
|
220 if (nr == 0 && nc == 0) |
|
|
221 return; |
|
|
222 |
|
|
223 if (idx_i.is_colon_equiv (nr, 1)) |
|
|
224 { |
|
|
225 if (idx_j.is_colon_equiv (nc, 1)) |
|
|
226 resize (0, 0); |
|
|
227 else |
|
|
228 { |
|
|
229 int num_to_delete = idx_j.length (nc); |
|
|
230 |
|
|
231 if (num_to_delete != 0) |
|
|
232 { |
|
|
233 if (nr == 1 && num_to_delete == nc) |
|
|
234 resize (0, 0); |
|
|
235 else |
|
|
236 { |
|
2245
|
237 int new_nc = nc; |
|
|
238 |
|
|
239 int idx = 0; |
|
|
240 |
|
|
241 for (int j = 0; j < nc; j++) |
|
|
242 if (j == idx_j.elem (idx)) |
|
|
243 { |
|
|
244 idx++; |
|
|
245 new_nc--; |
|
|
246 } |
|
|
247 |
|
1988
|
248 if (new_nc > 0) |
|
|
249 { |
|
|
250 T *new_data = new T [nr * new_nc]; |
|
|
251 |
|
|
252 int jj = 0; |
|
2245
|
253 idx = 0; |
|
1988
|
254 for (int j = 0; j < nc; j++) |
|
|
255 { |
|
|
256 if (j == idx_j.elem (idx)) |
|
|
257 idx++; |
|
|
258 else |
|
|
259 { |
|
|
260 for (int i = 0; i < nr; i++) |
|
|
261 new_data[nr*jj+i] = elem (i, j); |
|
|
262 jj++; |
|
|
263 } |
|
|
264 } |
|
|
265 |
|
|
266 if (--rep->count <= 0) |
|
|
267 delete rep; |
|
|
268 |
|
|
269 rep = new ArrayRep (new_data, nr * new_nc); |
|
|
270 |
|
|
271 d2 = new_nc; |
|
|
272 |
|
|
273 set_max_indices (2); |
|
|
274 } |
|
|
275 else |
|
|
276 (*current_liboctave_error_handler) |
|
|
277 ("A(idx) = []: index out of range"); |
|
|
278 } |
|
|
279 } |
|
|
280 } |
|
|
281 } |
|
2714
|
282 else if (idx_j.is_colon_equiv (nc, 1)) |
|
1988
|
283 { |
|
2714
|
284 if (idx_i.is_colon_equiv (nr, 1)) |
|
1988
|
285 resize (0, 0); |
|
|
286 else |
|
|
287 { |
|
|
288 int num_to_delete = idx_i.length (nr); |
|
|
289 |
|
|
290 if (num_to_delete != 0) |
|
|
291 { |
|
|
292 if (nc == 1 && num_to_delete == nr) |
|
|
293 resize (0, 0); |
|
|
294 else |
|
|
295 { |
|
2245
|
296 int new_nr = nr; |
|
|
297 |
|
|
298 int idx = 0; |
|
|
299 |
|
|
300 for (int i = 0; i < nr; i++) |
|
|
301 if (i == idx_i.elem (idx)) |
|
|
302 { |
|
|
303 idx++; |
|
|
304 new_nr--; |
|
|
305 } |
|
|
306 |
|
1988
|
307 if (new_nr > 0) |
|
|
308 { |
|
|
309 T *new_data = new T [new_nr * nc]; |
|
|
310 |
|
|
311 int ii = 0; |
|
2245
|
312 idx = 0; |
|
1988
|
313 for (int i = 0; i < nr; i++) |
|
|
314 { |
|
|
315 if (i == idx_i.elem (idx)) |
|
|
316 idx++; |
|
|
317 else |
|
|
318 { |
|
|
319 for (int j = 0; j < nc; j++) |
|
|
320 new_data[new_nr*j+ii] = elem (i, j); |
|
|
321 ii++; |
|
|
322 } |
|
|
323 } |
|
|
324 |
|
|
325 if (--rep->count <= 0) |
|
|
326 delete rep; |
|
|
327 |
|
|
328 rep = new ArrayRep (new_data, new_nr * nc); |
|
|
329 |
|
|
330 d1 = new_nr; |
|
|
331 |
|
|
332 set_max_indices (2); |
|
|
333 } |
|
|
334 else |
|
|
335 (*current_liboctave_error_handler) |
|
|
336 ("A(idx) = []: index out of range"); |
|
|
337 } |
|
|
338 } |
|
|
339 } |
|
|
340 } |
|
|
341 } |
|
|
342 |
|
2589
|
343 #define MAYBE_RESIZE_LHS \ |
|
|
344 do \ |
|
|
345 { \ |
|
|
346 if (liboctave_rre_flag) \ |
|
|
347 { \ |
|
|
348 int max_row_idx = idx_i_is_colon ? rhs_nr : idx_i.max () + 1; \ |
|
|
349 int max_col_idx = idx_j_is_colon ? rhs_nc : idx_j.max () + 1; \ |
|
|
350 \ |
|
|
351 int new_nr = max_row_idx > lhs_nr ? max_row_idx : lhs_nr; \ |
|
|
352 int new_nc = max_col_idx > lhs_nc ? max_col_idx : lhs_nc; \ |
|
|
353 \ |
|
|
354 lhs.resize (new_nr, new_nc, 0.0); \ |
|
|
355 } \ |
|
|
356 } \ |
|
|
357 while (0) |
|
|
358 |
|
1988
|
359 template <class LT, class RT> |
|
|
360 int |
|
|
361 assign (Array2<LT>& lhs, const Array2<RT>& rhs) |
|
|
362 { |
|
|
363 int retval = 1; |
|
|
364 |
|
|
365 int n_idx = lhs.index_count (); |
|
|
366 |
|
|
367 int lhs_nr = lhs.rows (); |
|
|
368 int lhs_nc = lhs.cols (); |
|
|
369 |
|
|
370 int rhs_nr = rhs.rows (); |
|
|
371 int rhs_nc = rhs.cols (); |
|
|
372 |
|
|
373 if (n_idx == 2) |
|
|
374 { |
|
|
375 idx_vector *tmp = lhs.get_idx (); |
|
|
376 |
|
|
377 idx_vector idx_i = tmp[0]; |
|
|
378 idx_vector idx_j = tmp[1]; |
|
|
379 |
|
2830
|
380 int n = idx_i.freeze (lhs_nr, "row", liboctave_rre_flag); |
|
1988
|
381 |
|
2830
|
382 int m = idx_j.freeze (lhs_nc, "column", liboctave_rre_flag); |
|
1988
|
383 |
|
|
384 int idx_i_is_colon = idx_i.is_colon (); |
|
|
385 int idx_j_is_colon = idx_j.is_colon (); |
|
|
386 |
|
|
387 if (idx_i_is_colon) |
|
2575
|
388 n = lhs_nr > 0 ? lhs_nr : rhs_nr; |
|
1988
|
389 |
|
|
390 if (idx_j_is_colon) |
|
2575
|
391 m = lhs_nc > 0 ? lhs_nc : rhs_nc; |
|
1988
|
392 |
|
|
393 if (idx_i && idx_j) |
|
|
394 { |
|
|
395 if (rhs_nr == 0 && rhs_nc == 0) |
|
|
396 { |
|
|
397 lhs.maybe_delete_elements (idx_i, idx_j); |
|
|
398 } |
|
|
399 else |
|
|
400 { |
|
2570
|
401 if (rhs_nr == 1 && rhs_nc == 1 && n > 0 && m > 0) |
|
1988
|
402 { |
|
2589
|
403 MAYBE_RESIZE_LHS; |
|
|
404 |
|
1988
|
405 RT scalar = rhs.elem (0, 0); |
|
|
406 |
|
|
407 for (int j = 0; j < m; j++) |
|
|
408 { |
|
|
409 int jj = idx_j.elem (j); |
|
|
410 for (int i = 0; i < n; i++) |
|
|
411 { |
|
|
412 int ii = idx_i.elem (i); |
|
|
413 lhs.elem (ii, jj) = scalar; |
|
|
414 } |
|
|
415 } |
|
|
416 } |
|
2570
|
417 else if (n == rhs_nr && m == rhs_nc) |
|
|
418 { |
|
2589
|
419 MAYBE_RESIZE_LHS; |
|
|
420 |
|
2570
|
421 for (int j = 0; j < m; j++) |
|
|
422 { |
|
|
423 int jj = idx_j.elem (j); |
|
|
424 for (int i = 0; i < n; i++) |
|
|
425 { |
|
|
426 int ii = idx_i.elem (i); |
|
|
427 lhs.elem (ii, jj) = rhs.elem (i, j); |
|
|
428 } |
|
|
429 } |
|
|
430 } |
|
1988
|
431 else |
|
|
432 { |
|
|
433 (*current_liboctave_error_handler) |
|
|
434 ("A(I, J) = X: X must be a scalar or the number of elements in I must"); |
|
|
435 (*current_liboctave_error_handler) |
|
|
436 ("match the number of rows in X and the number of elements in J must"); |
|
|
437 (*current_liboctave_error_handler) |
|
|
438 ("match the number of columns in X"); |
|
|
439 |
|
|
440 retval = 0; |
|
|
441 } |
|
|
442 } |
|
|
443 } |
|
|
444 // idx_vector::freeze() printed an error message for us. |
|
|
445 } |
|
|
446 else if (n_idx == 1) |
|
|
447 { |
|
2112
|
448 int lhs_is_empty = lhs_nr == 0 || lhs_nc == 0; |
|
|
449 |
|
|
450 if (lhs_is_empty || (lhs_nr == 1 && lhs_nc == 1)) |
|
1988
|
451 { |
|
|
452 idx_vector *tmp = lhs.get_idx (); |
|
|
453 |
|
|
454 idx_vector idx = tmp[0]; |
|
|
455 |
|
|
456 int lhs_len = lhs.length (); |
|
|
457 |
|
2830
|
458 int n = idx.freeze (lhs_len, 0, liboctave_rre_flag); |
|
1988
|
459 |
|
|
460 if (idx) |
|
|
461 { |
|
|
462 if (rhs_nr == 0 && rhs_nc == 0) |
|
|
463 { |
|
|
464 if (n != 0 && (lhs_nr != 0 || lhs_nc != 0)) |
|
|
465 { |
|
|
466 idx_vector tmp (':'); |
|
|
467 lhs.maybe_delete_elements (idx, tmp); |
|
|
468 } |
|
|
469 } |
|
2112
|
470 else if (! liboctave_dfi_flag && lhs_is_empty |
|
|
471 && idx.is_colon () |
|
|
472 && ! (rhs_nr == 1 || rhs_nc == 1)) |
|
|
473 { |
|
|
474 (*current_liboctave_error_handler) |
|
|
475 ("A(:) = X: X must be a vector"); |
|
|
476 } |
|
1988
|
477 else |
|
|
478 { |
|
|
479 if (assign ((Array<LT>&) lhs, (Array<RT>&) rhs)) |
|
|
480 { |
|
|
481 int len = lhs.length (); |
|
|
482 |
|
|
483 if (len > 0) |
|
|
484 { |
|
|
485 int idx_nr = idx.orig_rows (); |
|
|
486 int idx_nc = idx.orig_columns (); |
|
|
487 |
|
2112
|
488 // lhs_is_empty now means that lhs was |
|
|
489 // *originally* empty. |
|
|
490 |
|
1988
|
491 if (liboctave_dfi_flag |
|
|
492 || (idx_nr == 1 && idx_nc == 1)) |
|
|
493 { |
|
|
494 if (liboctave_pcv_flag) |
|
|
495 { |
|
|
496 lhs.d1 = lhs.length (); |
|
|
497 lhs.d2 = 1; |
|
|
498 } |
|
|
499 else |
|
|
500 { |
|
|
501 lhs.d1 = 1; |
|
|
502 lhs.d2 = lhs.length (); |
|
|
503 } |
|
|
504 } |
|
2112
|
505 else if (lhs_is_empty && idx.is_colon ()) |
|
|
506 { |
|
|
507 lhs.d1 = rhs.d1; |
|
|
508 lhs.d2 = rhs.d2; |
|
|
509 } |
|
1988
|
510 else if (idx_nr == 1 && rhs_nr == 1) |
|
|
511 { |
|
|
512 lhs.d1 = 1; |
|
|
513 lhs.d2 = lhs.length (); |
|
|
514 } |
|
|
515 else if (idx_nc == 1 && rhs_nc == 1) |
|
|
516 { |
|
|
517 lhs.d1 = lhs.length (); |
|
|
518 lhs.d2 = 1; |
|
|
519 } |
|
|
520 else |
|
|
521 (*current_liboctave_error_handler) |
|
|
522 ("A(I) = X: X must be a scalar or a matrix with the same size as I"); |
|
|
523 } |
|
|
524 else |
|
|
525 { |
|
|
526 lhs.d1 = 0; |
|
|
527 lhs.d2 = 0; |
|
|
528 } |
|
|
529 } |
|
|
530 else |
|
|
531 retval = 0; |
|
|
532 } |
|
|
533 } |
|
|
534 // idx_vector::freeze() printed an error message for us. |
|
|
535 } |
|
|
536 else if (lhs_nr == 1) |
|
|
537 { |
|
|
538 idx_vector *tmp = lhs.get_idx (); |
|
|
539 |
|
|
540 idx_vector idx = tmp[0]; |
|
|
541 |
|
2830
|
542 idx.freeze (lhs_nc, "vector", liboctave_rre_flag); |
|
1988
|
543 |
|
|
544 if (idx) |
|
|
545 { |
|
|
546 if (rhs_nr == 0 && rhs_nc == 0) |
|
|
547 { |
|
|
548 idx_vector tmp (':'); |
|
|
549 lhs.maybe_delete_elements (tmp, idx); |
|
|
550 } |
|
|
551 else |
|
|
552 { |
|
|
553 if (assign ((Array<LT>&) lhs, (Array<RT>&) rhs)) |
|
|
554 lhs.d2 = lhs.length (); |
|
|
555 else |
|
|
556 retval = 0; |
|
|
557 } |
|
|
558 } |
|
|
559 // idx_vector::freeze() printed an error message for us. |
|
|
560 } |
|
|
561 else if (lhs_nc == 1) |
|
|
562 { |
|
|
563 idx_vector *tmp = lhs.get_idx (); |
|
|
564 |
|
|
565 idx_vector idx = tmp[0]; |
|
|
566 |
|
2830
|
567 idx.freeze (lhs_nr, "vector", liboctave_rre_flag); |
|
1988
|
568 |
|
|
569 if (idx) |
|
|
570 { |
|
|
571 if (rhs_nr == 0 && rhs_nc == 0) |
|
|
572 { |
|
|
573 idx_vector tmp (':'); |
|
|
574 lhs.maybe_delete_elements (idx, tmp); |
|
|
575 } |
|
|
576 else |
|
|
577 { |
|
|
578 if (assign ((Array<LT>&) lhs, (Array<RT>&) rhs)) |
|
|
579 lhs.d1 = lhs.length (); |
|
|
580 else |
|
|
581 retval = 0; |
|
|
582 } |
|
|
583 } |
|
|
584 // idx_vector::freeze() printed an error message for us. |
|
|
585 } |
|
|
586 else if (liboctave_dfi_flag) |
|
|
587 { |
|
|
588 idx_vector *tmp = lhs.get_idx (); |
|
|
589 idx_vector idx = tmp[0]; |
|
|
590 |
|
2830
|
591 int len = idx.freeze (lhs_nr * lhs_nc, "matrix"); |
|
1988
|
592 |
|
|
593 if (idx) |
|
|
594 { |
|
|
595 if (len == rhs_nr * rhs_nc) |
|
|
596 { |
|
|
597 int k = 0; |
|
|
598 for (int j = 0; j < rhs_nc; j++) |
|
|
599 { |
|
|
600 for (int i = 0; i < rhs_nr; i++) |
|
|
601 { |
|
|
602 int ii = idx.elem (k++); |
|
|
603 int fr = ii % lhs_nr; |
|
|
604 int fc = (ii - fr) / lhs_nr; |
|
|
605 lhs.elem (fr, fc) = rhs.elem (i, j); |
|
|
606 } |
|
|
607 } |
|
|
608 } |
|
|
609 else |
|
|
610 { |
|
|
611 (*current_liboctave_error_handler) |
|
|
612 ("A(I) = X: X must be a scalar or a matrix with the same size as I"); |
|
|
613 |
|
|
614 retval = 0; |
|
|
615 } |
|
|
616 } |
|
|
617 // idx_vector::freeze() printed an error message for us. |
|
|
618 } |
|
|
619 else |
|
|
620 { |
|
|
621 (*current_liboctave_error_handler) |
|
|
622 ("single index only valid for row or column vector"); |
|
|
623 |
|
|
624 retval = 0; |
|
|
625 } |
|
|
626 } |
|
|
627 else |
|
|
628 { |
|
|
629 (*current_liboctave_error_handler) |
|
|
630 ("invalid number of indices for matrix expression"); |
|
|
631 |
|
|
632 retval = 0; |
|
|
633 } |
|
|
634 |
|
|
635 lhs.clear_index (); |
|
|
636 |
|
|
637 return retval; |
|
|
638 } |
|
|
639 |
|
|
640 /* |
|
|
641 ;;; Local Variables: *** |
|
|
642 ;;; mode: C++ *** |
|
|
643 ;;; End: *** |
|
|
644 */ |
