Mercurial > hg > octave-nkf
annotate liboctave/Array.cc @ 7793:96ba591be50f
Add some more support for single precision to libcruft functions
| author | David Bateman <dbateman@free.fr> |
|---|---|
| date | Sun, 11 May 2008 22:51:50 +0200 |
| parents | 82be108cc558 |
| children | 762801c50b21 |
| rev | line source |
|---|---|
| 1993 | 1 // Template array classes |
| 237 | 2 /* |
| 3 | |
| 7017 | 4 Copyright (C) 1993, 1994, 1995, 1996, 1997, 2000, 2002, 2003, 2004, |
| 5 2005, 2006, 2007 John W. Eaton | |
| 237 | 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. | |
| 237 | 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/>. | |
| 237 | 22 |
| 23 */ | |
| 24 | |
| 25 #ifdef HAVE_CONFIG_H | |
| 1192 | 26 #include <config.h> |
| 237 | 27 #endif |
| 28 | |
| 1367 | 29 #include <cassert> |
| 4518 | 30 #include <climits> |
| 449 | 31 |
| 3503 | 32 #include <iostream> |
| 5765 | 33 #include <sstream> |
| 5607 | 34 #include <vector> |
| 6674 | 35 #include <new> |
| 1560 | 36 |
| 237 | 37 #include "Array.h" |
| 4588 | 38 #include "Array-util.h" |
| 1560 | 39 #include "idx-vector.h" |
| 40 #include "lo-error.h" | |
| 41 | |
| 1360 | 42 // One dimensional array class. Handles the reference counting for |
| 43 // all the derived classes. | |
| 237 | 44 |
| 45 template <class T> | |
| 4834 | 46 Array<T>::Array (const Array<T>& a, const dim_vector& dv) |
| 47 : rep (a.rep), dimensions (dv), idx (0), idx_count (0) | |
| 48 { | |
| 49 rep->count++; | |
| 50 | |
| 51 if (a.numel () < dv.numel ()) | |
| 52 (*current_liboctave_error_handler) | |
| 53 ("Array::Array (const Array&, const dim_vector&): dimension mismatch"); | |
| 54 } | |
| 55 | |
| 56 template <class T> | |
| 1619 | 57 Array<T>::~Array (void) |
| 58 { | |
| 59 if (--rep->count <= 0) | |
| 60 delete rep; | |
| 61 | |
| 62 delete [] idx; | |
| 4513 | 63 } |
| 64 | |
| 4532 | 65 template <class T> |
|
7717
ff918ee1a983
Delete idx in Sparse<T> and Array<T> operator =
David Bateman <dbateman@free.fr>
parents:
7646
diff
changeset
|
66 Array<T>& |
|
ff918ee1a983
Delete idx in Sparse<T> and Array<T> operator =
David Bateman <dbateman@free.fr>
parents:
7646
diff
changeset
|
67 Array<T>::operator = (const Array<T>& a) |
|
ff918ee1a983
Delete idx in Sparse<T> and Array<T> operator =
David Bateman <dbateman@free.fr>
parents:
7646
diff
changeset
|
68 { |
|
ff918ee1a983
Delete idx in Sparse<T> and Array<T> operator =
David Bateman <dbateman@free.fr>
parents:
7646
diff
changeset
|
69 if (this != &a) |
|
ff918ee1a983
Delete idx in Sparse<T> and Array<T> operator =
David Bateman <dbateman@free.fr>
parents:
7646
diff
changeset
|
70 { |
|
ff918ee1a983
Delete idx in Sparse<T> and Array<T> operator =
David Bateman <dbateman@free.fr>
parents:
7646
diff
changeset
|
71 if (--rep->count <= 0) |
|
ff918ee1a983
Delete idx in Sparse<T> and Array<T> operator =
David Bateman <dbateman@free.fr>
parents:
7646
diff
changeset
|
72 delete rep; |
|
ff918ee1a983
Delete idx in Sparse<T> and Array<T> operator =
David Bateman <dbateman@free.fr>
parents:
7646
diff
changeset
|
73 |
|
ff918ee1a983
Delete idx in Sparse<T> and Array<T> operator =
David Bateman <dbateman@free.fr>
parents:
7646
diff
changeset
|
74 rep = a.rep; |
|
ff918ee1a983
Delete idx in Sparse<T> and Array<T> operator =
David Bateman <dbateman@free.fr>
parents:
7646
diff
changeset
|
75 rep->count++; |
|
ff918ee1a983
Delete idx in Sparse<T> and Array<T> operator =
David Bateman <dbateman@free.fr>
parents:
7646
diff
changeset
|
76 |
|
ff918ee1a983
Delete idx in Sparse<T> and Array<T> operator =
David Bateman <dbateman@free.fr>
parents:
7646
diff
changeset
|
77 dimensions = a.dimensions; |
|
ff918ee1a983
Delete idx in Sparse<T> and Array<T> operator =
David Bateman <dbateman@free.fr>
parents:
7646
diff
changeset
|
78 |
|
ff918ee1a983
Delete idx in Sparse<T> and Array<T> operator =
David Bateman <dbateman@free.fr>
parents:
7646
diff
changeset
|
79 delete [] idx; |
|
ff918ee1a983
Delete idx in Sparse<T> and Array<T> operator =
David Bateman <dbateman@free.fr>
parents:
7646
diff
changeset
|
80 idx_count = 0; |
|
ff918ee1a983
Delete idx in Sparse<T> and Array<T> operator =
David Bateman <dbateman@free.fr>
parents:
7646
diff
changeset
|
81 idx = 0; |
|
ff918ee1a983
Delete idx in Sparse<T> and Array<T> operator =
David Bateman <dbateman@free.fr>
parents:
7646
diff
changeset
|
82 } |
|
ff918ee1a983
Delete idx in Sparse<T> and Array<T> operator =
David Bateman <dbateman@free.fr>
parents:
7646
diff
changeset
|
83 |
|
ff918ee1a983
Delete idx in Sparse<T> and Array<T> operator =
David Bateman <dbateman@free.fr>
parents:
7646
diff
changeset
|
84 return *this; |
|
ff918ee1a983
Delete idx in Sparse<T> and Array<T> operator =
David Bateman <dbateman@free.fr>
parents:
7646
diff
changeset
|
85 } |
|
ff918ee1a983
Delete idx in Sparse<T> and Array<T> operator =
David Bateman <dbateman@free.fr>
parents:
7646
diff
changeset
|
86 |
|
ff918ee1a983
Delete idx in Sparse<T> and Array<T> operator =
David Bateman <dbateman@free.fr>
parents:
7646
diff
changeset
|
87 template <class T> |
| 4532 | 88 Array<T> |
| 89 Array<T>::squeeze (void) const | |
| 90 { | |
| 91 Array<T> retval = *this; | |
| 92 | |
| 4929 | 93 if (ndims () > 2) |
| 4532 | 94 { |
| 4929 | 95 bool dims_changed = false; |
| 96 | |
| 97 dim_vector new_dimensions = dimensions; | |
| 98 | |
| 99 int k = 0; | |
| 100 | |
| 101 for (int i = 0; i < ndims (); i++) | |
| 4759 | 102 { |
| 4929 | 103 if (dimensions(i) == 1) |
| 104 dims_changed = true; | |
| 105 else | |
| 106 new_dimensions(k++) = dimensions(i); | |
| 107 } | |
| 108 | |
| 109 if (dims_changed) | |
| 110 { | |
| 111 switch (k) | |
| 112 { | |
| 113 case 0: | |
| 114 new_dimensions = dim_vector (1, 1); | |
| 115 break; | |
| 116 | |
| 117 case 1: | |
| 4759 | 118 { |
| 5275 | 119 octave_idx_type tmp = new_dimensions(0); |
| 4929 | 120 |
| 121 new_dimensions.resize (2); | |
| 122 | |
| 4759 | 123 new_dimensions(0) = tmp; |
| 124 new_dimensions(1) = 1; | |
| 125 } | |
| 4929 | 126 break; |
| 127 | |
| 128 default: | |
| 129 new_dimensions.resize (k); | |
| 130 break; | |
| 131 } | |
| 4759 | 132 } |
| 4532 | 133 |
| 5775 | 134 // FIXME -- it would be better if we did not have to do |
| 5047 | 135 // this, so we could share the data while still having different |
| 136 // dimension vectors. | |
| 137 | |
| 4532 | 138 retval.make_unique (); |
| 139 | |
| 140 retval.dimensions = new_dimensions; | |
| 141 } | |
| 142 | |
| 143 return retval; | |
| 144 } | |
| 145 | |
| 6674 | 146 // KLUGE |
| 147 | |
| 148 // The following get_size functions will throw a std::bad_alloc () | |
| 149 // exception if the requested size is larger than can be indexed by | |
| 150 // octave_idx_type. This may be smaller than the actual amount of | |
| 151 // memory that can be safely allocated on a system. However, if we | |
| 152 // don't fail here, we can end up with a mysterious crash inside a | |
| 153 // function that is iterating over an array using octave_idx_type | |
| 154 // indices. | |
| 155 | |
| 4513 | 156 // A guess (should be quite conservative). |
| 157 #define MALLOC_OVERHEAD 1024 | |
| 158 | |
| 159 template <class T> | |
| 5275 | 160 octave_idx_type |
| 161 Array<T>::get_size (octave_idx_type r, octave_idx_type c) | |
| 4513 | 162 { |
| 163 static int nl; | |
| 164 static double dl | |
| 5275 | 165 = frexp (static_cast<double> |
| 166 (std::numeric_limits<octave_idx_type>::max() - MALLOC_OVERHEAD) / sizeof (T), &nl); | |
| 4513 | 167 |
| 168 int nr, nc; | |
| 5275 | 169 double dr = frexp (static_cast<double> (r), &nr); // r = dr * 2^nr |
| 170 double dc = frexp (static_cast<double> (c), &nc); // c = dc * 2^nc | |
| 4513 | 171 |
| 172 int nt = nr + nc; | |
| 173 double dt = dr * dc; | |
| 174 | |
| 4532 | 175 if (dt < 0.5) |
| 4513 | 176 { |
| 177 nt--; | |
| 178 dt *= 2; | |
| 179 } | |
| 180 | |
| 6674 | 181 if (nt < nl || (nt == nl && dt < dl)) |
| 182 return r * c; | |
| 183 else | |
| 184 { | |
| 185 throw std::bad_alloc (); | |
| 186 return 0; | |
| 187 } | |
| 237 | 188 } |
| 189 | |
| 190 template <class T> | |
| 5275 | 191 octave_idx_type |
| 192 Array<T>::get_size (octave_idx_type r, octave_idx_type c, octave_idx_type p) | |
| 237 | 193 { |
| 4513 | 194 static int nl; |
| 195 static double dl | |
| 196 = frexp (static_cast<double> | |
| 5275 | 197 (std::numeric_limits<octave_idx_type>::max() - MALLOC_OVERHEAD) / sizeof (T), &nl); |
| 4513 | 198 |
| 199 int nr, nc, np; | |
| 200 double dr = frexp (static_cast<double> (r), &nr); | |
| 201 double dc = frexp (static_cast<double> (c), &nc); | |
| 202 double dp = frexp (static_cast<double> (p), &np); | |
| 203 | |
| 204 int nt = nr + nc + np; | |
| 205 double dt = dr * dc * dp; | |
| 206 | |
| 4532 | 207 if (dt < 0.5) |
| 659 | 208 { |
| 4513 | 209 nt--; |
| 210 dt *= 2; | |
| 237 | 211 |
| 4532 | 212 if (dt < 0.5) |
| 213 { | |
| 214 nt--; | |
| 215 dt *= 2; | |
| 216 } | |
| 659 | 217 } |
| 1619 | 218 |
| 6674 | 219 if (nt < nl || (nt == nl && dt < dl)) |
| 220 return r * c * p; | |
| 221 else | |
| 222 { | |
| 223 throw std::bad_alloc (); | |
| 224 return 0; | |
| 225 } | |
| 237 | 226 } |
| 227 | |
| 228 template <class T> | |
| 5275 | 229 octave_idx_type |
| 4513 | 230 Array<T>::get_size (const dim_vector& ra_idx) |
| 237 | 231 { |
| 4513 | 232 static int nl; |
| 233 static double dl | |
| 234 = frexp (static_cast<double> | |
| 5275 | 235 (std::numeric_limits<octave_idx_type>::max() - MALLOC_OVERHEAD) / sizeof (T), &nl); |
| 4513 | 236 |
| 237 int n = ra_idx.length (); | |
| 238 | |
| 239 int nt = 0; | |
| 240 double dt = 1; | |
| 241 | |
| 242 for (int i = 0; i < n; i++) | |
| 237 | 243 { |
| 4513 | 244 int nra_idx; |
| 245 double dra_idx = frexp (static_cast<double> (ra_idx(i)), &nra_idx); | |
| 246 | |
| 247 nt += nra_idx; | |
| 248 dt *= dra_idx; | |
| 4532 | 249 |
| 250 if (dt < 0.5) | |
| 251 { | |
| 252 nt--; | |
| 253 dt *= 2; | |
| 254 } | |
| 237 | 255 } |
| 256 | |
| 4513 | 257 if (nt < nl || (nt == nl && dt < dl)) |
| 258 { | |
| 6674 | 259 octave_idx_type retval = 1; |
| 4513 | 260 |
| 261 for (int i = 0; i < n; i++) | |
| 262 retval *= ra_idx(i); | |
| 6674 | 263 |
| 264 return retval; | |
| 4513 | 265 } |
| 6674 | 266 else |
| 267 { | |
| 268 throw std::bad_alloc (); | |
| 269 return 0; | |
| 270 } | |
| 237 | 271 } |
| 272 | |
| 4513 | 273 #undef MALLOC_OVERHEAD |
| 274 | |
| 237 | 275 template <class T> |
| 5275 | 276 octave_idx_type |
| 277 Array<T>::compute_index (const Array<octave_idx_type>& ra_idx) const | |
| 237 | 278 { |
| 5275 | 279 octave_idx_type retval = -1; |
| 4513 | 280 |
| 281 int n = dimensions.length (); | |
| 282 | |
| 283 if (n > 0 && n == ra_idx.length ()) | |
| 237 | 284 { |
| 4513 | 285 retval = ra_idx(--n); |
| 237 | 286 |
| 4513 | 287 while (--n >= 0) |
| 288 { | |
| 289 retval *= dimensions(n); | |
| 290 retval += ra_idx(n); | |
| 291 } | |
| 292 } | |
| 293 else | |
| 294 (*current_liboctave_error_handler) | |
| 295 ("Array<T>::compute_index: invalid ra_idxing operation"); | |
| 237 | 296 |
| 4513 | 297 return retval; |
| 237 | 298 } |
| 299 | |
| 2049 | 300 template <class T> |
| 301 T | |
| 5275 | 302 Array<T>::range_error (const char *fcn, octave_idx_type n) const |
| 2049 | 303 { |
| 2109 | 304 (*current_liboctave_error_handler) ("%s (%d): range error", fcn, n); |
| 2049 | 305 return T (); |
| 306 } | |
| 307 | |
| 308 template <class T> | |
| 309 T& | |
| 5275 | 310 Array<T>::range_error (const char *fcn, octave_idx_type n) |
| 2049 | 311 { |
| 2109 | 312 (*current_liboctave_error_handler) ("%s (%d): range error", fcn, n); |
| 2049 | 313 static T foo; |
| 314 return foo; | |
| 315 } | |
| 316 | |
| 3933 | 317 template <class T> |
| 4513 | 318 T |
| 5275 | 319 Array<T>::range_error (const char *fcn, octave_idx_type i, octave_idx_type j) const |
| 4513 | 320 { |
| 321 (*current_liboctave_error_handler) | |
| 322 ("%s (%d, %d): range error", fcn, i, j); | |
| 323 return T (); | |
| 324 } | |
| 325 | |
| 326 template <class T> | |
| 327 T& | |
| 5275 | 328 Array<T>::range_error (const char *fcn, octave_idx_type i, octave_idx_type j) |
| 4513 | 329 { |
| 330 (*current_liboctave_error_handler) | |
| 331 ("%s (%d, %d): range error", fcn, i, j); | |
| 332 static T foo; | |
| 333 return foo; | |
| 334 } | |
| 335 | |
| 336 template <class T> | |
| 337 T | |
| 5275 | 338 Array<T>::range_error (const char *fcn, octave_idx_type i, octave_idx_type j, octave_idx_type k) const |
| 4513 | 339 { |
| 340 (*current_liboctave_error_handler) | |
| 341 ("%s (%d, %d, %d): range error", fcn, i, j, k); | |
| 342 return T (); | |
| 343 } | |
| 344 | |
| 345 template <class T> | |
| 346 T& | |
| 5275 | 347 Array<T>::range_error (const char *fcn, octave_idx_type i, octave_idx_type j, octave_idx_type k) |
| 4513 | 348 { |
| 349 (*current_liboctave_error_handler) | |
| 350 ("%s (%d, %d, %d): range error", fcn, i, j, k); | |
| 351 static T foo; | |
| 352 return foo; | |
| 353 } | |
| 354 | |
| 355 template <class T> | |
| 356 T | |
| 6867 | 357 Array<T>::range_error (const char *fcn, const Array<octave_idx_type>& ra_idx) const |
| 4513 | 358 { |
| 5765 | 359 std::ostringstream buf; |
| 4661 | 360 |
| 361 buf << fcn << " ("; | |
| 362 | |
| 5275 | 363 octave_idx_type n = ra_idx.length (); |
| 4661 | 364 |
| 365 if (n > 0) | |
| 366 buf << ra_idx(0); | |
| 367 | |
| 5275 | 368 for (octave_idx_type i = 1; i < n; i++) |
| 4661 | 369 buf << ", " << ra_idx(i); |
| 370 | |
| 371 buf << "): range error"; | |
| 372 | |
| 5765 | 373 std::string buf_str = buf.str (); |
| 374 | |
| 375 (*current_liboctave_error_handler) (buf_str.c_str ()); | |
| 4513 | 376 |
| 377 return T (); | |
| 378 } | |
| 379 | |
| 380 template <class T> | |
| 381 T& | |
| 6867 | 382 Array<T>::range_error (const char *fcn, const Array<octave_idx_type>& ra_idx) |
| 4513 | 383 { |
| 5765 | 384 std::ostringstream buf; |
| 4661 | 385 |
| 386 buf << fcn << " ("; | |
| 387 | |
| 5275 | 388 octave_idx_type n = ra_idx.length (); |
| 4661 | 389 |
| 390 if (n > 0) | |
| 391 buf << ra_idx(0); | |
| 392 | |
| 5275 | 393 for (octave_idx_type i = 1; i < n; i++) |
| 4661 | 394 buf << ", " << ra_idx(i); |
| 395 | |
| 396 buf << "): range error"; | |
| 397 | |
| 5765 | 398 std::string buf_str = buf.str (); |
| 399 | |
| 400 (*current_liboctave_error_handler) (buf_str.c_str ()); | |
| 4513 | 401 |
| 402 static T foo; | |
| 403 return foo; | |
| 404 } | |
| 405 | |
| 406 template <class T> | |
| 4567 | 407 Array<T> |
| 408 Array<T>::reshape (const dim_vector& new_dims) const | |
| 409 { | |
| 410 Array<T> retval; | |
| 411 | |
| 412 if (dimensions != new_dims) | |
| 413 { | |
| 414 if (dimensions.numel () == new_dims.numel ()) | |
| 415 retval = Array<T> (*this, new_dims); | |
| 416 else | |
| 417 (*current_liboctave_error_handler) ("reshape: size mismatch"); | |
| 418 } | |
| 4916 | 419 else |
| 420 retval = *this; | |
| 4567 | 421 |
| 422 return retval; | |
| 423 } | |
| 424 | |
| 7241 | 425 |
| 5607 | 426 |
| 4567 | 427 template <class T> |
| 4593 | 428 Array<T> |
| 5607 | 429 Array<T>::permute (const Array<octave_idx_type>& perm_vec_arg, bool inv) const |
| 4593 | 430 { |
| 431 Array<T> retval; | |
| 432 | |
| 5607 | 433 Array<octave_idx_type> perm_vec = perm_vec_arg; |
| 434 | |
| 4593 | 435 dim_vector dv = dims (); |
| 436 dim_vector dv_new; | |
| 437 | |
| 5148 | 438 int perm_vec_len = perm_vec.length (); |
| 439 | |
| 440 if (perm_vec_len < dv.length ()) | |
| 441 (*current_liboctave_error_handler) | |
| 442 ("%s: invalid permutation vector", inv ? "ipermute" : "permute"); | |
| 443 | |
| 444 dv_new.resize (perm_vec_len); | |
| 445 | |
| 446 // Append singleton dimensions as needed. | |
| 447 dv.resize (perm_vec_len, 1); | |
| 448 | |
| 4593 | 449 // Need this array to check for identical elements in permutation array. |
| 5148 | 450 Array<bool> checked (perm_vec_len, false); |
| 4593 | 451 |
| 452 // Find dimension vector of permuted array. | |
| 5148 | 453 for (int i = 0; i < perm_vec_len; i++) |
| 4593 | 454 { |
| 5275 | 455 octave_idx_type perm_elt = perm_vec.elem (i); |
| 5148 | 456 |
| 457 if (perm_elt >= perm_vec_len || perm_elt < 0) | |
| 4593 | 458 { |
| 459 (*current_liboctave_error_handler) | |
| 5148 | 460 ("%s: permutation vector contains an invalid element", |
| 461 inv ? "ipermute" : "permute"); | |
| 4593 | 462 |
| 463 return retval; | |
| 464 } | |
| 465 | |
| 5148 | 466 if (checked.elem(perm_elt)) |
| 4593 | 467 { |
| 468 (*current_liboctave_error_handler) | |
| 5148 | 469 ("%s: permutation vector cannot contain identical elements", |
| 470 inv ? "ipermute" : "permute"); | |
| 4593 | 471 |
| 472 return retval; | |
| 473 } | |
| 474 else | |
| 5148 | 475 checked.elem(perm_elt) = true; |
| 476 | |
| 477 dv_new(i) = dv(perm_elt); | |
| 4593 | 478 } |
| 479 | |
| 5607 | 480 int nd = dv.length (); |
| 481 | |
| 5775 | 482 // FIXME -- it would be nice to have a sort method in the |
| 5607 | 483 // Array class that also returns the sort indices. |
| 484 | |
| 485 if (inv) | |
| 486 { | |
| 487 OCTAVE_LOCAL_BUFFER (permute_vector, pvec, nd); | |
| 488 | |
| 489 for (int i = 0; i < nd; i++) | |
| 490 { | |
| 491 pvec[i].pidx = perm_vec(i); | |
| 492 pvec[i].iidx = i; | |
| 493 } | |
| 494 | |
| 495 octave_qsort (pvec, static_cast<size_t> (nd), | |
| 496 sizeof (permute_vector), permute_vector_compare); | |
| 497 | |
| 498 for (int i = 0; i < nd; i++) | |
| 499 { | |
| 500 perm_vec(i) = pvec[i].iidx; | |
| 501 dv_new(i) = dv(perm_vec(i)); | |
| 502 } | |
| 503 } | |
| 504 | |
| 4593 | 505 retval.resize (dv_new); |
| 506 | |
| 5940 | 507 if (numel () > 0) |
| 5607 | 508 { |
| 5940 | 509 Array<octave_idx_type> cp (nd+1, 1); |
| 510 for (octave_idx_type i = 1; i < nd+1; i++) | |
| 511 cp(i) = cp(i-1) * dv(i-1); | |
| 512 | |
| 513 octave_idx_type incr = cp(perm_vec(0)); | |
| 514 | |
| 515 Array<octave_idx_type> base_delta (nd-1, 0); | |
| 516 Array<octave_idx_type> base_delta_max (nd-1); | |
| 517 Array<octave_idx_type> base_incr (nd-1); | |
| 518 for (octave_idx_type i = 0; i < nd-1; i++) | |
| 5607 | 519 { |
| 5940 | 520 base_delta_max(i) = dv_new(i+1); |
| 521 base_incr(i) = cp(perm_vec(i+1)); | |
| 5607 | 522 } |
| 523 | |
| 5940 | 524 octave_idx_type nr_new = dv_new(0); |
| 525 octave_idx_type nel_new = dv_new.numel (); | |
| 526 octave_idx_type n = nel_new / nr_new; | |
| 527 | |
| 528 octave_idx_type k = 0; | |
| 529 | |
| 530 for (octave_idx_type i = 0; i < n; i++) | |
| 5607 | 531 { |
| 5940 | 532 octave_idx_type iidx = 0; |
| 533 for (octave_idx_type kk = 0; kk < nd-1; kk++) | |
| 534 iidx += base_delta(kk) * base_incr(kk); | |
| 535 | |
| 536 for (octave_idx_type j = 0; j < nr_new; j++) | |
| 5607 | 537 { |
| 5940 | 538 OCTAVE_QUIT; |
| 539 | |
| 540 retval(k++) = elem(iidx); | |
| 541 iidx += incr; | |
| 542 } | |
| 543 | |
| 544 base_delta(0)++; | |
| 545 | |
| 546 for (octave_idx_type kk = 0; kk < nd-2; kk++) | |
| 547 { | |
| 548 if (base_delta(kk) == base_delta_max(kk)) | |
| 549 { | |
| 550 base_delta(kk) = 0; | |
| 551 base_delta(kk+1)++; | |
| 552 } | |
| 5607 | 553 } |
| 554 } | |
| 4593 | 555 } |
| 556 | |
| 5340 | 557 retval.chop_trailing_singletons (); |
| 5338 | 558 |
| 4593 | 559 return retval; |
| 560 } | |
| 561 | |
| 562 template <class T> | |
| 4513 | 563 void |
| 5275 | 564 Array<T>::resize_no_fill (octave_idx_type n) |
| 4513 | 565 { |
| 566 if (n < 0) | |
| 567 { | |
| 568 (*current_liboctave_error_handler) | |
| 569 ("can't resize to negative dimension"); | |
| 570 return; | |
| 571 } | |
| 572 | |
| 573 if (n == length ()) | |
| 574 return; | |
| 575 | |
| 576 typename Array<T>::ArrayRep *old_rep = rep; | |
| 577 const T *old_data = data (); | |
| 5275 | 578 octave_idx_type old_len = length (); |
| 4513 | 579 |
| 580 rep = new typename Array<T>::ArrayRep (n); | |
| 581 | |
| 582 dimensions = dim_vector (n); | |
| 583 | |
| 4747 | 584 if (n > 0 && old_data && old_len > 0) |
| 4513 | 585 { |
| 5275 | 586 octave_idx_type min_len = old_len < n ? old_len : n; |
| 587 | |
| 588 for (octave_idx_type i = 0; i < min_len; i++) | |
| 4513 | 589 xelem (i) = old_data[i]; |
| 590 } | |
| 591 | |
| 592 if (--old_rep->count <= 0) | |
| 593 delete old_rep; | |
| 594 } | |
| 595 | |
| 596 template <class T> | |
| 597 void | |
| 4587 | 598 Array<T>::resize_no_fill (const dim_vector& dv) |
| 4513 | 599 { |
| 5275 | 600 octave_idx_type n = dv.length (); |
| 601 | |
| 602 for (octave_idx_type i = 0; i < n; i++) | |
| 4513 | 603 { |
| 4587 | 604 if (dv(i) < 0) |
| 4513 | 605 { |
| 606 (*current_liboctave_error_handler) | |
| 607 ("can't resize to negative dimension"); | |
| 608 return; | |
| 609 } | |
| 610 } | |
| 611 | |
| 4548 | 612 bool same_size = true; |
| 613 | |
| 614 if (dimensions.length () != n) | |
| 615 { | |
| 616 same_size = false; | |
| 617 } | |
| 618 else | |
| 4513 | 619 { |
| 5275 | 620 for (octave_idx_type i = 0; i < n; i++) |
| 4513 | 621 { |
| 4587 | 622 if (dv(i) != dimensions(i)) |
| 4548 | 623 { |
| 624 same_size = false; | |
| 625 break; | |
| 626 } | |
| 4513 | 627 } |
| 628 } | |
| 629 | |
| 4548 | 630 if (same_size) |
| 4513 | 631 return; |
| 632 | |
| 633 typename Array<T>::ArrayRep *old_rep = rep; | |
| 634 const T *old_data = data (); | |
| 635 | |
| 5275 | 636 octave_idx_type ts = get_size (dv); |
| 4747 | 637 |
| 638 rep = new typename Array<T>::ArrayRep (ts); | |
| 4587 | 639 |
| 4870 | 640 dim_vector dv_old = dimensions; |
| 5275 | 641 octave_idx_type dv_old_orig_len = dv_old.length (); |
| 4587 | 642 dimensions = dv; |
| 5275 | 643 octave_idx_type ts_old = get_size (dv_old); |
| 4915 | 644 |
| 645 if (ts > 0 && ts_old > 0 && dv_old_orig_len > 0) | |
| 4513 | 646 { |
| 5275 | 647 Array<octave_idx_type> ra_idx (dimensions.length (), 0); |
| 4747 | 648 |
| 4870 | 649 if (n > dv_old_orig_len) |
| 4747 | 650 { |
| 4870 | 651 dv_old.resize (n); |
| 652 | |
| 5275 | 653 for (octave_idx_type i = dv_old_orig_len; i < n; i++) |
| 4870 | 654 dv_old.elem (i) = 1; |
| 655 } | |
| 656 | |
| 5275 | 657 for (octave_idx_type i = 0; i < ts; i++) |
| 4870 | 658 { |
| 659 if (index_in_bounds (ra_idx, dv_old)) | |
| 660 rep->elem (i) = old_data[get_scalar_idx (ra_idx, dv_old)]; | |
| 4747 | 661 |
| 662 increment_index (ra_idx, dimensions); | |
| 663 } | |
| 4513 | 664 } |
| 665 | |
| 666 if (--old_rep->count <= 0) | |
| 667 delete old_rep; | |
| 668 } | |
| 669 | |
| 670 template <class T> | |
| 671 void | |
| 5275 | 672 Array<T>::resize_no_fill (octave_idx_type r, octave_idx_type c) |
| 4513 | 673 { |
| 674 if (r < 0 || c < 0) | |
| 675 { | |
| 676 (*current_liboctave_error_handler) | |
| 677 ("can't resize to negative dimension"); | |
| 678 return; | |
| 679 } | |
| 680 | |
| 4548 | 681 int n = ndims (); |
| 682 | |
| 683 if (n == 0) | |
| 684 dimensions = dim_vector (0, 0); | |
| 685 | |
| 686 assert (ndims () == 2); | |
| 687 | |
| 4513 | 688 if (r == dim1 () && c == dim2 ()) |
| 689 return; | |
| 690 | |
| 691 typename Array<T>::ArrayRep *old_rep = Array<T>::rep; | |
| 692 const T *old_data = data (); | |
| 693 | |
| 5275 | 694 octave_idx_type old_d1 = dim1 (); |
| 695 octave_idx_type old_d2 = dim2 (); | |
| 696 octave_idx_type old_len = length (); | |
| 697 | |
| 698 octave_idx_type ts = get_size (r, c); | |
| 4747 | 699 |
| 700 rep = new typename Array<T>::ArrayRep (ts); | |
| 4513 | 701 |
| 702 dimensions = dim_vector (r, c); | |
| 703 | |
| 4747 | 704 if (ts > 0 && old_data && old_len > 0) |
| 4513 | 705 { |
| 5275 | 706 octave_idx_type min_r = old_d1 < r ? old_d1 : r; |
| 707 octave_idx_type min_c = old_d2 < c ? old_d2 : c; | |
| 708 | |
| 709 for (octave_idx_type j = 0; j < min_c; j++) | |
| 710 for (octave_idx_type i = 0; i < min_r; i++) | |
| 4513 | 711 xelem (i, j) = old_data[old_d1*j+i]; |
| 712 } | |
| 713 | |
| 714 if (--old_rep->count <= 0) | |
| 715 delete old_rep; | |
| 716 } | |
| 717 | |
| 718 template <class T> | |
| 719 void | |
| 5275 | 720 Array<T>::resize_no_fill (octave_idx_type r, octave_idx_type c, octave_idx_type p) |
| 4513 | 721 { |
| 722 if (r < 0 || c < 0 || p < 0) | |
| 723 { | |
| 724 (*current_liboctave_error_handler) | |
| 725 ("can't resize to negative dimension"); | |
| 726 return; | |
| 727 } | |
| 728 | |
| 4548 | 729 int n = ndims (); |
| 730 | |
| 731 if (n == 0) | |
| 732 dimensions = dim_vector (0, 0, 0); | |
| 733 | |
| 734 assert (ndims () == 3); | |
| 735 | |
| 4513 | 736 if (r == dim1 () && c == dim2 () && p == dim3 ()) |
| 737 return; | |
| 738 | |
| 739 typename Array<T>::ArrayRep *old_rep = rep; | |
| 740 const T *old_data = data (); | |
| 741 | |
| 5275 | 742 octave_idx_type old_d1 = dim1 (); |
| 743 octave_idx_type old_d2 = dim2 (); | |
| 744 octave_idx_type old_d3 = dim3 (); | |
| 745 octave_idx_type old_len = length (); | |
| 746 | |
| 747 octave_idx_type ts = get_size (get_size (r, c), p); | |
| 4513 | 748 |
| 749 rep = new typename Array<T>::ArrayRep (ts); | |
| 750 | |
| 751 dimensions = dim_vector (r, c, p); | |
| 752 | |
| 4747 | 753 if (ts > 0 && old_data && old_len > 0) |
| 4513 | 754 { |
| 5275 | 755 octave_idx_type min_r = old_d1 < r ? old_d1 : r; |
| 756 octave_idx_type min_c = old_d2 < c ? old_d2 : c; | |
| 757 octave_idx_type min_p = old_d3 < p ? old_d3 : p; | |
| 758 | |
| 759 for (octave_idx_type k = 0; k < min_p; k++) | |
| 760 for (octave_idx_type j = 0; j < min_c; j++) | |
| 761 for (octave_idx_type i = 0; i < min_r; i++) | |
| 4513 | 762 xelem (i, j, k) = old_data[old_d1*(old_d2*k+j)+i]; |
| 763 } | |
| 764 | |
| 765 if (--old_rep->count <= 0) | |
| 766 delete old_rep; | |
| 767 } | |
| 768 | |
| 769 template <class T> | |
| 770 void | |
| 5275 | 771 Array<T>::resize_and_fill (octave_idx_type n, const T& val) |
| 4513 | 772 { |
| 773 if (n < 0) | |
| 774 { | |
| 775 (*current_liboctave_error_handler) | |
| 776 ("can't resize to negative dimension"); | |
| 777 return; | |
| 778 } | |
| 779 | |
| 780 if (n == length ()) | |
| 781 return; | |
| 782 | |
| 783 typename Array<T>::ArrayRep *old_rep = rep; | |
| 784 const T *old_data = data (); | |
| 5275 | 785 octave_idx_type old_len = length (); |
| 4513 | 786 |
| 787 rep = new typename Array<T>::ArrayRep (n); | |
| 788 | |
| 789 dimensions = dim_vector (n); | |
| 790 | |
| 4747 | 791 if (n > 0) |
| 4513 | 792 { |
| 5275 | 793 octave_idx_type min_len = old_len < n ? old_len : n; |
| 4747 | 794 |
| 795 if (old_data && old_len > 0) | |
| 796 { | |
| 5275 | 797 for (octave_idx_type i = 0; i < min_len; i++) |
| 4747 | 798 xelem (i) = old_data[i]; |
| 799 } | |
| 800 | |
| 5275 | 801 for (octave_idx_type i = old_len; i < n; i++) |
| 4747 | 802 xelem (i) = val; |
| 4513 | 803 } |
| 804 | |
| 805 if (--old_rep->count <= 0) | |
| 806 delete old_rep; | |
| 807 } | |
| 808 | |
| 809 template <class T> | |
| 810 void | |
| 5275 | 811 Array<T>::resize_and_fill (octave_idx_type r, octave_idx_type c, const T& val) |
| 4513 | 812 { |
| 813 if (r < 0 || c < 0) | |
| 814 { | |
| 815 (*current_liboctave_error_handler) | |
| 816 ("can't resize to negative dimension"); | |
| 817 return; | |
| 818 } | |
| 819 | |
| 4548 | 820 if (ndims () == 0) |
| 821 dimensions = dim_vector (0, 0); | |
| 822 | |
| 823 assert (ndims () == 2); | |
| 824 | |
| 4513 | 825 if (r == dim1 () && c == dim2 ()) |
| 826 return; | |
| 827 | |
| 828 typename Array<T>::ArrayRep *old_rep = Array<T>::rep; | |
| 829 const T *old_data = data (); | |
| 830 | |
| 5275 | 831 octave_idx_type old_d1 = dim1 (); |
| 832 octave_idx_type old_d2 = dim2 (); | |
| 833 octave_idx_type old_len = length (); | |
| 834 | |
| 835 octave_idx_type ts = get_size (r, c); | |
| 4747 | 836 |
| 837 rep = new typename Array<T>::ArrayRep (ts); | |
| 4513 | 838 |
| 839 dimensions = dim_vector (r, c); | |
| 840 | |
| 4747 | 841 if (ts > 0) |
| 4513 | 842 { |
| 5275 | 843 octave_idx_type min_r = old_d1 < r ? old_d1 : r; |
| 844 octave_idx_type min_c = old_d2 < c ? old_d2 : c; | |
| 4747 | 845 |
| 846 if (old_data && old_len > 0) | |
| 847 { | |
| 5275 | 848 for (octave_idx_type j = 0; j < min_c; j++) |
| 849 for (octave_idx_type i = 0; i < min_r; i++) | |
| 4747 | 850 xelem (i, j) = old_data[old_d1*j+i]; |
| 851 } | |
| 852 | |
| 5275 | 853 for (octave_idx_type j = 0; j < min_c; j++) |
| 854 for (octave_idx_type i = min_r; i < r; i++) | |
| 4747 | 855 xelem (i, j) = val; |
| 856 | |
| 5275 | 857 for (octave_idx_type j = min_c; j < c; j++) |
| 858 for (octave_idx_type i = 0; i < r; i++) | |
| 4747 | 859 xelem (i, j) = val; |
| 4513 | 860 } |
| 861 | |
| 862 if (--old_rep->count <= 0) | |
| 863 delete old_rep; | |
| 864 } | |
| 865 | |
| 866 template <class T> | |
| 867 void | |
| 5275 | 868 Array<T>::resize_and_fill (octave_idx_type r, octave_idx_type c, octave_idx_type p, const T& val) |
| 4513 | 869 { |
| 870 if (r < 0 || c < 0 || p < 0) | |
| 871 { | |
| 872 (*current_liboctave_error_handler) | |
| 873 ("can't resize to negative dimension"); | |
| 874 return; | |
| 875 } | |
| 876 | |
| 4548 | 877 if (ndims () == 0) |
| 878 dimensions = dim_vector (0, 0, 0); | |
| 879 | |
| 880 assert (ndims () == 3); | |
| 881 | |
| 4513 | 882 if (r == dim1 () && c == dim2 () && p == dim3 ()) |
| 883 return; | |
| 884 | |
| 885 typename Array<T>::ArrayRep *old_rep = rep; | |
| 886 const T *old_data = data (); | |
| 887 | |
| 5275 | 888 octave_idx_type old_d1 = dim1 (); |
| 889 octave_idx_type old_d2 = dim2 (); | |
| 890 octave_idx_type old_d3 = dim3 (); | |
| 891 | |
| 892 octave_idx_type old_len = length (); | |
| 893 | |
| 894 octave_idx_type ts = get_size (get_size (r, c), p); | |
| 4513 | 895 |
| 896 rep = new typename Array<T>::ArrayRep (ts); | |
| 897 | |
| 898 dimensions = dim_vector (r, c, p); | |
| 899 | |
| 4747 | 900 if (ts > 0) |
| 901 { | |
| 5275 | 902 octave_idx_type min_r = old_d1 < r ? old_d1 : r; |
| 903 octave_idx_type min_c = old_d2 < c ? old_d2 : c; | |
| 904 octave_idx_type min_p = old_d3 < p ? old_d3 : p; | |
| 4747 | 905 |
| 906 if (old_data && old_len > 0) | |
| 5275 | 907 for (octave_idx_type k = 0; k < min_p; k++) |
| 908 for (octave_idx_type j = 0; j < min_c; j++) | |
| 909 for (octave_idx_type i = 0; i < min_r; i++) | |
| 4747 | 910 xelem (i, j, k) = old_data[old_d1*(old_d2*k+j)+i]; |
| 911 | |
| 5775 | 912 // FIXME -- if the copy constructor is expensive, this |
| 4747 | 913 // may win. Otherwise, it may make more sense to just copy the |
| 914 // value everywhere when making the new ArrayRep. | |
| 915 | |
| 5275 | 916 for (octave_idx_type k = 0; k < min_p; k++) |
| 917 for (octave_idx_type j = min_c; j < c; j++) | |
| 918 for (octave_idx_type i = 0; i < min_r; i++) | |
| 4747 | 919 xelem (i, j, k) = val; |
| 920 | |
| 5275 | 921 for (octave_idx_type k = 0; k < min_p; k++) |
| 922 for (octave_idx_type j = 0; j < c; j++) | |
| 923 for (octave_idx_type i = min_r; i < r; i++) | |
| 4747 | 924 xelem (i, j, k) = val; |
| 925 | |
| 5275 | 926 for (octave_idx_type k = min_p; k < p; k++) |
| 927 for (octave_idx_type j = 0; j < c; j++) | |
| 928 for (octave_idx_type i = 0; i < r; i++) | |
| 4747 | 929 xelem (i, j, k) = val; |
| 930 } | |
| 4513 | 931 |
| 932 if (--old_rep->count <= 0) | |
| 933 delete old_rep; | |
| 934 } | |
| 935 | |
| 936 template <class T> | |
| 937 void | |
| 4587 | 938 Array<T>::resize_and_fill (const dim_vector& dv, const T& val) |
| 4513 | 939 { |
| 5275 | 940 octave_idx_type n = dv.length (); |
| 941 | |
| 942 for (octave_idx_type i = 0; i < n; i++) | |
| 4513 | 943 { |
| 4587 | 944 if (dv(i) < 0) |
| 4513 | 945 { |
| 946 (*current_liboctave_error_handler) | |
| 947 ("can't resize to negative dimension"); | |
| 948 return; | |
| 949 } | |
| 950 } | |
| 951 | |
| 4553 | 952 bool same_size = true; |
| 953 | |
| 954 if (dimensions.length () != n) | |
| 955 { | |
| 956 same_size = false; | |
| 957 } | |
| 958 else | |
| 4513 | 959 { |
| 5275 | 960 for (octave_idx_type i = 0; i < n; i++) |
| 4513 | 961 { |
| 4587 | 962 if (dv(i) != dimensions(i)) |
| 4553 | 963 { |
| 964 same_size = false; | |
| 965 break; | |
| 966 } | |
| 4513 | 967 } |
| 968 } | |
| 969 | |
| 4553 | 970 if (same_size) |
| 4513 | 971 return; |
| 972 | |
| 973 typename Array<T>::ArrayRep *old_rep = rep; | |
| 974 const T *old_data = data (); | |
| 975 | |
| 5275 | 976 octave_idx_type len = get_size (dv); |
| 4709 | 977 |
| 4513 | 978 rep = new typename Array<T>::ArrayRep (len); |
| 979 | |
| 4707 | 980 dim_vector dv_old = dimensions; |
| 5275 | 981 octave_idx_type dv_old_orig_len = dv_old.length (); |
| 4587 | 982 dimensions = dv; |
| 4513 | 983 |
| 4870 | 984 if (len > 0 && dv_old_orig_len > 0) |
| 4513 | 985 { |
| 5275 | 986 Array<octave_idx_type> ra_idx (dimensions.length (), 0); |
| 4870 | 987 |
| 988 if (n > dv_old_orig_len) | |
| 989 { | |
| 990 dv_old.resize (n); | |
| 991 | |
| 5275 | 992 for (octave_idx_type i = dv_old_orig_len; i < n; i++) |
| 4870 | 993 dv_old.elem (i) = 1; |
| 994 } | |
| 4747 | 995 |
| 5275 | 996 for (octave_idx_type i = 0; i < len; i++) |
| 4747 | 997 { |
| 998 if (index_in_bounds (ra_idx, dv_old)) | |
| 4870 | 999 rep->elem (i) = old_data[get_scalar_idx (ra_idx, dv_old)]; |
| 1000 else | |
| 1001 rep->elem (i) = val; | |
| 1002 | |
| 1003 increment_index (ra_idx, dimensions); | |
| 4747 | 1004 } |
| 4513 | 1005 } |
| 4870 | 1006 else |
| 5275 | 1007 for (octave_idx_type i = 0; i < len; i++) |
| 4870 | 1008 rep->elem (i) = val; |
| 4513 | 1009 |
| 1010 if (--old_rep->count <= 0) | |
| 1011 delete old_rep; | |
| 1012 } | |
| 1013 | |
| 1014 template <class T> | |
| 1015 Array<T>& | |
| 5275 | 1016 Array<T>::insert (const Array<T>& a, octave_idx_type r, octave_idx_type c) |
| 4513 | 1017 { |
| 4786 | 1018 if (ndims () == 2 && a.ndims () == 2) |
| 1019 insert2 (a, r, c); | |
| 1020 else | |
| 1021 insertN (a, r, c); | |
| 1022 | |
| 1023 return *this; | |
| 1024 } | |
| 1025 | |
| 1026 | |
| 1027 template <class T> | |
| 1028 Array<T>& | |
| 5275 | 1029 Array<T>::insert2 (const Array<T>& a, octave_idx_type r, octave_idx_type c) |
| 4786 | 1030 { |
| 5275 | 1031 octave_idx_type a_rows = a.rows (); |
| 1032 octave_idx_type a_cols = a.cols (); | |
| 4786 | 1033 |
| 1034 if (r < 0 || r + a_rows > rows () || c < 0 || c + a_cols > cols ()) | |
| 1035 { | |
| 1036 (*current_liboctave_error_handler) ("range error for insert"); | |
| 1037 return *this; | |
| 1038 } | |
| 1039 | |
| 5275 | 1040 for (octave_idx_type j = 0; j < a_cols; j++) |
| 1041 for (octave_idx_type i = 0; i < a_rows; i++) | |
| 4786 | 1042 elem (r+i, c+j) = a.elem (i, j); |
| 1043 | |
| 1044 return *this; | |
| 1045 } | |
| 1046 | |
| 1047 template <class T> | |
| 1048 Array<T>& | |
| 5275 | 1049 Array<T>::insertN (const Array<T>& a, octave_idx_type r, octave_idx_type c) |
| 4786 | 1050 { |
| 4806 | 1051 dim_vector dv = dims (); |
| 1052 | |
| 4765 | 1053 dim_vector a_dv = a.dims (); |
| 1054 | |
| 1055 int n = a_dv.length (); | |
| 1056 | |
| 1057 if (n == dimensions.length ()) | |
| 4513 | 1058 { |
| 5275 | 1059 Array<octave_idx_type> a_ra_idx (a_dv.length (), 0); |
| 4765 | 1060 |
| 1061 a_ra_idx.elem (0) = r; | |
| 1062 a_ra_idx.elem (1) = c; | |
| 1063 | |
| 1064 for (int i = 0; i < n; i++) | |
| 1065 { | |
| 4806 | 1066 if (a_ra_idx(i) < 0 || (a_ra_idx(i) + a_dv(i)) > dv(i)) |
| 4765 | 1067 { |
| 1068 (*current_liboctave_error_handler) | |
| 1069 ("Array<T>::insert: range error for insert"); | |
| 1070 return *this; | |
| 1071 } | |
| 1072 } | |
| 1073 | |
| 5275 | 1074 octave_idx_type n_elt = a.numel (); |
| 4806 | 1075 |
| 1076 const T *a_data = a.data (); | |
| 1077 | |
| 5275 | 1078 octave_idx_type iidx = 0; |
| 4806 | 1079 |
| 5275 | 1080 octave_idx_type a_rows = a_dv(0); |
| 1081 | |
| 1082 octave_idx_type this_rows = dv(0); | |
| 4806 | 1083 |
| 5275 | 1084 octave_idx_type numel_page = a_dv(0) * a_dv(1); |
| 1085 | |
| 1086 octave_idx_type count_pages = 0; | |
| 4806 | 1087 |
| 5275 | 1088 for (octave_idx_type i = 0; i < n_elt; i++) |
| 4765 | 1089 { |
| 4806 | 1090 if (i != 0 && i % a_rows == 0) |
| 1091 iidx += (this_rows - a_rows); | |
| 1092 | |
| 1093 if (i % numel_page == 0) | |
| 1094 iidx = c * dv(0) + r + dv(0) * dv(1) * count_pages++; | |
| 1095 | |
| 1096 elem (iidx++) = a_data[i]; | |
| 4765 | 1097 } |
| 4513 | 1098 } |
| 4765 | 1099 else |
| 1100 (*current_liboctave_error_handler) | |
| 1101 ("Array<T>::insert: invalid indexing operation"); | |
| 4513 | 1102 |
| 1103 return *this; | |
| 1104 } | |
| 1105 | |
| 1106 template <class T> | |
| 1107 Array<T>& | |
| 5275 | 1108 Array<T>::insert (const Array<T>& a, const Array<octave_idx_type>& ra_idx) |
| 4513 | 1109 { |
| 5275 | 1110 octave_idx_type n = ra_idx.length (); |
| 4513 | 1111 |
| 1112 if (n == dimensions.length ()) | |
| 1113 { | |
| 4915 | 1114 dim_vector dva = a.dims (); |
| 1115 dim_vector dv = dims (); | |
| 1116 int len_a = dva.length (); | |
| 5120 | 1117 int non_full_dim = 0; |
| 4513 | 1118 |
| 5275 | 1119 for (octave_idx_type i = 0; i < n; i++) |
| 4513 | 1120 { |
| 4915 | 1121 if (ra_idx(i) < 0 || (ra_idx(i) + |
| 1122 (i < len_a ? dva(i) : 1)) > dimensions(i)) | |
| 4513 | 1123 { |
| 1124 (*current_liboctave_error_handler) | |
| 1125 ("Array<T>::insert: range error for insert"); | |
| 1126 return *this; | |
| 1127 } | |
| 5120 | 1128 |
| 1129 if (dv(i) != (i < len_a ? dva(i) : 1)) | |
| 1130 non_full_dim++; | |
| 4513 | 1131 } |
| 1132 | |
| 4915 | 1133 if (dva.numel ()) |
| 1134 { | |
| 5120 | 1135 if (non_full_dim < 2) |
| 4915 | 1136 { |
| 5120 | 1137 // Special case for fast concatenation |
| 1138 const T *a_data = a.data (); | |
| 5275 | 1139 octave_idx_type numel_to_move = 1; |
| 1140 octave_idx_type skip = 0; | |
| 5120 | 1141 for (int i = 0; i < len_a; i++) |
| 1142 if (ra_idx(i) == 0 && dva(i) == dv(i)) | |
| 1143 numel_to_move *= dva(i); | |
| 1144 else | |
| 1145 { | |
| 1146 skip = numel_to_move * (dv(i) - dva(i)); | |
| 1147 numel_to_move *= dva(i); | |
| 1148 break; | |
| 1149 } | |
| 1150 | |
| 5275 | 1151 octave_idx_type jidx = ra_idx(n-1); |
| 5120 | 1152 for (int i = n-2; i >= 0; i--) |
| 1153 { | |
| 1154 jidx *= dv(i); | |
| 1155 jidx += ra_idx(i); | |
| 1156 } | |
| 1157 | |
| 5275 | 1158 octave_idx_type iidx = 0; |
| 1159 octave_idx_type moves = dva.numel () / numel_to_move; | |
| 1160 for (octave_idx_type i = 0; i < moves; i++) | |
| 5120 | 1161 { |
| 5275 | 1162 for (octave_idx_type j = 0; j < numel_to_move; j++) |
| 5120 | 1163 elem (jidx++) = a_data[iidx++]; |
| 1164 jidx += skip; | |
| 1165 } | |
| 4915 | 1166 } |
| 5120 | 1167 else |
| 4915 | 1168 { |
| 5120 | 1169 // Generic code |
| 1170 const T *a_data = a.data (); | |
| 1171 int nel = a.numel (); | |
| 5275 | 1172 Array<octave_idx_type> a_idx (n, 0); |
| 5120 | 1173 |
| 1174 for (int i = 0; i < nel; i++) | |
| 1175 { | |
| 1176 int iidx = a_idx(n-1) + ra_idx(n-1); | |
| 1177 for (int j = n-2; j >= 0; j--) | |
| 1178 { | |
| 1179 iidx *= dv(j); | |
| 1180 iidx += a_idx(j) + ra_idx(j); | |
| 1181 } | |
| 1182 | |
| 1183 elem (iidx) = a_data[i]; | |
| 1184 | |
| 1185 increment_index (a_idx, dva); | |
| 1186 } | |
| 4915 | 1187 } |
| 1188 } | |
| 4513 | 1189 } |
| 1190 else | |
| 1191 (*current_liboctave_error_handler) | |
| 1192 ("Array<T>::insert: invalid indexing operation"); | |
| 1193 | |
| 1194 return *this; | |
| 1195 } | |
| 1196 | |
| 1197 template <class T> | |
| 1198 Array<T> | |
| 1199 Array<T>::transpose (void) const | |
| 1200 { | |
| 4548 | 1201 assert (ndims () == 2); |
| 1202 | |
| 5275 | 1203 octave_idx_type nr = dim1 (); |
| 1204 octave_idx_type nc = dim2 (); | |
| 4513 | 1205 |
|
7789
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1206 if (nr >= 8 && nc >= 8) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1207 { |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1208 Array<T> result (dim_vector (nc, nr)); |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1209 |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1210 // Blocked transpose to attempt to avoid cache misses. |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1211 |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1212 // Don't use OCTAVE_LOCAL_BUFFER here as it doesn't work with bool |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1213 // on some compilers. |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1214 T buf[64]; |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1215 |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1216 octave_idx_type ii = 0, jj; |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1217 for (jj = 0; jj < (nc - 8 + 1); jj += 8) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1218 { |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1219 for (ii = 0; ii < (nr - 8 + 1); ii += 8) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1220 { |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1221 // Copy to buffer |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1222 for (octave_idx_type j = jj, k = 0, idxj = jj * nr; |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1223 j < jj + 8; j++, idxj += nr) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1224 for (octave_idx_type i = ii; i < ii + 8; i++) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1225 buf[k++] = xelem (i + idxj); |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1226 |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1227 // Copy from buffer |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1228 for (octave_idx_type i = ii, idxi = ii * nc; i < ii + 8; |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1229 i++, idxi += nc) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1230 for (octave_idx_type j = jj, k = i - ii; j < jj + 8; |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1231 j++, k+=8) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1232 result.xelem (j + idxi) = buf[k]; |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1233 } |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1234 |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1235 if (ii < nr) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1236 for (octave_idx_type j = jj; j < jj + 8; j++) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1237 for (octave_idx_type i = ii; i < nr; i++) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1238 result.xelem (j, i) = xelem (i, j); |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1239 } |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1240 |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1241 for (octave_idx_type j = jj; j < nc; j++) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1242 for (octave_idx_type i = 0; i < nr; i++) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1243 result.xelem (j, i) = xelem (i, j); |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1244 |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1245 return result; |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1246 } |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1247 else if (nr > 1 && nc > 1) |
| 4513 | 1248 { |
| 1249 Array<T> result (dim_vector (nc, nr)); | |
| 1250 | |
| 5275 | 1251 for (octave_idx_type j = 0; j < nc; j++) |
| 1252 for (octave_idx_type i = 0; i < nr; i++) | |
| 4513 | 1253 result.xelem (j, i) = xelem (i, j); |
| 1254 | |
| 1255 return result; | |
| 1256 } | |
| 1257 else | |
| 1258 { | |
| 1259 // Fast transpose for vectors and empty matrices | |
| 1260 return Array<T> (*this, dim_vector (nc, nr)); | |
| 1261 } | |
| 1262 } | |
| 1263 | |
| 1264 template <class T> | |
|
7789
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1265 Array<T> |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1266 Array<T>::hermitian (T (*fcn) (const T&)) const |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1267 { |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1268 assert (ndims () == 2); |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1269 |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1270 octave_idx_type nr = dim1 (); |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1271 octave_idx_type nc = dim2 (); |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1272 |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1273 if (nr >= 8 && nc >= 8) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1274 { |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1275 Array<T> result (dim_vector (nc, nr)); |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1276 |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1277 // Blocked transpose to attempt to avoid cache misses. |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1278 |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1279 // Don't use OCTAVE_LOCAL_BUFFER here as it doesn't work with bool |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1280 // on some compilers. |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1281 T buf[64]; |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1282 |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1283 octave_idx_type ii = 0, jj; |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1284 for (jj = 0; jj < (nc - 8 + 1); jj += 8) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1285 { |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1286 for (ii = 0; ii < (nr - 8 + 1); ii += 8) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1287 { |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1288 // Copy to buffer |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1289 for (octave_idx_type j = jj, k = 0, idxj = jj * nr; |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1290 j < jj + 8; j++, idxj += nr) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1291 for (octave_idx_type i = ii; i < ii + 8; i++) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1292 buf[k++] = xelem (i + idxj); |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1293 |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1294 // Copy from buffer |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1295 for (octave_idx_type i = ii, idxi = ii * nc; i < ii + 8; |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1296 i++, idxi += nc) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1297 for (octave_idx_type j = jj, k = i - ii; j < jj + 8; |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1298 j++, k+=8) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1299 result.xelem (j + idxi) = fcn (buf[k]); |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1300 } |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1301 |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1302 if (ii < nr) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1303 for (octave_idx_type j = jj; j < jj + 8; j++) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1304 for (octave_idx_type i = ii; i < nr; i++) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1305 result.xelem (j, i) = fcn (xelem (i, j)); |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1306 } |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1307 |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1308 for (octave_idx_type j = jj; j < nc; j++) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1309 for (octave_idx_type i = 0; i < nr; i++) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1310 result.xelem (j, i) = fcn (xelem (i, j)); |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1311 |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1312 return result; |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1313 } |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1314 else |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1315 { |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1316 Array<T> result (dim_vector (nc, nr)); |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1317 |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1318 for (octave_idx_type j = 0; j < nc; j++) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1319 for (octave_idx_type i = 0; i < nr; i++) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1320 result.xelem (j, i) = fcn (xelem (i, j)); |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1321 |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1322 return result; |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1323 } |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1324 } |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1325 |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1326 /* |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1327 |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1328 %% Tranpose tests for matrices of the tile size and plus or minus a row |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1329 %% and with four tiles. |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1330 |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1331 %!shared m7, mt7, m8, mt8, m9, mt9 |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1332 %! m7 = reshape (1 : 7*8, 8, 7); |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1333 %! mt7 = [1:7; 1:7, 1:7, 1:7, 1:7; 1:7, 1:7, 1:7]; |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1334 %! m8 = reshape (1 : 8*8, 8, 8); |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1335 %! mt8 = [1:8; 1:8, 1:8, 1:8, 1:8; 1:8, 1:8, 1:8]; |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1336 %! m9 = reshape (1 : 9*8, 8, 9); |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1337 %! mt9 = [1:9; 1:9, 1:9, 1:9, 1:9; 1:9, 1:9, 1:9]; |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1338 |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1339 %!assert (m7', mt7) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1340 %!assert ((1i*m7).', 1i * mt7) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1341 %!assert ((1i*m7)', conj (1i * mt7)) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1342 %!assert (m8', mt8) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1343 %!assert ((1i*m8).', 1i * mt8) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1344 %!assert ((1i*m8)', conj (1i * mt8)) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1345 %!assert (m9', mt9) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1346 %!assert ((1i*m9).', 1i * mt9) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1347 %!assert ((1i*m9)', conj (1i * mt9)) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1348 |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1349 %!assert ([m7, m7; m8, m8]', [mt7, mt8; mt7, mt8]) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1350 %!assert ((1i*[m7, m7; m8, m8]).', 1i * [mt7, mt8; mt7, mt8]) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1351 %!assert ((1i*[m7, m7; m8, m8])', conj (1i * [mt7, mt8; mt7, mt8])) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1352 %!assert ([m8, m8; m8, m8]', [mt8, mt8; mt8, mt8]) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1353 %!assert ((1i*[m8, m8; m8, m8]).', 1i * [mt8, mt8; mt8, mt8]) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1354 %!assert ((1i*[m8, m8; m8, m8])', conj (1i * [mt8, mt8; mt8, mt8])) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1355 %!assert ([m9, m9; m8, m8]', [mt9, mt8; mt9, mt8]) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1356 %!assert ((1i*[m9, m9; m8, m8]).', 1i * [mt9, mt8; mt9, mt8]) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1357 %!assert ((1i*[m9, m9; m8, m8])', conj (1i * [mt9, mt8; mt9, mt8])) |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1358 |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1359 */ |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1360 |
|
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
1361 template <class T> |
| 4513 | 1362 T * |
| 1363 Array<T>::fortran_vec (void) | |
| 1364 { | |
| 6881 | 1365 make_unique (); |
| 1366 | |
| 4513 | 1367 return rep->data; |
| 1368 } | |
| 1369 | |
| 1370 template <class T> | |
| 3933 | 1371 void |
| 4517 | 1372 Array<T>::maybe_delete_dims (void) |
| 1373 { | |
| 4587 | 1374 int nd = dimensions.length (); |
| 4517 | 1375 |
| 1376 dim_vector new_dims (1, 1); | |
| 1377 | |
| 1378 bool delete_dims = true; | |
| 1379 | |
| 4587 | 1380 for (int i = nd - 1; i >= 0; i--) |
| 4517 | 1381 { |
| 1382 if (delete_dims) | |
| 1383 { | |
| 1384 if (dimensions(i) != 1) | |
| 1385 { | |
| 1386 delete_dims = false; | |
| 1387 | |
| 1388 new_dims = dim_vector (i + 1, dimensions(i)); | |
| 1389 } | |
| 1390 } | |
| 1391 else | |
| 1392 new_dims(i) = dimensions(i); | |
| 1393 } | |
| 4530 | 1394 |
| 4587 | 1395 if (nd != new_dims.length ()) |
| 4517 | 1396 dimensions = new_dims; |
| 1397 } | |
| 1398 | |
| 1399 template <class T> | |
| 1400 void | |
| 6881 | 1401 Array<T>::clear_index (void) const |
| 4517 | 1402 { |
| 1403 delete [] idx; | |
| 1404 idx = 0; | |
| 1405 idx_count = 0; | |
| 1406 } | |
| 1407 | |
| 1408 template <class T> | |
| 1409 void | |
| 6881 | 1410 Array<T>::set_index (const idx_vector& idx_arg) const |
| 4517 | 1411 { |
| 1412 int nd = ndims (); | |
| 1413 | |
| 1414 if (! idx && nd > 0) | |
| 1415 idx = new idx_vector [nd]; | |
| 1416 | |
| 1417 if (idx_count < nd) | |
| 1418 { | |
| 1419 idx[idx_count++] = idx_arg; | |
| 1420 } | |
| 1421 else | |
| 1422 { | |
| 1423 idx_vector *new_idx = new idx_vector [idx_count+1]; | |
| 1424 | |
| 1425 for (int i = 0; i < idx_count; i++) | |
| 1426 new_idx[i] = idx[i]; | |
| 1427 | |
| 1428 new_idx[idx_count++] = idx_arg; | |
| 1429 | |
| 1430 delete [] idx; | |
| 1431 | |
| 1432 idx = new_idx; | |
| 1433 } | |
| 1434 } | |
| 1435 | |
| 1436 template <class T> | |
| 1437 void | |
| 1438 Array<T>::maybe_delete_elements (idx_vector& idx_arg) | |
| 1439 { | |
| 1440 switch (ndims ()) | |
| 1441 { | |
| 1442 case 1: | |
| 1443 maybe_delete_elements_1 (idx_arg); | |
| 1444 break; | |
| 1445 | |
| 1446 case 2: | |
| 1447 maybe_delete_elements_2 (idx_arg); | |
| 1448 break; | |
| 1449 | |
| 1450 default: | |
| 1451 (*current_liboctave_error_handler) | |
| 1452 ("Array<T>::maybe_delete_elements: invalid operation"); | |
| 1453 break; | |
| 1454 } | |
| 1455 } | |
| 1456 | |
| 1457 template <class T> | |
| 1458 void | |
| 1459 Array<T>::maybe_delete_elements_1 (idx_vector& idx_arg) | |
| 1460 { | |
| 5275 | 1461 octave_idx_type len = length (); |
| 4517 | 1462 |
| 1463 if (len == 0) | |
| 1464 return; | |
| 1465 | |
| 1466 if (idx_arg.is_colon_equiv (len, 1)) | |
| 1467 resize_no_fill (0); | |
| 1468 else | |
| 1469 { | |
| 1470 int num_to_delete = idx_arg.length (len); | |
| 1471 | |
| 1472 if (num_to_delete != 0) | |
| 1473 { | |
| 5275 | 1474 octave_idx_type new_len = len; |
| 1475 | |
| 1476 octave_idx_type iidx = 0; | |
| 1477 | |
| 1478 for (octave_idx_type i = 0; i < len; i++) | |
| 4517 | 1479 if (i == idx_arg.elem (iidx)) |
| 1480 { | |
| 1481 iidx++; | |
| 1482 new_len--; | |
| 1483 | |
| 1484 if (iidx == num_to_delete) | |
| 1485 break; | |
| 1486 } | |
| 1487 | |
| 1488 if (new_len > 0) | |
| 1489 { | |
| 1490 T *new_data = new T [new_len]; | |
| 1491 | |
| 5275 | 1492 octave_idx_type ii = 0; |
| 4517 | 1493 iidx = 0; |
| 5275 | 1494 for (octave_idx_type i = 0; i < len; i++) |
| 4517 | 1495 { |
| 1496 if (iidx < num_to_delete && i == idx_arg.elem (iidx)) | |
| 1497 iidx++; | |
| 1498 else | |
| 1499 { | |
| 6884 | 1500 new_data[ii] = xelem (i); |
| 4517 | 1501 ii++; |
| 1502 } | |
| 1503 } | |
| 1504 | |
| 1505 if (--rep->count <= 0) | |
| 1506 delete rep; | |
| 1507 | |
| 1508 rep = new typename Array<T>::ArrayRep (new_data, new_len); | |
| 1509 | |
| 1510 dimensions.resize (1); | |
| 1511 dimensions(0) = new_len; | |
| 1512 } | |
| 1513 else | |
| 1514 (*current_liboctave_error_handler) | |
| 1515 ("A(idx) = []: index out of range"); | |
| 1516 } | |
| 1517 } | |
| 1518 } | |
| 1519 | |
| 1520 template <class T> | |
| 1521 void | |
| 1522 Array<T>::maybe_delete_elements_2 (idx_vector& idx_arg) | |
| 1523 { | |
| 4548 | 1524 assert (ndims () == 2); |
| 1525 | |
| 5275 | 1526 octave_idx_type nr = dim1 (); |
| 1527 octave_idx_type nc = dim2 (); | |
| 4517 | 1528 |
| 5275 | 1529 octave_idx_type n; |
| 4517 | 1530 if (nr == 1) |
| 1531 n = nc; | |
| 1532 else if (nc == 1) | |
| 1533 n = nr; | |
| 1534 else | |
| 1535 { | |
| 4756 | 1536 // Reshape to row vector for Matlab compatibility. |
| 1537 | |
| 1538 n = nr * nc; | |
| 1539 nr = 1; | |
| 1540 nc = n; | |
| 4517 | 1541 } |
| 1542 | |
| 6525 | 1543 if (nr > 0 && nc > 0 && idx_arg.is_colon_equiv (n, 1)) |
| 4517 | 1544 { |
| 1545 // Either A(:) = [] or A(idx) = [] with idx enumerating all | |
| 1546 // elements, so we delete all elements and return [](0x0). To | |
| 1547 // preserve the orientation of the vector, you have to use | |
| 1548 // A(idx,:) = [] (delete rows) or A(:,idx) (delete columns). | |
| 1549 | |
| 1550 resize_no_fill (0, 0); | |
| 1551 return; | |
| 1552 } | |
| 1553 | |
| 1554 idx_arg.sort (true); | |
| 1555 | |
| 5275 | 1556 octave_idx_type num_to_delete = idx_arg.length (n); |
| 4517 | 1557 |
| 1558 if (num_to_delete != 0) | |
| 1559 { | |
| 5275 | 1560 octave_idx_type new_n = n; |
| 1561 | |
| 1562 octave_idx_type iidx = 0; | |
| 1563 | |
| 1564 for (octave_idx_type i = 0; i < n; i++) | |
| 4517 | 1565 if (i == idx_arg.elem (iidx)) |
| 1566 { | |
| 1567 iidx++; | |
| 1568 new_n--; | |
| 1569 | |
| 1570 if (iidx == num_to_delete) | |
| 1571 break; | |
| 1572 } | |
| 1573 | |
| 1574 if (new_n > 0) | |
| 1575 { | |
| 1576 T *new_data = new T [new_n]; | |
| 1577 | |
| 5275 | 1578 octave_idx_type ii = 0; |
| 4517 | 1579 iidx = 0; |
| 5275 | 1580 for (octave_idx_type i = 0; i < n; i++) |
| 4517 | 1581 { |
| 1582 if (iidx < num_to_delete && i == idx_arg.elem (iidx)) | |
| 1583 iidx++; | |
| 1584 else | |
| 1585 { | |
| 6884 | 1586 new_data[ii] = xelem (i); |
| 4517 | 1587 |
| 1588 ii++; | |
| 1589 } | |
| 1590 } | |
| 1591 | |
| 1592 if (--(Array<T>::rep)->count <= 0) | |
| 1593 delete Array<T>::rep; | |
| 1594 | |
| 1595 Array<T>::rep = new typename Array<T>::ArrayRep (new_data, new_n); | |
| 1596 | |
| 1597 dimensions.resize (2); | |
| 1598 | |
| 1599 if (nr == 1) | |
| 1600 { | |
| 1601 dimensions(0) = 1; | |
| 1602 dimensions(1) = new_n; | |
| 1603 } | |
| 1604 else | |
| 1605 { | |
| 1606 dimensions(0) = new_n; | |
| 1607 dimensions(1) = 1; | |
| 1608 } | |
| 1609 } | |
| 1610 else | |
| 1611 (*current_liboctave_error_handler) | |
| 1612 ("A(idx) = []: index out of range"); | |
| 1613 } | |
| 1614 } | |
| 1615 | |
| 1616 template <class T> | |
| 1617 void | |
| 1618 Array<T>::maybe_delete_elements (idx_vector& idx_i, idx_vector& idx_j) | |
| 1619 { | |
| 4548 | 1620 assert (ndims () == 2); |
| 1621 | |
| 5275 | 1622 octave_idx_type nr = dim1 (); |
| 1623 octave_idx_type nc = dim2 (); | |
| 4517 | 1624 |
| 1625 if (nr == 0 && nc == 0) | |
| 1626 return; | |
| 1627 | |
| 1628 if (idx_i.is_colon ()) | |
| 1629 { | |
| 1630 if (idx_j.is_colon ()) | |
| 1631 { | |
| 1632 // A(:,:) -- We are deleting columns and rows, so the result | |
| 1633 // is [](0x0). | |
| 1634 | |
| 1635 resize_no_fill (0, 0); | |
| 1636 return; | |
| 1637 } | |
| 1638 | |
| 1639 if (idx_j.is_colon_equiv (nc, 1)) | |
| 1640 { | |
| 1641 // A(:,j) -- We are deleting columns by enumerating them, | |
| 1642 // If we enumerate all of them, we should have zero columns | |
| 1643 // with the same number of rows that we started with. | |
| 1644 | |
| 1645 resize_no_fill (nr, 0); | |
| 1646 return; | |
| 1647 } | |
| 1648 } | |
| 1649 | |
| 1650 if (idx_j.is_colon () && idx_i.is_colon_equiv (nr, 1)) | |
| 1651 { | |
| 1652 // A(i,:) -- We are deleting rows by enumerating them. If we | |
| 1653 // enumerate all of them, we should have zero rows with the | |
| 1654 // same number of columns that we started with. | |
| 1655 | |
| 1656 resize_no_fill (0, nc); | |
| 1657 return; | |
| 1658 } | |
| 1659 | |
| 1660 if (idx_i.is_colon_equiv (nr, 1)) | |
| 1661 { | |
| 1662 if (idx_j.is_colon_equiv (nc, 1)) | |
| 1663 resize_no_fill (0, 0); | |
| 1664 else | |
| 1665 { | |
| 1666 idx_j.sort (true); | |
| 1667 | |
| 5275 | 1668 octave_idx_type num_to_delete = idx_j.length (nc); |
| 4517 | 1669 |
| 1670 if (num_to_delete != 0) | |
| 1671 { | |
| 1672 if (nr == 1 && num_to_delete == nc) | |
| 1673 resize_no_fill (0, 0); | |
| 1674 else | |
| 1675 { | |
| 5275 | 1676 octave_idx_type new_nc = nc; |
| 1677 | |
| 1678 octave_idx_type iidx = 0; | |
| 1679 | |
| 1680 for (octave_idx_type j = 0; j < nc; j++) | |
| 4517 | 1681 if (j == idx_j.elem (iidx)) |
| 1682 { | |
| 1683 iidx++; | |
| 1684 new_nc--; | |
| 1685 | |
| 1686 if (iidx == num_to_delete) | |
| 1687 break; | |
| 1688 } | |
| 1689 | |
| 1690 if (new_nc > 0) | |
| 1691 { | |
| 1692 T *new_data = new T [nr * new_nc]; | |
| 1693 | |
| 5275 | 1694 octave_idx_type jj = 0; |
| 4517 | 1695 iidx = 0; |
| 5275 | 1696 for (octave_idx_type j = 0; j < nc; j++) |
| 4517 | 1697 { |
| 1698 if (iidx < num_to_delete && j == idx_j.elem (iidx)) | |
| 1699 iidx++; | |
| 1700 else | |
| 1701 { | |
| 5275 | 1702 for (octave_idx_type i = 0; i < nr; i++) |
| 6884 | 1703 new_data[nr*jj+i] = xelem (i, j); |
| 4517 | 1704 jj++; |
| 1705 } | |
| 1706 } | |
| 1707 | |
| 1708 if (--(Array<T>::rep)->count <= 0) | |
| 1709 delete Array<T>::rep; | |
| 1710 | |
| 1711 Array<T>::rep = new typename Array<T>::ArrayRep (new_data, nr * new_nc); | |
| 1712 | |
| 1713 dimensions.resize (2); | |
| 1714 dimensions(1) = new_nc; | |
| 1715 } | |
| 1716 else | |
| 1717 (*current_liboctave_error_handler) | |
| 1718 ("A(idx) = []: index out of range"); | |
| 1719 } | |
| 1720 } | |
| 1721 } | |
| 1722 } | |
| 1723 else if (idx_j.is_colon_equiv (nc, 1)) | |
| 1724 { | |
| 1725 if (idx_i.is_colon_equiv (nr, 1)) | |
| 1726 resize_no_fill (0, 0); | |
| 1727 else | |
| 1728 { | |
| 1729 idx_i.sort (true); | |
| 1730 | |
| 5275 | 1731 octave_idx_type num_to_delete = idx_i.length (nr); |
| 4517 | 1732 |
| 1733 if (num_to_delete != 0) | |
| 1734 { | |
| 1735 if (nc == 1 && num_to_delete == nr) | |
| 1736 resize_no_fill (0, 0); | |
| 1737 else | |
| 1738 { | |
| 5275 | 1739 octave_idx_type new_nr = nr; |
| 1740 | |
| 1741 octave_idx_type iidx = 0; | |
| 1742 | |
| 1743 for (octave_idx_type i = 0; i < nr; i++) | |
| 4517 | 1744 if (i == idx_i.elem (iidx)) |
| 1745 { | |
| 1746 iidx++; | |
| 1747 new_nr--; | |
| 1748 | |
| 1749 if (iidx == num_to_delete) | |
| 1750 break; | |
| 1751 } | |
| 1752 | |
| 1753 if (new_nr > 0) | |
| 1754 { | |
| 1755 T *new_data = new T [new_nr * nc]; | |
| 1756 | |
| 5275 | 1757 octave_idx_type ii = 0; |
| 4517 | 1758 iidx = 0; |
| 5275 | 1759 for (octave_idx_type i = 0; i < nr; i++) |
| 4517 | 1760 { |
| 1761 if (iidx < num_to_delete && i == idx_i.elem (iidx)) | |
| 1762 iidx++; | |
| 1763 else | |
| 1764 { | |
| 5275 | 1765 for (octave_idx_type j = 0; j < nc; j++) |
| 6884 | 1766 new_data[new_nr*j+ii] = xelem (i, j); |
| 4517 | 1767 ii++; |
| 1768 } | |
| 1769 } | |
| 1770 | |
| 1771 if (--(Array<T>::rep)->count <= 0) | |
| 1772 delete Array<T>::rep; | |
| 1773 | |
| 1774 Array<T>::rep = new typename Array<T>::ArrayRep (new_data, new_nr * nc); | |
| 1775 | |
| 1776 dimensions.resize (2); | |
| 1777 dimensions(0) = new_nr; | |
| 1778 } | |
| 1779 else | |
| 1780 (*current_liboctave_error_handler) | |
| 1781 ("A(idx) = []: index out of range"); | |
| 1782 } | |
| 1783 } | |
| 1784 } | |
| 1785 } | |
| 1786 } | |
| 1787 | |
| 1788 template <class T> | |
| 1789 void | |
| 1790 Array<T>::maybe_delete_elements (idx_vector&, idx_vector&, idx_vector&) | |
| 1791 { | |
| 1792 assert (0); | |
| 1793 } | |
| 1794 | |
| 1795 template <class T> | |
| 1796 void | |
| 4585 | 1797 Array<T>::maybe_delete_elements (Array<idx_vector>& ra_idx, const T& rfv) |
| 4517 | 1798 { |
| 5275 | 1799 octave_idx_type n_idx = ra_idx.length (); |
| 4517 | 1800 |
| 1801 dim_vector lhs_dims = dims (); | |
| 1802 | |
| 6388 | 1803 int n_lhs_dims = lhs_dims.length (); |
| 1804 | |
| 4821 | 1805 if (lhs_dims.all_zero ()) |
| 1806 return; | |
| 1807 | |
| 6384 | 1808 if (n_idx == 1 && ra_idx(0).is_colon ()) |
| 1809 { | |
| 1810 resize (dim_vector (0, 0), rfv); | |
| 1811 return; | |
| 1812 } | |
| 1813 | |
| 6388 | 1814 if (n_idx > n_lhs_dims) |
| 1815 { | |
| 1816 for (int i = n_idx; i < n_lhs_dims; i++) | |
| 1817 { | |
| 1818 // Ensure that extra indices are either colon or 1. | |
| 1819 | |
| 1820 if (! ra_idx(i).is_colon_equiv (1, 1)) | |
| 1821 { | |
| 1822 (*current_liboctave_error_handler) | |
| 1823 ("index exceeds array dimensions"); | |
| 1824 return; | |
| 1825 } | |
| 1826 } | |
| 1827 | |
| 1828 ra_idx.resize (n_lhs_dims); | |
| 1829 | |
| 1830 n_idx = n_lhs_dims; | |
| 1831 } | |
| 4757 | 1832 |
| 4740 | 1833 Array<int> idx_is_colon (n_idx, 0); |
| 1834 | |
| 1835 Array<int> idx_is_colon_equiv (n_idx, 0); | |
| 4517 | 1836 |
| 1837 // Initialization of colon arrays. | |
| 4757 | 1838 |
| 5275 | 1839 for (octave_idx_type i = 0; i < n_idx; i++) |
| 4517 | 1840 { |
| 4585 | 1841 idx_is_colon_equiv(i) = ra_idx(i).is_colon_equiv (lhs_dims(i), 1); |
| 1842 | |
| 1843 idx_is_colon(i) = ra_idx(i).is_colon (); | |
| 4517 | 1844 } |
| 1845 | |
| 4755 | 1846 bool idx_ok = true; |
| 1847 | |
| 1848 // Check for index out of bounds. | |
| 1849 | |
| 5275 | 1850 for (octave_idx_type i = 0 ; i < n_idx - 1; i++) |
| 4517 | 1851 { |
| 4755 | 1852 if (! (idx_is_colon(i) || idx_is_colon_equiv(i))) |
| 1853 { | |
| 1854 ra_idx(i).sort (true); | |
| 4757 | 1855 |
| 4755 | 1856 if (ra_idx(i).max () > lhs_dims(i)) |
| 1857 { | |
| 1858 (*current_liboctave_error_handler) | |
| 1859 ("index exceeds array dimensions"); | |
| 4757 | 1860 |
| 4755 | 1861 idx_ok = false; |
| 1862 break; | |
| 1863 } | |
| 1864 else if (ra_idx(i).min () < 0) // I believe this is checked elsewhere | |
| 1865 { | |
| 1866 (*current_liboctave_error_handler) | |
| 1867 ("index must be one or larger"); | |
| 1868 | |
| 1869 idx_ok = false; | |
| 1870 break; | |
| 1871 } | |
| 1872 } | |
| 4517 | 1873 } |
| 4757 | 1874 |
| 4755 | 1875 if (n_idx <= n_lhs_dims) |
| 4517 | 1876 { |
| 5275 | 1877 octave_idx_type last_idx = ra_idx(n_idx-1).max (); |
| 1878 | |
| 1879 octave_idx_type sum_el = lhs_dims(n_idx-1); | |
| 1880 | |
| 1881 for (octave_idx_type i = n_idx; i < n_lhs_dims; i++) | |
| 4755 | 1882 sum_el *= lhs_dims(i); |
| 1883 | |
| 1884 if (last_idx > sum_el - 1) | |
| 1885 { | |
| 1886 (*current_liboctave_error_handler) | |
| 1887 ("index exceeds array dimensions"); | |
| 1888 | |
| 1889 idx_ok = false; | |
| 1890 } | |
| 4757 | 1891 } |
| 4755 | 1892 |
| 1893 if (idx_ok) | |
| 1894 { | |
| 1895 if (n_idx > 1 | |
| 1896 && (all_ones (idx_is_colon) || all_ones (idx_is_colon_equiv))) | |
| 4517 | 1897 { |
| 4755 | 1898 // A(:,:,:) -- we are deleting elements in all dimensions, so |
| 1899 // the result is [](0x0x0). | |
| 1900 | |
| 1901 dim_vector zeros; | |
| 1902 zeros.resize (n_idx); | |
| 1903 | |
| 1904 for (int i = 0; i < n_idx; i++) | |
| 1905 zeros(i) = 0; | |
| 1906 | |
| 1907 resize (zeros, rfv); | |
| 4517 | 1908 } |
| 1909 | |
| 4755 | 1910 else if (n_idx > 1 |
| 1911 && num_ones (idx_is_colon) == n_idx - 1 | |
| 1912 && num_ones (idx_is_colon_equiv) == n_idx) | |
| 1913 { | |
| 1914 // A(:,:,j) -- we are deleting elements in one dimension by | |
| 1915 // enumerating them. | |
| 1916 // | |
| 1917 // If we enumerate all of the elements, we should have zero | |
| 1918 // elements in that dimension with the same number of elements | |
| 1919 // in the other dimensions that we started with. | |
| 1920 | |
| 1921 dim_vector temp_dims; | |
| 1922 temp_dims.resize (n_idx); | |
| 1923 | |
| 5275 | 1924 for (octave_idx_type i = 0; i < n_idx; i++) |
| 4755 | 1925 { |
| 1926 if (idx_is_colon (i)) | |
| 1927 temp_dims(i) = lhs_dims(i); | |
| 1928 else | |
| 1929 temp_dims(i) = 0; | |
| 1930 } | |
| 1931 | |
| 1932 resize (temp_dims); | |
| 1933 } | |
| 1934 else if (n_idx > 1 && num_ones (idx_is_colon) == n_idx - 1) | |
| 4741 | 1935 { |
| 4755 | 1936 // We have colons in all indices except for one. |
| 1937 // This index tells us which slice to delete | |
| 1938 | |
| 1939 if (n_idx < n_lhs_dims) | |
| 1940 { | |
| 1941 // Collapse dimensions beyond last index. | |
| 1942 | |
| 5781 | 1943 if (! (ra_idx(n_idx-1).is_colon ())) |
| 1944 (*current_liboctave_warning_with_id_handler) | |
| 1945 ("Octave:fortran-indexing", | |
| 1946 "fewer indices than dimensions for N-d array"); | |
| 4755 | 1947 |
| 5275 | 1948 for (octave_idx_type i = n_idx; i < n_lhs_dims; i++) |
| 4755 | 1949 lhs_dims(n_idx-1) *= lhs_dims(i); |
| 1950 | |
| 1951 lhs_dims.resize (n_idx); | |
| 1952 | |
| 1953 // Reshape *this. | |
| 1954 dimensions = lhs_dims; | |
| 1955 } | |
| 1956 | |
| 1957 int non_col = 0; | |
| 1958 | |
| 1959 // Find the non-colon column. | |
| 1960 | |
| 5275 | 1961 for (octave_idx_type i = 0; i < n_idx; i++) |
| 4755 | 1962 { |
| 1963 if (! idx_is_colon(i)) | |
| 1964 non_col = i; | |
| 1965 } | |
| 1966 | |
| 1967 // The length of the non-colon dimension. | |
| 1968 | |
| 5275 | 1969 octave_idx_type non_col_dim = lhs_dims (non_col); |
| 1970 | |
| 1971 octave_idx_type num_to_delete = ra_idx(non_col).length (lhs_dims (non_col)); | |
| 4755 | 1972 |
| 1973 if (num_to_delete > 0) | |
| 1974 { | |
| 1975 int temp = lhs_dims.num_ones (); | |
| 1976 | |
| 1977 if (non_col_dim == 1) | |
| 1978 temp--; | |
| 1979 | |
| 1980 if (temp == n_idx - 1 && num_to_delete == non_col_dim) | |
| 1981 { | |
| 1982 // We have A with (1x1x4), where A(1,:,1:4) | |
| 1983 // Delete all (0x0x0) | |
| 1984 | |
| 1985 dim_vector zero_dims (n_idx, 0); | |
| 1986 | |
| 1987 resize (zero_dims, rfv); | |
| 1988 } | |
| 1989 else | |
| 1990 { | |
| 1991 // New length of non-colon dimension | |
| 1992 // (calculated in the next for loop) | |
| 1993 | |
| 5275 | 1994 octave_idx_type new_dim = non_col_dim; |
| 1995 | |
| 1996 octave_idx_type iidx = 0; | |
| 1997 | |
| 1998 for (octave_idx_type j = 0; j < non_col_dim; j++) | |
| 4755 | 1999 if (j == ra_idx(non_col).elem (iidx)) |
| 2000 { | |
| 2001 iidx++; | |
| 2002 | |
| 2003 new_dim--; | |
| 2004 | |
| 2005 if (iidx == num_to_delete) | |
| 2006 break; | |
| 2007 } | |
| 2008 | |
| 2009 // Creating the new nd array after deletions. | |
| 2010 | |
| 2011 if (new_dim > 0) | |
| 2012 { | |
| 2013 // Calculate number of elements in new array. | |
| 2014 | |
| 5275 | 2015 octave_idx_type num_new_elem=1; |
| 4755 | 2016 |
| 2017 for (int i = 0; i < n_idx; i++) | |
| 2018 { | |
| 2019 if (i == non_col) | |
| 2020 num_new_elem *= new_dim; | |
| 2021 | |
| 2022 else | |
| 2023 num_new_elem *= lhs_dims(i); | |
| 2024 } | |
| 2025 | |
| 2026 T *new_data = new T [num_new_elem]; | |
| 2027 | |
| 5275 | 2028 Array<octave_idx_type> result_idx (n_lhs_dims, 0); |
| 4755 | 2029 |
| 2030 dim_vector new_lhs_dim = lhs_dims; | |
| 2031 | |
| 2032 new_lhs_dim(non_col) = new_dim; | |
| 2033 | |
| 5275 | 2034 octave_idx_type num_elem = 1; |
| 2035 | |
| 2036 octave_idx_type numidx = 0; | |
| 2037 | |
| 2038 octave_idx_type n = length (); | |
| 4755 | 2039 |
| 2040 for (int i = 0; i < n_lhs_dims; i++) | |
| 2041 if (i != non_col) | |
| 2042 num_elem *= lhs_dims(i); | |
| 2043 | |
| 2044 num_elem *= ra_idx(non_col).capacity (); | |
| 2045 | |
| 5275 | 2046 for (octave_idx_type i = 0; i < n; i++) |
| 4755 | 2047 { |
| 2048 if (numidx < num_elem | |
| 2049 && is_in (result_idx(non_col), ra_idx(non_col))) | |
| 2050 numidx++; | |
| 2051 | |
| 2052 else | |
| 2053 { | |
| 5275 | 2054 Array<octave_idx_type> temp_result_idx = result_idx; |
| 2055 | |
| 2056 octave_idx_type num_lgt = how_many_lgt (result_idx(non_col), | |
| 4755 | 2057 ra_idx(non_col)); |
| 2058 | |
| 2059 temp_result_idx(non_col) -= num_lgt; | |
| 2060 | |
| 5275 | 2061 octave_idx_type kidx |
| 4755 | 2062 = ::compute_index (temp_result_idx, new_lhs_dim); |
| 2063 | |
| 6884 | 2064 new_data[kidx] = xelem (result_idx); |
| 4755 | 2065 } |
| 2066 | |
| 2067 increment_index (result_idx, lhs_dims); | |
| 2068 } | |
| 2069 | |
| 2070 if (--rep->count <= 0) | |
| 2071 delete rep; | |
| 2072 | |
| 2073 rep = new typename Array<T>::ArrayRep (new_data, | |
| 2074 num_new_elem); | |
| 2075 | |
| 2076 dimensions = new_lhs_dim; | |
| 2077 } | |
| 2078 } | |
| 2079 } | |
| 4517 | 2080 } |
| 4755 | 2081 else if (n_idx == 1) |
| 4517 | 2082 { |
| 4821 | 2083 // This handle cases where we only have one index (not |
| 2084 // colon). The index denotes which elements we should | |
| 2085 // delete in the array which can be of any dimension. We | |
| 2086 // return a column vector, except for the case where we are | |
| 2087 // operating on a row vector. The elements are numerated | |
| 2088 // column by column. | |
| 4755 | 2089 // |
| 2090 // A(3,3,3)=2; | |
| 2091 // A(3:5) = []; A(6)=[] | |
| 4757 | 2092 |
| 5275 | 2093 octave_idx_type lhs_numel = numel (); |
| 4757 | 2094 |
| 4821 | 2095 idx_vector idx_vec = ra_idx(0); |
| 2096 | |
| 5781 | 2097 idx_vec.freeze (lhs_numel, 0, true); |
| 4821 | 2098 |
| 2099 idx_vec.sort (true); | |
| 2100 | |
| 5275 | 2101 octave_idx_type num_to_delete = idx_vec.length (lhs_numel); |
| 4821 | 2102 |
| 2103 if (num_to_delete > 0) | |
| 4517 | 2104 { |
| 5275 | 2105 octave_idx_type new_numel = lhs_numel - num_to_delete; |
| 4821 | 2106 |
| 2107 T *new_data = new T[new_numel]; | |
| 2108 | |
| 5275 | 2109 Array<octave_idx_type> lhs_ra_idx (ndims (), 0); |
| 2110 | |
| 2111 octave_idx_type ii = 0; | |
| 2112 octave_idx_type iidx = 0; | |
| 2113 | |
| 2114 for (octave_idx_type i = 0; i < lhs_numel; i++) | |
| 4755 | 2115 { |
| 4821 | 2116 if (iidx < num_to_delete && i == idx_vec.elem (iidx)) |
| 2117 { | |
| 2118 iidx++; | |
| 2119 } | |
| 2120 else | |
| 2121 { | |
| 6884 | 2122 new_data[ii++] = xelem (lhs_ra_idx); |
| 4821 | 2123 } |
| 2124 | |
| 2125 increment_index (lhs_ra_idx, lhs_dims); | |
| 2126 } | |
| 2127 | |
| 2128 if (--(Array<T>::rep)->count <= 0) | |
| 2129 delete Array<T>::rep; | |
| 2130 | |
| 2131 Array<T>::rep = new typename Array<T>::ArrayRep (new_data, new_numel); | |
| 2132 | |
| 2133 dimensions.resize (2); | |
| 2134 | |
| 2135 if (lhs_dims.length () == 2 && lhs_dims(1) == 1) | |
| 2136 { | |
| 2137 dimensions(0) = new_numel; | |
| 2138 dimensions(1) = 1; | |
| 4755 | 2139 } |
| 2140 else | |
| 2141 { | |
| 4821 | 2142 dimensions(0) = 1; |
| 2143 dimensions(1) = new_numel; | |
| 4755 | 2144 } |
| 4517 | 2145 } |
| 2146 } | |
| 4755 | 2147 else if (num_ones (idx_is_colon) < n_idx) |
| 2148 { | |
| 2149 (*current_liboctave_error_handler) | |
| 2150 ("a null assignment can have only one non-colon index"); | |
| 2151 } | |
| 4517 | 2152 } |
| 2153 } | |
| 2154 | |
| 2155 template <class T> | |
| 2156 Array<T> | |
| 6881 | 2157 Array<T>::value (void) const |
| 4517 | 2158 { |
| 2159 Array<T> retval; | |
| 2160 | |
| 2161 int n_idx = index_count (); | |
| 2162 | |
| 2163 if (n_idx == 2) | |
| 2164 { | |
| 2165 idx_vector *tmp = get_idx (); | |
| 2166 | |
| 2167 idx_vector idx_i = tmp[0]; | |
| 2168 idx_vector idx_j = tmp[1]; | |
| 2169 | |
| 2170 retval = index (idx_i, idx_j); | |
| 2171 } | |
| 2172 else if (n_idx == 1) | |
| 2173 { | |
| 2174 retval = index (idx[0]); | |
| 2175 } | |
| 2176 else | |
| 2177 (*current_liboctave_error_handler) | |
| 2178 ("Array<T>::value: invalid number of indices specified"); | |
| 2179 | |
| 2180 clear_index (); | |
| 2181 | |
| 2182 return retval; | |
| 2183 } | |
| 2184 | |
| 2185 template <class T> | |
| 2186 Array<T> | |
| 2187 Array<T>::index (idx_vector& idx_arg, int resize_ok, const T& rfv) const | |
| 2188 { | |
| 2189 Array<T> retval; | |
| 2190 | |
| 5081 | 2191 dim_vector dv = idx_arg.orig_dimensions (); |
| 2192 | |
| 2193 if (dv.length () > 2 || ndims () > 2) | |
| 2194 retval = indexN (idx_arg, resize_ok, rfv); | |
| 2195 else | |
| 4517 | 2196 { |
| 5081 | 2197 switch (ndims ()) |
| 2198 { | |
| 2199 case 1: | |
| 2200 retval = index1 (idx_arg, resize_ok, rfv); | |
| 2201 break; | |
| 2202 | |
| 2203 case 2: | |
| 2204 retval = index2 (idx_arg, resize_ok, rfv); | |
| 2205 break; | |
| 2206 | |
| 2207 default: | |
| 2208 (*current_liboctave_error_handler) | |
| 2209 ("invalid array (internal error)"); | |
| 2210 break; | |
| 2211 } | |
| 4517 | 2212 } |
| 2213 | |
| 2214 return retval; | |
| 2215 } | |
| 2216 | |
| 2217 template <class T> | |
| 2218 Array<T> | |
| 2219 Array<T>::index1 (idx_vector& idx_arg, int resize_ok, const T& rfv) const | |
| 2220 { | |
| 2221 Array<T> retval; | |
| 2222 | |
| 5275 | 2223 octave_idx_type len = length (); |
| 2224 | |
| 2225 octave_idx_type n = idx_arg.freeze (len, "vector", resize_ok); | |
| 4517 | 2226 |
| 2227 if (idx_arg) | |
| 2228 { | |
| 2229 if (idx_arg.is_colon_equiv (len)) | |
| 2230 { | |
| 2231 retval = *this; | |
| 2232 } | |
| 2233 else if (n == 0) | |
| 2234 { | |
| 2235 retval.resize_no_fill (0); | |
| 2236 } | |
| 2237 else | |
| 2238 { | |
| 2239 retval.resize_no_fill (n); | |
| 2240 | |
| 5275 | 2241 for (octave_idx_type i = 0; i < n; i++) |
| 4517 | 2242 { |
| 5275 | 2243 octave_idx_type ii = idx_arg.elem (i); |
| 4517 | 2244 if (ii >= len) |
| 2245 retval.elem (i) = rfv; | |
| 2246 else | |
| 2247 retval.elem (i) = elem (ii); | |
| 2248 } | |
| 2249 } | |
| 2250 } | |
| 2251 | |
| 2252 // idx_vector::freeze() printed an error message for us. | |
| 2253 | |
| 2254 return retval; | |
| 2255 } | |
| 2256 | |
| 2257 template <class T> | |
| 2258 Array<T> | |
| 2259 Array<T>::index2 (idx_vector& idx_arg, int resize_ok, const T& rfv) const | |
| 2260 { | |
| 2261 Array<T> retval; | |
| 2262 | |
| 4548 | 2263 assert (ndims () == 2); |
| 2264 | |
| 5275 | 2265 octave_idx_type nr = dim1 (); |
| 2266 octave_idx_type nc = dim2 (); | |
| 2267 | |
| 2268 octave_idx_type orig_len = nr * nc; | |
| 4517 | 2269 |
| 4832 | 2270 dim_vector idx_orig_dims = idx_arg.orig_dimensions (); |
| 2271 | |
| 5275 | 2272 octave_idx_type idx_orig_rows = idx_arg.orig_rows (); |
| 2273 octave_idx_type idx_orig_columns = idx_arg.orig_columns (); | |
| 4517 | 2274 |
| 2275 if (idx_arg.is_colon ()) | |
| 2276 { | |
| 2277 // Fast magic colon processing. | |
| 2278 | |
| 5275 | 2279 octave_idx_type result_nr = nr * nc; |
| 2280 octave_idx_type result_nc = 1; | |
| 4517 | 2281 |
| 2282 retval = Array<T> (*this, dim_vector (result_nr, result_nc)); | |
| 2283 } | |
| 2284 else if (nr == 1 && nc == 1) | |
| 2285 { | |
| 2286 Array<T> tmp = Array<T>::index1 (idx_arg, resize_ok); | |
| 2287 | |
| 5275 | 2288 octave_idx_type len = tmp.length (); |
| 4828 | 2289 |
|
7573
755bf7ecc29b
eliminate one_zero stuff from idx_vector
John W. Eaton <jwe@octave.org>
parents:
7480
diff
changeset
|
2290 if (len >= idx_orig_dims.numel ()) |
| 4832 | 2291 retval = Array<T> (tmp, idx_orig_dims); |
| 4517 | 2292 } |
| 2293 else if (nr == 1 || nc == 1) | |
| 2294 { | |
| 2295 // If indexing a vector with a matrix, return value has same | |
| 2296 // shape as the index. Otherwise, it has same orientation as | |
| 2297 // indexed object. | |
| 2298 | |
| 4828 | 2299 Array<T> tmp = Array<T>::index1 (idx_arg, resize_ok); |
| 4517 | 2300 |
| 5275 | 2301 octave_idx_type len = tmp.length (); |
| 4517 | 2302 |
|
7573
755bf7ecc29b
eliminate one_zero stuff from idx_vector
John W. Eaton <jwe@octave.org>
parents:
7480
diff
changeset
|
2303 if (idx_orig_rows == 1 || idx_orig_columns == 1) |
| 4517 | 2304 { |
| 4827 | 2305 if (nr == 1) |
| 2306 retval = Array<T> (tmp, dim_vector (1, len)); | |
| 4517 | 2307 else |
| 4827 | 2308 retval = Array<T> (tmp, dim_vector (len, 1)); |
| 4517 | 2309 } |
| 4876 | 2310 else if (len >= idx_orig_dims.numel ()) |
| 4832 | 2311 retval = Array<T> (tmp, idx_orig_dims); |
| 4517 | 2312 } |
| 2313 else | |
| 2314 { | |
|
7573
755bf7ecc29b
eliminate one_zero stuff from idx_vector
John W. Eaton <jwe@octave.org>
parents:
7480
diff
changeset
|
2315 (*current_liboctave_warning_with_id_handler) |
|
755bf7ecc29b
eliminate one_zero stuff from idx_vector
John W. Eaton <jwe@octave.org>
parents:
7480
diff
changeset
|
2316 ("Octave:fortran-indexing", "single index used for matrix"); |
| 4517 | 2317 |
| 2318 // This code is only for indexing matrices. The vector | |
| 2319 // cases are handled above. | |
| 2320 | |
| 2321 idx_arg.freeze (nr * nc, "matrix", resize_ok); | |
| 2322 | |
| 2323 if (idx_arg) | |
| 2324 { | |
| 5275 | 2325 octave_idx_type result_nr = idx_orig_rows; |
| 2326 octave_idx_type result_nc = idx_orig_columns; | |
| 4517 | 2327 |
| 2328 retval.resize_no_fill (result_nr, result_nc); | |
| 2329 | |
| 5275 | 2330 octave_idx_type k = 0; |
| 2331 for (octave_idx_type j = 0; j < result_nc; j++) | |
| 4517 | 2332 { |
| 5275 | 2333 for (octave_idx_type i = 0; i < result_nr; i++) |
| 4517 | 2334 { |
| 5275 | 2335 octave_idx_type ii = idx_arg.elem (k++); |
| 4517 | 2336 if (ii >= orig_len) |
| 2337 retval.elem (i, j) = rfv; | |
| 2338 else | |
| 2339 { | |
| 5275 | 2340 octave_idx_type fr = ii % nr; |
| 2341 octave_idx_type fc = (ii - fr) / nr; | |
| 4517 | 2342 retval.elem (i, j) = elem (fr, fc); |
| 2343 } | |
| 2344 } | |
| 2345 } | |
| 2346 } | |
| 2347 // idx_vector::freeze() printed an error message for us. | |
| 2348 } | |
| 2349 | |
| 2350 return retval; | |
| 2351 } | |
| 2352 | |
| 2353 template <class T> | |
| 2354 Array<T> | |
| 4530 | 2355 Array<T>::indexN (idx_vector& ra_idx, int resize_ok, const T& rfv) const |
| 2356 { | |
| 2357 Array<T> retval; | |
| 2358 | |
| 5519 | 2359 dim_vector dv = dims (); |
| 2360 | |
| 2361 int n_dims = dv.length (); | |
| 2362 | |
| 2363 octave_idx_type orig_len = dv.numel (); | |
| 4530 | 2364 |
| 4757 | 2365 dim_vector idx_orig_dims = ra_idx.orig_dimensions (); |
| 4530 | 2366 |
| 2367 if (ra_idx.is_colon ()) | |
| 2368 { | |
| 4651 | 2369 // Fast magic colon processing. |
| 2370 | |
| 2371 retval = Array<T> (*this, dim_vector (orig_len, 1)); | |
| 4530 | 2372 } |
| 4651 | 2373 else |
| 4530 | 2374 { |
| 5519 | 2375 bool vec_equiv = vector_equivalent (dv); |
| 2376 | |
|
7573
755bf7ecc29b
eliminate one_zero stuff from idx_vector
John W. Eaton <jwe@octave.org>
parents:
7480
diff
changeset
|
2377 if (! (vec_equiv || ra_idx.is_colon ())) |
| 5781 | 2378 (*current_liboctave_warning_with_id_handler) |
| 2379 ("Octave:fortran-indexing", "single index used for N-d array"); | |
| 4530 | 2380 |
| 5519 | 2381 octave_idx_type frozen_len |
| 2382 = ra_idx.freeze (orig_len, "nd-array", resize_ok); | |
| 4530 | 2383 |
| 2384 if (ra_idx) | |
| 4757 | 2385 { |
| 5519 | 2386 dim_vector result_dims; |
| 2387 | |
| 7321 | 2388 if (vec_equiv && ! orig_len == 1) |
| 5519 | 2389 { |
| 2390 result_dims = dv; | |
| 2391 | |
| 2392 for (int i = 0; i < n_dims; i++) | |
| 2393 { | |
| 2394 if (result_dims(i) != 1) | |
| 2395 { | |
| 2396 // All but this dim should be one. | |
| 2397 result_dims(i) = frozen_len; | |
| 2398 break; | |
| 2399 } | |
| 2400 } | |
| 2401 } | |
| 2402 else | |
| 2403 result_dims = idx_orig_dims; | |
| 4530 | 2404 |
| 4673 | 2405 result_dims.chop_trailing_singletons (); |
| 2406 | |
| 4530 | 2407 retval.resize (result_dims); |
| 2408 | |
| 5275 | 2409 octave_idx_type n = result_dims.numel (); |
| 4530 | 2410 |
| 5275 | 2411 octave_idx_type k = 0; |
| 2412 | |
| 2413 for (octave_idx_type i = 0; i < n; i++) | |
| 4530 | 2414 { |
| 5275 | 2415 octave_idx_type ii = ra_idx.elem (k++); |
| 4530 | 2416 |
| 2417 if (ii >= orig_len) | |
| 5535 | 2418 retval.elem (i) = rfv; |
| 4530 | 2419 else |
| 5535 | 2420 retval.elem (i) = elem (ii); |
| 4530 | 2421 } |
| 2422 } | |
| 2423 } | |
| 2424 | |
| 2425 return retval; | |
| 2426 } | |
| 2427 | |
| 2428 template <class T> | |
| 2429 Array<T> | |
| 4517 | 2430 Array<T>::index (idx_vector& idx_i, idx_vector& idx_j, int resize_ok, |
| 2431 const T& rfv) const | |
| 2432 { | |
| 2433 Array<T> retval; | |
| 2434 | |
| 7189 | 2435 if (ndims () != 2) |
| 2436 { | |
| 2437 Array<idx_vector> ra_idx (2); | |
| 2438 ra_idx(0) = idx_i; | |
| 2439 ra_idx(1) = idx_j; | |
| 2440 return index (ra_idx, resize_ok, rfv); | |
| 2441 } | |
| 4548 | 2442 |
| 5275 | 2443 octave_idx_type nr = dim1 (); |
| 2444 octave_idx_type nc = dim2 (); | |
| 2445 | |
| 2446 octave_idx_type n = idx_i.freeze (nr, "row", resize_ok); | |
| 2447 octave_idx_type m = idx_j.freeze (nc, "column", resize_ok); | |
| 4517 | 2448 |
| 2449 if (idx_i && idx_j) | |
| 2450 { | |
| 2451 if (idx_i.orig_empty () || idx_j.orig_empty () || n == 0 || m == 0) | |
| 2452 { | |
| 2453 retval.resize_no_fill (n, m); | |
| 2454 } | |
| 2455 else if (idx_i.is_colon_equiv (nr) && idx_j.is_colon_equiv (nc)) | |
| 2456 { | |
| 2457 retval = *this; | |
| 2458 } | |
| 2459 else | |
| 2460 { | |
| 2461 retval.resize_no_fill (n, m); | |
| 2462 | |
| 5275 | 2463 for (octave_idx_type j = 0; j < m; j++) |
| 4517 | 2464 { |
| 5275 | 2465 octave_idx_type jj = idx_j.elem (j); |
| 2466 for (octave_idx_type i = 0; i < n; i++) | |
| 4517 | 2467 { |
| 5275 | 2468 octave_idx_type ii = idx_i.elem (i); |
| 4517 | 2469 if (ii >= nr || jj >= nc) |
| 2470 retval.elem (i, j) = rfv; | |
| 2471 else | |
| 2472 retval.elem (i, j) = elem (ii, jj); | |
| 2473 } | |
| 2474 } | |
| 2475 } | |
| 2476 } | |
| 2477 | |
| 2478 // idx_vector::freeze() printed an error message for us. | |
| 2479 | |
| 2480 return retval; | |
| 2481 } | |
| 2482 | |
| 2483 template <class T> | |
| 2484 Array<T> | |
| 5992 | 2485 Array<T>::index (Array<idx_vector>& ra_idx, int resize_ok, const T& rfv) const |
| 4517 | 2486 { |
| 4530 | 2487 // This function handles all calls with more than one idx. |
| 2488 // For (3x3x3), the call can be A(2,5), A(2,:,:), A(3,2,3) etc. | |
| 2489 | |
| 4517 | 2490 Array<T> retval; |
| 2491 | |
| 2492 int n_dims = dimensions.length (); | |
| 2493 | |
| 4737 | 2494 // Remove trailing singletons in ra_idx, but leave at least ndims |
| 2495 // elements. | |
| 2496 | |
| 5275 | 2497 octave_idx_type ra_idx_len = ra_idx.length (); |
| 4737 | 2498 |
| 4887 | 2499 bool trim_trailing_singletons = true; |
| 5275 | 2500 for (octave_idx_type j = ra_idx_len; j > n_dims; j--) |
| 4737 | 2501 { |
| 4887 | 2502 idx_vector iidx = ra_idx (ra_idx_len-1); |
| 2503 if (iidx.capacity () == 1 && trim_trailing_singletons) | |
| 4737 | 2504 ra_idx_len--; |
| 2505 else | |
| 4887 | 2506 trim_trailing_singletons = false; |
| 2507 | |
| 5992 | 2508 if (! resize_ok) |
| 2509 { | |
| 2510 for (octave_idx_type i = 0; i < iidx.capacity (); i++) | |
| 2511 if (iidx (i) != 0) | |
| 2512 { | |
| 2513 (*current_liboctave_error_handler) | |
| 2514 ("index exceeds N-d array dimensions"); | |
| 2515 | |
| 2516 return retval; | |
| 2517 } | |
| 2518 } | |
| 4737 | 2519 } |
| 2520 | |
| 2521 ra_idx.resize (ra_idx_len); | |
| 2522 | |
| 4887 | 2523 dim_vector new_dims = dims (); |
| 2524 dim_vector frozen_lengths; | |
| 2525 | |
|
7597
6b2a99e44ff2
shortened empty indexing fix
David Bateman <dbateman@free.fr>
parents:
7573
diff
changeset
|
2526 if (!ra_idx (ra_idx_len - 1).orig_empty () && ra_idx_len < n_dims) |
| 4887 | 2527 frozen_lengths = short_freeze (ra_idx, dimensions, resize_ok); |
| 2528 else | |
| 4517 | 2529 { |
| 4887 | 2530 new_dims.resize (ra_idx_len, 1); |
| 2531 frozen_lengths = freeze (ra_idx, new_dims, resize_ok); | |
| 4530 | 2532 } |
| 2533 | |
| 4887 | 2534 if (all_ok (ra_idx)) |
| 4530 | 2535 { |
| 4887 | 2536 if (any_orig_empty (ra_idx) || frozen_lengths.any_zero ()) |
| 2537 { | |
| 2538 frozen_lengths.chop_trailing_singletons (); | |
| 2539 | |
| 2540 retval.resize (frozen_lengths); | |
| 2541 } | |
| 2542 else if (frozen_lengths.length () == n_dims | |
| 2543 && all_colon_equiv (ra_idx, dimensions)) | |
| 2544 { | |
| 2545 retval = *this; | |
| 2546 } | |
| 2547 else | |
| 4517 | 2548 { |
| 4887 | 2549 dim_vector frozen_lengths_for_resize = frozen_lengths; |
| 2550 | |
| 2551 frozen_lengths_for_resize.chop_trailing_singletons (); | |
| 2552 | |
| 2553 retval.resize (frozen_lengths_for_resize); | |
| 2554 | |
| 5275 | 2555 octave_idx_type n = retval.length (); |
| 2556 | |
| 2557 Array<octave_idx_type> result_idx (ra_idx.length (), 0); | |
| 2558 | |
| 2559 Array<octave_idx_type> elt_idx; | |
| 2560 | |
| 2561 for (octave_idx_type i = 0; i < n; i++) | |
| 4530 | 2562 { |
| 4887 | 2563 elt_idx = get_elt_idx (ra_idx, result_idx); |
| 2564 | |
| 5275 | 2565 octave_idx_type numelem_elt = get_scalar_idx (elt_idx, new_dims); |
| 4887 | 2566 |
| 5992 | 2567 if (numelem_elt >= length () || numelem_elt < 0) |
| 2568 retval.elem (i) = rfv; | |
| 4887 | 2569 else |
| 2570 retval.elem (i) = elem (numelem_elt); | |
| 2571 | |
| 2572 increment_index (result_idx, frozen_lengths); | |
| 2573 | |
| 4517 | 2574 } |
| 2575 } | |
| 2576 } | |
| 2577 | |
| 2578 return retval; | |
| 2579 } | |
| 2580 | |
| 7433 | 2581 template <class T> |
| 2582 bool | |
| 2583 ascending_compare (T a, T b) | |
| 2584 { | |
| 2585 return (a < b); | |
| 2586 } | |
| 2587 | |
| 2588 template <class T> | |
| 2589 bool | |
| 2590 descending_compare (T a, T b) | |
| 2591 { | |
| 2592 return (a > b); | |
| 2593 } | |
| 2594 | |
| 2595 template <class T> | |
| 2596 bool | |
| 2597 ascending_compare (vec_index<T> *a, vec_index<T> *b) | |
| 2598 { | |
| 2599 return (a->vec < b->vec); | |
| 2600 } | |
| 2601 | |
| 2602 template <class T> | |
| 2603 bool | |
| 2604 descending_compare (vec_index<T> *a, vec_index<T> *b) | |
| 2605 { | |
| 2606 return (a->vec > b->vec); | |
| 2607 } | |
| 2608 | |
| 2609 template <class T> | |
| 2610 Array<T> | |
| 2611 Array<T>::sort (octave_idx_type dim, sortmode mode) const | |
| 2612 { | |
| 2613 Array<T> m = *this; | |
| 2614 | |
| 2615 dim_vector dv = m.dims (); | |
| 2616 | |
| 2617 if (m.length () < 1) | |
| 2618 return m; | |
| 2619 | |
| 2620 octave_idx_type ns = dv(dim); | |
| 2621 octave_idx_type iter = dv.numel () / ns; | |
| 2622 octave_idx_type stride = 1; | |
| 2623 for (int i = 0; i < dim; i++) | |
| 2624 stride *= dv(i); | |
| 2625 | |
| 2626 T *v = m.fortran_vec (); | |
| 2627 octave_sort<T> lsort; | |
| 2628 | |
| 2629 if (mode == ASCENDING) | |
| 2630 lsort.set_compare (ascending_compare); | |
| 2631 else if (mode == DESCENDING) | |
| 2632 lsort.set_compare (descending_compare); | |
|
7463
2467639bd8c0
eliminate UNDEFINED sort mode
John W. Eaton <jwe@octave.org>
parents:
7443
diff
changeset
|
2633 else |
|
2467639bd8c0
eliminate UNDEFINED sort mode
John W. Eaton <jwe@octave.org>
parents:
7443
diff
changeset
|
2634 abort (); |
| 7433 | 2635 |
| 2636 if (stride == 1) | |
| 2637 { | |
| 2638 for (octave_idx_type j = 0; j < iter; j++) | |
| 2639 { | |
| 2640 lsort.sort (v, ns); | |
| 2641 v += ns; | |
| 2642 } | |
| 2643 } | |
| 2644 else | |
| 2645 { | |
| 2646 // Don't use OCTAVE_LOCAL_BUFFER here as it doesn't work with bool | |
| 2647 // on some compilers. | |
| 2648 Array<T> vi (ns); | |
| 2649 T *pvi = vi.fortran_vec (); | |
| 2650 | |
| 2651 for (octave_idx_type j = 0; j < iter; j++) | |
| 2652 { | |
| 2653 octave_idx_type offset = j; | |
| 2654 octave_idx_type offset2 = 0; | |
| 2655 while (offset >= stride) | |
| 2656 { | |
| 2657 offset -= stride; | |
| 2658 offset2++; | |
| 2659 } | |
| 2660 offset += offset2 * stride * ns; | |
| 2661 | |
| 2662 for (octave_idx_type i = 0; i < ns; i++) | |
| 2663 pvi[i] = v[i*stride + offset]; | |
| 2664 | |
| 2665 lsort.sort (pvi, ns); | |
| 2666 | |
| 2667 for (octave_idx_type i = 0; i < ns; i++) | |
| 2668 v[i*stride + offset] = pvi[i]; | |
| 2669 } | |
| 2670 } | |
| 2671 | |
| 2672 return m; | |
| 2673 } | |
| 2674 | |
| 2675 template <class T> | |
| 2676 Array<T> | |
| 2677 Array<T>::sort (Array<octave_idx_type> &sidx, octave_idx_type dim, | |
| 2678 sortmode mode) const | |
| 2679 { | |
| 2680 Array<T> m = *this; | |
| 2681 | |
| 2682 dim_vector dv = m.dims (); | |
| 2683 | |
| 2684 if (m.length () < 1) | |
| 2685 { | |
| 2686 sidx = Array<octave_idx_type> (dv); | |
| 2687 return m; | |
| 2688 } | |
| 2689 | |
| 2690 octave_idx_type ns = dv(dim); | |
| 2691 octave_idx_type iter = dv.numel () / ns; | |
| 2692 octave_idx_type stride = 1; | |
| 2693 for (int i = 0; i < dim; i++) | |
| 2694 stride *= dv(i); | |
| 2695 | |
| 2696 T *v = m.fortran_vec (); | |
| 2697 octave_sort<vec_index<T> *> indexed_sort; | |
| 2698 | |
| 2699 if (mode == ASCENDING) | |
| 2700 indexed_sort.set_compare (ascending_compare); | |
| 2701 else if (mode == DESCENDING) | |
| 2702 indexed_sort.set_compare (descending_compare); | |
|
7463
2467639bd8c0
eliminate UNDEFINED sort mode
John W. Eaton <jwe@octave.org>
parents:
7443
diff
changeset
|
2703 else |
|
2467639bd8c0
eliminate UNDEFINED sort mode
John W. Eaton <jwe@octave.org>
parents:
7443
diff
changeset
|
2704 abort (); |
| 7433 | 2705 |
| 2706 OCTAVE_LOCAL_BUFFER (vec_index<T> *, vi, ns); | |
| 2707 OCTAVE_LOCAL_BUFFER (vec_index<T>, vix, ns); | |
| 2708 | |
| 2709 for (octave_idx_type i = 0; i < ns; i++) | |
| 2710 vi[i] = &vix[i]; | |
| 2711 | |
| 2712 sidx = Array<octave_idx_type> (dv); | |
| 2713 | |
| 2714 if (stride == 1) | |
| 2715 { | |
| 2716 for (octave_idx_type j = 0; j < iter; j++) | |
| 2717 { | |
| 2718 octave_idx_type offset = j * ns; | |
| 2719 | |
| 2720 for (octave_idx_type i = 0; i < ns; i++) | |
| 2721 { | |
| 2722 vi[i]->vec = v[i]; | |
| 2723 vi[i]->indx = i; | |
| 2724 } | |
| 2725 | |
| 2726 indexed_sort.sort (vi, ns); | |
| 2727 | |
| 2728 for (octave_idx_type i = 0; i < ns; i++) | |
| 2729 { | |
| 2730 v[i] = vi[i]->vec; | |
| 2731 sidx(i + offset) = vi[i]->indx; | |
| 2732 } | |
| 2733 v += ns; | |
| 2734 } | |
| 2735 } | |
| 2736 else | |
| 2737 { | |
| 2738 for (octave_idx_type j = 0; j < iter; j++) | |
| 2739 { | |
| 2740 octave_idx_type offset = j; | |
| 2741 octave_idx_type offset2 = 0; | |
| 2742 while (offset >= stride) | |
| 2743 { | |
| 2744 offset -= stride; | |
| 2745 offset2++; | |
| 2746 } | |
| 2747 offset += offset2 * stride * ns; | |
| 2748 | |
| 2749 for (octave_idx_type i = 0; i < ns; i++) | |
| 2750 { | |
| 2751 vi[i]->vec = v[i*stride + offset]; | |
| 2752 vi[i]->indx = i; | |
| 2753 } | |
| 2754 | |
| 2755 indexed_sort.sort (vi, ns); | |
| 2756 | |
| 2757 for (octave_idx_type i = 0; i < ns; i++) | |
| 2758 { | |
| 2759 v[i*stride+offset] = vi[i]->vec; | |
| 2760 sidx(i*stride+offset) = vi[i]->indx; | |
| 2761 } | |
| 2762 } | |
| 2763 } | |
| 2764 | |
| 2765 return m; | |
| 2766 } | |
| 2767 | |
| 7443 | 2768 #if defined (HAVE_IEEE754_DATA_FORMAT) |
| 2769 | |
| 2770 template <> | |
| 7480 | 2771 bool ascending_compare (double, double); |
| 7443 | 2772 template <> |
| 7480 | 2773 bool ascending_compare (vec_index<double>*, vec_index<double>*); |
| 7443 | 2774 template <> |
| 7480 | 2775 bool descending_compare (double, double); |
| 7443 | 2776 template <> |
| 7480 | 2777 bool descending_compare (vec_index<double>*, vec_index<double>*); |
| 7443 | 2778 |
| 2779 template <> | |
| 2780 Array<double> Array<double>::sort (octave_idx_type dim, sortmode mode) const; | |
| 2781 template <> | |
| 2782 Array<double> Array<double>::sort (Array<octave_idx_type> &sidx, | |
| 2783 octave_idx_type dim, sortmode mode) const; | |
| 2784 | |
| 2785 #endif | |
| 2786 | |
|
7620
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2787 template <class T> |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2788 Array<T> |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2789 Array<T>::diag (octave_idx_type k) const |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2790 { |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2791 dim_vector dv = dims (); |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2792 octave_idx_type nd = dv.length (); |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2793 Array<T> d; |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2794 |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2795 if (nd > 2) |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2796 (*current_liboctave_error_handler) ("Matrix must be 2-dimensional"); |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2797 else |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2798 { |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2799 octave_idx_type nnr = dv (0); |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2800 octave_idx_type nnc = dv (1); |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2801 |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2802 if (nnr == 0 || nnc == 0) |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2803 ; // do nothing |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2804 else if (nnr != 1 && nnc != 1) |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2805 { |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2806 if (k > 0) |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2807 nnc -= k; |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2808 else if (k < 0) |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2809 nnr += k; |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2810 |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2811 if (nnr > 0 && nnc > 0) |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2812 { |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2813 octave_idx_type ndiag = (nnr < nnc) ? nnr : nnc; |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2814 |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2815 d.resize (dim_vector (ndiag, 1)); |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2816 |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2817 if (k > 0) |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2818 { |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2819 for (octave_idx_type i = 0; i < ndiag; i++) |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2820 d.xelem (i) = elem (i, i+k); |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2821 } |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2822 else if (k < 0) |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2823 { |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2824 for (octave_idx_type i = 0; i < ndiag; i++) |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2825 d.xelem (i) = elem (i-k, i); |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2826 } |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2827 else |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2828 { |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2829 for (octave_idx_type i = 0; i < ndiag; i++) |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2830 d.xelem (i) = elem (i, i); |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2831 } |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2832 } |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2833 else |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2834 (*current_liboctave_error_handler) |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2835 ("diag: requested diagonal out of range"); |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2836 } |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2837 else if (nnr != 0 && nnc != 0) |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2838 { |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2839 octave_idx_type roff = 0; |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2840 octave_idx_type coff = 0; |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2841 if (k > 0) |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2842 { |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2843 roff = 0; |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2844 coff = k; |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2845 } |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2846 else if (k < 0) |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2847 { |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2848 roff = -k; |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2849 coff = 0; |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2850 } |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2851 |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2852 if (nnr == 1) |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2853 { |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2854 octave_idx_type n = nnc + std::abs (k); |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2855 d = Array<T> (dim_vector (n, n), resize_fill_value (T ())); |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2856 |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2857 for (octave_idx_type i = 0; i < nnc; i++) |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2858 d.xelem (i+roff, i+coff) = elem (0, i); |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2859 } |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2860 else |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2861 { |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2862 octave_idx_type n = nnr + std::abs (k); |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2863 d = Array<T> (dim_vector (n, n), resize_fill_value (T ())); |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2864 |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2865 for (octave_idx_type i = 0; i < nnr; i++) |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2866 d.xelem (i+roff, i+coff) = elem (i, 0); |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2867 } |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2868 } |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2869 } |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2870 |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2871 return d; |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2872 } |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7605
diff
changeset
|
2873 |
| 5775 | 2874 // FIXME -- this is a mess. |
| 4517 | 2875 |
| 2876 template <class LT, class RT> | |
| 2877 int | |
| 2878 assign (Array<LT>& lhs, const Array<RT>& rhs, const LT& rfv) | |
| 2879 { | |
| 6388 | 2880 int n_idx = lhs.index_count (); |
| 2881 | |
| 2882 // kluge... | |
| 2883 if (lhs.ndims () == 0) | |
| 2884 lhs.resize_no_fill (0, 0); | |
| 2885 | |
| 2886 return (lhs.ndims () == 2 | |
| 2887 && (n_idx == 1 | |
| 2888 || (n_idx < 3 | |
| 2889 && rhs.ndims () == 2 | |
| 2890 && rhs.rows () == 0 && rhs.columns () == 0))) | |
| 2891 ? assign2 (lhs, rhs, rfv) : assignN (lhs, rhs, rfv); | |
| 4517 | 2892 } |
| 2893 | |
| 2894 template <class LT, class RT> | |
| 2895 int | |
| 2896 assign1 (Array<LT>& lhs, const Array<RT>& rhs, const LT& rfv) | |
| 2897 { | |
| 2898 int retval = 1; | |
| 2899 | |
| 2900 idx_vector *tmp = lhs.get_idx (); | |
| 2901 | |
| 2902 idx_vector lhs_idx = tmp[0]; | |
| 2903 | |
| 5275 | 2904 octave_idx_type lhs_len = lhs.length (); |
| 2905 octave_idx_type rhs_len = rhs.length (); | |
| 2906 | |
| 5781 | 2907 octave_idx_type n = lhs_idx.freeze (lhs_len, "vector", true); |
| 4517 | 2908 |
| 2909 if (n != 0) | |
| 2910 { | |
| 6389 | 2911 dim_vector lhs_dims = lhs.dims (); |
| 2912 | |
| 6922 | 2913 if (lhs_len != 0 |
| 2914 || lhs_dims.all_zero () | |
| 2915 || (lhs_dims.length () == 2 && lhs_dims(0) < 2)) | |
| 4517 | 2916 { |
| 6392 | 2917 if (rhs_len == n || rhs_len == 1) |
| 2918 { | |
| 6884 | 2919 lhs.make_unique (); |
| 2920 | |
| 6392 | 2921 octave_idx_type max_idx = lhs_idx.max () + 1; |
| 2922 if (max_idx > lhs_len) | |
| 2923 lhs.resize_and_fill (max_idx, rfv); | |
| 2924 } | |
| 2925 | |
| 2926 if (rhs_len == n) | |
| 2927 { | |
| 6884 | 2928 lhs.make_unique (); |
| 2929 | |
| 2930 if (lhs_idx.is_colon ()) | |
| 6392 | 2931 { |
| 6884 | 2932 for (octave_idx_type i = 0; i < n; i++) |
| 2933 lhs.xelem (i) = rhs.elem (i); | |
| 2934 } | |
| 2935 else | |
| 2936 { | |
| 2937 for (octave_idx_type i = 0; i < n; i++) | |
| 2938 { | |
| 2939 octave_idx_type ii = lhs_idx.elem (i); | |
| 2940 lhs.xelem (ii) = rhs.elem (i); | |
| 2941 } | |
| 6392 | 2942 } |
| 2943 } | |
| 2944 else if (rhs_len == 1) | |
| 2945 { | |
| 6884 | 2946 lhs.make_unique (); |
| 2947 | |
| 6392 | 2948 RT scalar = rhs.elem (0); |
| 2949 | |
| 6884 | 2950 if (lhs_idx.is_colon ()) |
| 6392 | 2951 { |
| 6884 | 2952 for (octave_idx_type i = 0; i < n; i++) |
| 2953 lhs.xelem (i) = scalar; | |
| 2954 } | |
| 2955 else | |
| 2956 { | |
| 2957 for (octave_idx_type i = 0; i < n; i++) | |
| 2958 { | |
| 2959 octave_idx_type ii = lhs_idx.elem (i); | |
| 2960 lhs.xelem (ii) = scalar; | |
| 2961 } | |
| 6392 | 2962 } |
| 2963 } | |
| 2964 else | |
| 2965 { | |
| 2966 (*current_liboctave_error_handler) | |
| 2967 ("A(I) = X: X must be a scalar or a vector with same length as I"); | |
| 2968 | |
| 2969 retval = 0; | |
| 2970 } | |
| 4517 | 2971 } |
| 6922 | 2972 else |
| 2973 { | |
| 2974 (*current_liboctave_error_handler) | |
| 2975 ("A(I) = X: unable to resize A"); | |
| 2976 | |
| 2977 retval = 0; | |
| 2978 } | |
| 4517 | 2979 } |
| 2980 else if (lhs_idx.is_colon ()) | |
| 2981 { | |
| 6384 | 2982 dim_vector lhs_dims = lhs.dims (); |
| 2983 | |
| 2984 if (lhs_dims.all_zero ()) | |
| 4517 | 2985 { |
| 6884 | 2986 lhs.make_unique (); |
| 2987 | |
| 4517 | 2988 lhs.resize_no_fill (rhs_len); |
| 2989 | |
| 5275 | 2990 for (octave_idx_type i = 0; i < rhs_len; i++) |
| 6884 | 2991 lhs.xelem (i) = rhs.elem (i); |
| 4517 | 2992 } |
| 6553 | 2993 else if (rhs_len != lhs_len) |
| 4517 | 2994 (*current_liboctave_error_handler) |
| 2995 ("A(:) = X: A must be the same size as X"); | |
| 2996 } | |
| 2997 else if (! (rhs_len == 1 || rhs_len == 0)) | |
| 2998 { | |
| 2999 (*current_liboctave_error_handler) | |
| 3000 ("A([]) = X: X must also be an empty matrix or a scalar"); | |
| 3001 | |
| 3002 retval = 0; | |
| 3003 } | |
| 3004 | |
| 3005 lhs.clear_index (); | |
| 3006 | |
| 3007 return retval; | |
| 3008 } | |
| 3009 | |
| 3010 #define MAYBE_RESIZE_LHS \ | |
| 3011 do \ | |
| 3012 { \ | |
| 5275 | 3013 octave_idx_type max_row_idx = idx_i_is_colon ? rhs_nr : idx_i.max () + 1; \ |
| 3014 octave_idx_type max_col_idx = idx_j_is_colon ? rhs_nc : idx_j.max () + 1; \ | |
| 4517 | 3015 \ |
| 5275 | 3016 octave_idx_type new_nr = max_row_idx > lhs_nr ? max_row_idx : lhs_nr; \ |
| 3017 octave_idx_type new_nc = max_col_idx > lhs_nc ? max_col_idx : lhs_nc; \ | |
| 4517 | 3018 \ |
| 3019 lhs.resize_and_fill (new_nr, new_nc, rfv); \ | |
| 3020 } \ | |
| 3021 while (0) | |
| 3022 | |
| 3023 template <class LT, class RT> | |
| 3024 int | |
| 3025 assign2 (Array<LT>& lhs, const Array<RT>& rhs, const LT& rfv) | |
| 3026 { | |
| 3027 int retval = 1; | |
| 3028 | |
| 3029 int n_idx = lhs.index_count (); | |
| 3030 | |
| 5275 | 3031 octave_idx_type lhs_nr = lhs.rows (); |
| 3032 octave_idx_type lhs_nc = lhs.cols (); | |
| 4517 | 3033 |
| 5047 | 3034 Array<RT> xrhs = rhs; |
| 3035 | |
| 5275 | 3036 octave_idx_type rhs_nr = xrhs.rows (); |
| 3037 octave_idx_type rhs_nc = xrhs.cols (); | |
| 5047 | 3038 |
| 3039 if (xrhs.ndims () > 2) | |
| 4707 | 3040 { |
| 5047 | 3041 xrhs = xrhs.squeeze (); |
| 3042 | |
| 3043 dim_vector dv_tmp = xrhs.dims (); | |
| 4709 | 3044 |
| 4708 | 3045 switch (dv_tmp.length ()) |
| 4707 | 3046 { |
| 4708 | 3047 case 1: |
| 5775 | 3048 // FIXME -- this case should be unnecessary, because |
| 5047 | 3049 // squeeze should always return an object with 2 dimensions. |
| 4708 | 3050 if (rhs_nr == 1) |
| 3051 rhs_nc = dv_tmp.elem (0); | |
| 3052 break; | |
| 4709 | 3053 |
| 4708 | 3054 case 2: |
| 4707 | 3055 rhs_nr = dv_tmp.elem (0); |
| 3056 rhs_nc = dv_tmp.elem (1); | |
| 4708 | 3057 break; |
| 3058 | |
| 3059 default: | |
| 3060 (*current_liboctave_error_handler) | |
| 3061 ("Array<T>::assign2: Dimension mismatch"); | |
| 4709 | 3062 return 0; |
| 4707 | 3063 } |
| 3064 } | |
| 4517 | 3065 |
| 6384 | 3066 bool rhs_is_scalar = rhs_nr == 1 && rhs_nc == 1; |
| 3067 | |
| 4517 | 3068 idx_vector *tmp = lhs.get_idx (); |
| 3069 | |
| 3070 idx_vector idx_i; | |
| 3071 idx_vector idx_j; | |
| 3072 | |
| 3073 if (n_idx > 1) | |
| 3074 idx_j = tmp[1]; | |
| 3075 | |
| 3076 if (n_idx > 0) | |
| 3077 idx_i = tmp[0]; | |
| 3078 | |
| 3079 if (n_idx == 2) | |
| 3080 { | |
| 5781 | 3081 octave_idx_type n = idx_i.freeze (lhs_nr, "row", true); |
| 3082 octave_idx_type m = idx_j.freeze (lhs_nc, "column", true); | |
| 4517 | 3083 |
| 3084 int idx_i_is_colon = idx_i.is_colon (); | |
| 3085 int idx_j_is_colon = idx_j.is_colon (); | |
| 3086 | |
| 6384 | 3087 if (lhs_nr == 0 && lhs_nc == 0) |
| 3088 { | |
| 3089 if (idx_i_is_colon) | |
| 3090 n = rhs_nr; | |
| 3091 | |
| 3092 if (idx_j_is_colon) | |
| 3093 m = rhs_nc; | |
| 3094 } | |
| 4517 | 3095 |
| 3096 if (idx_i && idx_j) | |
| 3097 { | |
| 3098 if (rhs_nr == 0 && rhs_nc == 0) | |
| 3099 { | |
| 3100 lhs.maybe_delete_elements (idx_i, idx_j); | |
| 3101 } | |
| 3102 else | |
| 3103 { | |
| 6384 | 3104 if (rhs_is_scalar && n >= 0 && m >= 0) |
| 4517 | 3105 { |
| 4534 | 3106 // No need to do anything if either of the indices |
| 3107 // are empty. | |
| 3108 | |
| 3109 if (n > 0 && m > 0) | |
| 4517 | 3110 { |
| 6884 | 3111 lhs.make_unique (); |
| 3112 | |
| 4534 | 3113 MAYBE_RESIZE_LHS; |
| 3114 | |
| 5047 | 3115 RT scalar = xrhs.elem (0, 0); |
| 4534 | 3116 |
| 5275 | 3117 for (octave_idx_type j = 0; j < m; j++) |
| 4517 | 3118 { |
| 5275 | 3119 octave_idx_type jj = idx_j.elem (j); |
| 3120 for (octave_idx_type i = 0; i < n; i++) | |
| 4534 | 3121 { |
| 5275 | 3122 octave_idx_type ii = idx_i.elem (i); |
| 6884 | 3123 lhs.xelem (ii, jj) = scalar; |
| 4534 | 3124 } |
| 4517 | 3125 } |
| 3126 } | |
| 3127 } | |
| 6072 | 3128 else if ((n == 1 || m == 1) |
| 3129 && (rhs_nr == 1 || rhs_nc == 1) | |
| 3130 && n * m == rhs_nr * rhs_nc) | |
| 3131 { | |
| 6884 | 3132 lhs.make_unique (); |
| 3133 | |
| 6384 | 3134 MAYBE_RESIZE_LHS; |
| 3135 | |
| 6072 | 3136 if (n > 0 && m > 0) |
| 3137 { | |
| 3138 octave_idx_type k = 0; | |
| 3139 | |
| 3140 for (octave_idx_type j = 0; j < m; j++) | |
| 3141 { | |
| 3142 octave_idx_type jj = idx_j.elem (j); | |
| 3143 for (octave_idx_type i = 0; i < n; i++) | |
| 3144 { | |
| 3145 octave_idx_type ii = idx_i.elem (i); | |
| 6884 | 3146 lhs.xelem (ii, jj) = xrhs.elem (k++); |
| 6072 | 3147 } |
| 3148 } | |
| 3149 } | |
| 3150 } | |
| 4517 | 3151 else if (n == rhs_nr && m == rhs_nc) |
| 3152 { | |
| 6884 | 3153 lhs.make_unique (); |
| 3154 | |
| 6384 | 3155 MAYBE_RESIZE_LHS; |
| 3156 | |
| 4517 | 3157 if (n > 0 && m > 0) |
| 3158 { | |
| 5275 | 3159 for (octave_idx_type j = 0; j < m; j++) |
| 4517 | 3160 { |
| 5275 | 3161 octave_idx_type jj = idx_j.elem (j); |
| 3162 for (octave_idx_type i = 0; i < n; i++) | |
| 4517 | 3163 { |
| 5275 | 3164 octave_idx_type ii = idx_i.elem (i); |
| 6884 | 3165 lhs.xelem (ii, jj) = xrhs.elem (i, j); |
| 4517 | 3166 } |
| 3167 } | |
| 3168 } | |
| 3169 } | |
| 3170 else if (n == 0 && m == 0) | |
| 3171 { | |
| 6384 | 3172 if (! (rhs_is_scalar || (rhs_nr == 0 || rhs_nc == 0))) |
| 4517 | 3173 { |
| 3174 (*current_liboctave_error_handler) | |
| 3175 ("A([], []) = X: X must be an empty matrix or a scalar"); | |
| 3176 | |
| 3177 retval = 0; | |
| 3178 } | |
| 3179 } | |
| 3180 else | |
| 3181 { | |
| 3182 (*current_liboctave_error_handler) | |
| 3183 ("A(I, J) = X: X must be a scalar or the number of elements in I must"); | |
| 3184 (*current_liboctave_error_handler) | |
| 3185 ("match the number of rows in X and the number of elements in J must"); | |
| 3186 (*current_liboctave_error_handler) | |
| 3187 ("match the number of columns in X"); | |
| 3188 | |
| 3189 retval = 0; | |
| 3190 } | |
| 3191 } | |
| 3192 } | |
| 3193 // idx_vector::freeze() printed an error message for us. | |
| 3194 } | |
| 3195 else if (n_idx == 1) | |
| 3196 { | |
| 3197 int lhs_is_empty = lhs_nr == 0 || lhs_nc == 0; | |
| 3198 | |
| 3199 if (lhs_is_empty || (lhs_nr == 1 && lhs_nc == 1)) | |
| 3200 { | |
| 5275 | 3201 octave_idx_type lhs_len = lhs.length (); |
| 3202 | |
| 6384 | 3203 idx_i.freeze (lhs_len, 0, true); |
| 4517 | 3204 |
| 3205 if (idx_i) | |
| 3206 { | |
| 3207 if (rhs_nr == 0 && rhs_nc == 0) | |
| 3208 { | |
| 6384 | 3209 lhs.maybe_delete_elements (idx_i); |
| 4517 | 3210 } |
| 3211 else | |
| 3212 { | |
| 5781 | 3213 if (lhs_is_empty |
| 3214 && idx_i.is_colon () | |
| 3215 && ! (rhs_nr == 1 || rhs_nc == 1)) | |
| 4517 | 3216 { |
| 5781 | 3217 (*current_liboctave_warning_with_id_handler) |
| 3218 ("Octave:fortran-indexing", | |
| 3219 "A(:) = X: X is not a vector or scalar"); | |
| 3220 } | |
| 3221 else | |
| 3222 { | |
| 3223 octave_idx_type idx_nr = idx_i.orig_rows (); | |
| 3224 octave_idx_type idx_nc = idx_i.orig_columns (); | |
| 3225 | |
| 3226 if (! (rhs_nr == idx_nr && rhs_nc == idx_nc)) | |
| 3227 (*current_liboctave_warning_with_id_handler) | |
| 3228 ("Octave:fortran-indexing", | |
| 3229 "A(I) = X: X does not have same shape as I"); | |
| 4517 | 3230 } |
| 3231 | |
| 5047 | 3232 if (assign1 (lhs, xrhs, rfv)) |
| 4517 | 3233 { |
| 5275 | 3234 octave_idx_type len = lhs.length (); |
| 4517 | 3235 |
| 3236 if (len > 0) | |
| 3237 { | |
| 3238 // The following behavior is much simplified | |
| 3239 // over previous versions of Octave. It | |
| 3240 // seems to be compatible with Matlab. | |
| 3241 | |
| 3242 lhs.dimensions = dim_vector (1, lhs.length ()); | |
| 3243 } | |
| 3244 } | |
| 3245 else | |
| 3246 retval = 0; | |
| 3247 } | |
| 3248 } | |
| 3249 // idx_vector::freeze() printed an error message for us. | |
| 3250 } | |
| 3251 else if (lhs_nr == 1) | |
| 3252 { | |
| 5781 | 3253 idx_i.freeze (lhs_nc, "vector", true); |
| 4517 | 3254 |
| 3255 if (idx_i) | |
| 3256 { | |
| 3257 if (rhs_nr == 0 && rhs_nc == 0) | |
| 3258 lhs.maybe_delete_elements (idx_i); | |
| 3259 else | |
| 3260 { | |
| 5047 | 3261 if (assign1 (lhs, xrhs, rfv)) |
| 4517 | 3262 lhs.dimensions = dim_vector (1, lhs.length ()); |
| 3263 else | |
| 3264 retval = 0; | |
| 3265 } | |
| 3266 } | |
| 3267 // idx_vector::freeze() printed an error message for us. | |
| 3268 } | |
| 3269 else if (lhs_nc == 1) | |
| 3270 { | |
| 5781 | 3271 idx_i.freeze (lhs_nr, "vector", true); |
| 4517 | 3272 |
| 3273 if (idx_i) | |
| 3274 { | |
| 3275 if (rhs_nr == 0 && rhs_nc == 0) | |
| 3276 lhs.maybe_delete_elements (idx_i); | |
| 3277 else | |
| 3278 { | |
| 5047 | 3279 if (assign1 (lhs, xrhs, rfv)) |
| 4517 | 3280 lhs.dimensions = dim_vector (lhs.length (), 1); |
| 3281 else | |
| 3282 retval = 0; | |
| 3283 } | |
| 3284 } | |
| 3285 // idx_vector::freeze() printed an error message for us. | |
| 3286 } | |
| 3287 else | |
| 3288 { | |
|
7573
755bf7ecc29b
eliminate one_zero stuff from idx_vector
John W. Eaton <jwe@octave.org>
parents:
7480
diff
changeset
|
3289 if (! idx_i.is_colon ()) |
| 5781 | 3290 (*current_liboctave_warning_with_id_handler) |
| 3291 ("Octave:fortran-indexing", "single index used for matrix"); | |
| 4517 | 3292 |
| 5275 | 3293 octave_idx_type len = idx_i.freeze (lhs_nr * lhs_nc, "matrix"); |
| 4517 | 3294 |
| 3295 if (idx_i) | |
| 3296 { | |
| 4756 | 3297 if (rhs_nr == 0 && rhs_nc == 0) |
| 3298 lhs.maybe_delete_elements (idx_i); | |
| 3299 else if (len == 0) | |
| 4517 | 3300 { |
| 6384 | 3301 if (! (rhs_is_scalar || (rhs_nr == 0 || rhs_nc == 0))) |
| 4517 | 3302 (*current_liboctave_error_handler) |
| 3303 ("A([]) = X: X must be an empty matrix or scalar"); | |
| 3304 } | |
| 3305 else if (len == rhs_nr * rhs_nc) | |
| 3306 { | |
| 6884 | 3307 lhs.make_unique (); |
| 3308 | |
| 3309 if (idx_i.is_colon ()) | |
| 4517 | 3310 { |
| 6884 | 3311 for (octave_idx_type i = 0; i < len; i++) |
| 3312 lhs.xelem (i) = xrhs.elem (i); | |
| 3313 } | |
| 3314 else | |
| 3315 { | |
| 3316 for (octave_idx_type i = 0; i < len; i++) | |
| 3317 { | |
| 3318 octave_idx_type ii = idx_i.elem (i); | |
| 3319 lhs.xelem (ii) = xrhs.elem (i); | |
| 3320 } | |
| 4517 | 3321 } |
| 3322 } | |
| 6384 | 3323 else if (rhs_is_scalar) |
| 4517 | 3324 { |
| 6884 | 3325 lhs.make_unique (); |
| 3326 | |
| 4517 | 3327 RT scalar = rhs.elem (0, 0); |
| 3328 | |
| 6884 | 3329 if (idx_i.is_colon ()) |
| 4517 | 3330 { |
| 6884 | 3331 for (octave_idx_type i = 0; i < len; i++) |
| 3332 lhs.xelem (i) = scalar; | |
| 3333 } | |
| 3334 else | |
| 3335 { | |
| 3336 for (octave_idx_type i = 0; i < len; i++) | |
| 3337 { | |
| 3338 octave_idx_type ii = idx_i.elem (i); | |
| 3339 lhs.xelem (ii) = scalar; | |
| 3340 } | |
| 4517 | 3341 } |
| 3342 } | |
| 3343 else | |
| 3344 { | |
| 3345 (*current_liboctave_error_handler) | |
| 3346 ("A(I) = X: X must be a scalar or a matrix with the same size as I"); | |
| 3347 | |
| 3348 retval = 0; | |
| 3349 } | |
| 3350 } | |
| 3351 // idx_vector::freeze() printed an error message for us. | |
| 3352 } | |
| 3353 } | |
| 3354 else | |
| 3355 { | |
| 3356 (*current_liboctave_error_handler) | |
| 3357 ("invalid number of indices for matrix expression"); | |
| 3358 | |
| 3359 retval = 0; | |
| 3360 } | |
| 3361 | |
| 3362 lhs.clear_index (); | |
| 3363 | |
| 3364 return retval; | |
| 3365 } | |
| 3366 | |
| 3367 template <class LT, class RT> | |
| 3368 int | |
| 3369 assignN (Array<LT>& lhs, const Array<RT>& rhs, const LT& rfv) | |
| 3370 { | |
| 3371 int retval = 1; | |
| 3372 | |
| 4746 | 3373 dim_vector rhs_dims = rhs.dims (); |
| 3374 | |
| 5275 | 3375 octave_idx_type rhs_dims_len = rhs_dims.length (); |
| 4746 | 3376 |
| 3377 bool rhs_is_scalar = is_scalar (rhs_dims); | |
| 3378 | |
| 4517 | 3379 int n_idx = lhs.index_count (); |
| 3380 | |
| 4745 | 3381 idx_vector *idx_vex = lhs.get_idx (); |
| 3382 | |
| 3383 Array<idx_vector> idx = conv_to_array (idx_vex, n_idx); | |
| 4517 | 3384 |
| 4743 | 3385 if (rhs_dims_len == 2 && rhs_dims(0) == 0 && rhs_dims(1) == 0) |
| 4517 | 3386 { |
| 3387 lhs.maybe_delete_elements (idx, rfv); | |
| 3388 } | |
| 5285 | 3389 else if (n_idx == 0) |
| 3390 { | |
| 3391 (*current_liboctave_error_handler) | |
| 3392 ("invalid number of indices for matrix expression"); | |
| 3393 | |
| 3394 retval = 0; | |
| 3395 } | |
| 4657 | 3396 else if (n_idx == 1) |
| 4517 | 3397 { |
| 4657 | 3398 idx_vector iidx = idx(0); |
| 6884 | 3399 int iidx_is_colon = iidx.is_colon (); |
| 3400 | |
|
7573
755bf7ecc29b
eliminate one_zero stuff from idx_vector
John W. Eaton <jwe@octave.org>
parents:
7480
diff
changeset
|
3401 if (! iidx_is_colon) |
| 5781 | 3402 (*current_liboctave_warning_with_id_handler) |
| 3403 ("Octave:fortran-indexing", "single index used for N-d array"); | |
| 4657 | 3404 |
| 5275 | 3405 octave_idx_type lhs_len = lhs.length (); |
| 3406 | |
| 3407 octave_idx_type len = iidx.freeze (lhs_len, "N-d arrray"); | |
| 4657 | 3408 |
| 3409 if (iidx) | |
| 4533 | 3410 { |
| 4657 | 3411 if (len == 0) |
| 4656 | 3412 { |
| 5039 | 3413 if (! (rhs_dims.all_ones () || rhs_dims.any_zero ())) |
| 4743 | 3414 { |
| 3415 (*current_liboctave_error_handler) | |
| 3416 ("A([]) = X: X must be an empty matrix or scalar"); | |
| 3417 | |
| 3418 retval = 0; | |
| 3419 } | |
| 4657 | 3420 } |
| 3421 else if (len == rhs.length ()) | |
| 3422 { | |
| 6884 | 3423 lhs.make_unique (); |
| 3424 | |
| 3425 if (iidx_is_colon) | |
| 4656 | 3426 { |
| 6884 | 3427 for (octave_idx_type i = 0; i < len; i++) |
| 3428 lhs.xelem (i) = rhs.elem (i); | |
| 3429 } | |
| 3430 else | |
| 3431 { | |
| 3432 for (octave_idx_type i = 0; i < len; i++) | |
| 3433 { | |
| 3434 octave_idx_type ii = iidx.elem (i); | |
| 3435 | |
| 3436 lhs.xelem (ii) = rhs.elem (i); | |
| 3437 } | |
| 4656 | 3438 } |
| 3439 } | |
| 4716 | 3440 else if (rhs_is_scalar) |
| 4657 | 3441 { |
| 3442 RT scalar = rhs.elem (0); | |
| 3443 | |
| 6884 | 3444 lhs.make_unique (); |
| 3445 | |
| 3446 if (iidx_is_colon) | |
| 4657 | 3447 { |
| 6884 | 3448 for (octave_idx_type i = 0; i < len; i++) |
| 3449 lhs.xelem (i) = scalar; | |
| 3450 } | |
| 3451 else | |
| 3452 { | |
| 3453 for (octave_idx_type i = 0; i < len; i++) | |
| 3454 { | |
| 3455 octave_idx_type ii = iidx.elem (i); | |
| 3456 | |
| 3457 lhs.xelem (ii) = scalar; | |
| 3458 } | |
| 4657 | 3459 } |
| 3460 } | |
| 3461 else | |
| 3462 { | |
| 3463 (*current_liboctave_error_handler) | |
| 4702 | 3464 ("A(I) = X: X must be a scalar or a matrix with the same size as I"); |
| 3465 | |
| 4657 | 3466 retval = 0; |
| 3467 } | |
| 3468 | |
| 4656 | 3469 // idx_vector::freeze() printed an error message for us. |
| 4533 | 3470 } |
| 4702 | 3471 } |
| 4743 | 3472 else |
| 4702 | 3473 { |
| 4746 | 3474 // Maybe expand to more dimensions. |
| 3475 | |
| 3476 dim_vector lhs_dims = lhs.dims (); | |
| 3477 | |
| 5275 | 3478 octave_idx_type lhs_dims_len = lhs_dims.length (); |
| 4746 | 3479 |
| 3480 dim_vector final_lhs_dims = lhs_dims; | |
| 3481 | |
| 3482 dim_vector frozen_len; | |
| 3483 | |
| 5275 | 3484 octave_idx_type orig_lhs_dims_len = lhs_dims_len; |
| 4747 | 3485 |
| 3486 bool orig_empty = lhs_dims.all_zero (); | |
| 3487 | |
| 3488 if (n_idx < lhs_dims_len) | |
| 4517 | 3489 { |
| 5052 | 3490 // Collapse dimensions beyond last index. Note that we |
| 3491 // delay resizing LHS until we know that the assignment will | |
| 3492 // succeed. | |
| 4747 | 3493 |
| 5781 | 3494 if (! (idx(n_idx-1).is_colon ())) |
| 3495 (*current_liboctave_warning_with_id_handler) | |
| 3496 ("Octave:fortran-indexing", | |
| 3497 "fewer indices than dimensions for N-d array"); | |
| 4747 | 3498 |
| 3499 for (int i = n_idx; i < lhs_dims_len; i++) | |
| 3500 lhs_dims(n_idx-1) *= lhs_dims(i); | |
| 3501 | |
| 3502 lhs_dims.resize (n_idx); | |
| 3503 | |
| 3504 lhs_dims_len = lhs_dims.length (); | |
| 3505 } | |
| 3506 | |
| 3507 // Resize. | |
| 3508 | |
| 3509 dim_vector new_dims; | |
| 3510 new_dims.resize (n_idx); | |
| 3511 | |
| 5264 | 3512 if (orig_empty) |
| 4747 | 3513 { |
|
7642
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3514 if (rhs_is_scalar) |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3515 { |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3516 for (int i = 0; i < n_idx; i++) |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3517 { |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3518 if (idx(i).is_colon ()) |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3519 new_dims(i) = 1; |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3520 else |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3521 new_dims(i) = idx(i).orig_empty () ? 0 : idx(i).max () + 1; |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3522 } |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3523 } |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3524 else if (is_vector (rhs_dims)) |
| 4746 | 3525 { |
|
7642
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3526 int ncolon = 0; |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3527 int fcolon = 0; |
|
7646
ad16ea379d2f
additional fixes for Array::assignN
David Bateman <dbateman@free.fr>
parents:
7642
diff
changeset
|
3528 octave_idx_type new_dims_numel = 1; |
|
ad16ea379d2f
additional fixes for Array::assignN
David Bateman <dbateman@free.fr>
parents:
7642
diff
changeset
|
3529 int new_dims_vec = 0; |
|
7642
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3530 for (int i = 0; i < n_idx; i++) |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3531 if (idx(i).is_colon ()) |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3532 { |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3533 ncolon ++; |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3534 if (ncolon == 1) |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3535 fcolon = i; |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3536 } |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3537 else |
|
7646
ad16ea379d2f
additional fixes for Array::assignN
David Bateman <dbateman@free.fr>
parents:
7642
diff
changeset
|
3538 { |
|
ad16ea379d2f
additional fixes for Array::assignN
David Bateman <dbateman@free.fr>
parents:
7642
diff
changeset
|
3539 octave_idx_type cap = idx(i).capacity (); |
|
ad16ea379d2f
additional fixes for Array::assignN
David Bateman <dbateman@free.fr>
parents:
7642
diff
changeset
|
3540 new_dims_numel *= cap; |
|
ad16ea379d2f
additional fixes for Array::assignN
David Bateman <dbateman@free.fr>
parents:
7642
diff
changeset
|
3541 if (cap != 1) |
|
ad16ea379d2f
additional fixes for Array::assignN
David Bateman <dbateman@free.fr>
parents:
7642
diff
changeset
|
3542 new_dims_vec ++; |
|
ad16ea379d2f
additional fixes for Array::assignN
David Bateman <dbateman@free.fr>
parents:
7642
diff
changeset
|
3543 } |
|
7642
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3544 |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3545 if (ncolon == n_idx) |
| 5264 | 3546 { |
|
7642
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3547 new_dims = rhs_dims; |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3548 new_dims.resize (n_idx); |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3549 for (int i = rhs_dims_len; i < n_idx; i++) |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3550 new_dims (i) = 1; |
| 5379 | 3551 } |
| 3552 else | |
| 3553 { | |
|
7642
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3554 octave_idx_type rhs_dims_numel = rhs_dims.numel (); |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3555 |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3556 for (int i = 0; i < n_idx; i++) |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3557 new_dims(i) = idx(i).orig_empty () ? 0 : idx(i).max () + 1; |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3558 |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3559 if (new_dims_numel != rhs_dims_numel && |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3560 ncolon > 0 && new_dims_numel == 1) |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3561 { |
|
7646
ad16ea379d2f
additional fixes for Array::assignN
David Bateman <dbateman@free.fr>
parents:
7642
diff
changeset
|
3562 if (ncolon == rhs_dims_len) |
|
ad16ea379d2f
additional fixes for Array::assignN
David Bateman <dbateman@free.fr>
parents:
7642
diff
changeset
|
3563 { |
|
ad16ea379d2f
additional fixes for Array::assignN
David Bateman <dbateman@free.fr>
parents:
7642
diff
changeset
|
3564 int k = 0; |
|
ad16ea379d2f
additional fixes for Array::assignN
David Bateman <dbateman@free.fr>
parents:
7642
diff
changeset
|
3565 for (int i = 0; i < n_idx; i++) |
|
ad16ea379d2f
additional fixes for Array::assignN
David Bateman <dbateman@free.fr>
parents:
7642
diff
changeset
|
3566 if (idx(i).is_colon ()) |
|
ad16ea379d2f
additional fixes for Array::assignN
David Bateman <dbateman@free.fr>
parents:
7642
diff
changeset
|
3567 new_dims (i) = rhs_dims (k++); |
|
ad16ea379d2f
additional fixes for Array::assignN
David Bateman <dbateman@free.fr>
parents:
7642
diff
changeset
|
3568 } |
|
7642
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3569 else |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3570 new_dims (fcolon) = rhs_dims_numel; |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3571 } |
|
7646
ad16ea379d2f
additional fixes for Array::assignN
David Bateman <dbateman@free.fr>
parents:
7642
diff
changeset
|
3572 else if (new_dims_numel != rhs_dims_numel || new_dims_vec > 1) |
| 5264 | 3573 { |
| 3574 (*current_liboctave_error_handler) | |
| 5379 | 3575 ("A(IDX-LIST) = RHS: mismatched index and RHS dimension"); |
| 5264 | 3576 return retval; |
| 3577 } | |
|
7642
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3578 } |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3579 } |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3580 else |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3581 { |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3582 int k = 0; |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3583 for (int i = 0; i < n_idx; i++) |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3584 { |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3585 if (idx(i).is_colon ()) |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3586 { |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3587 if (k < rhs_dims_len) |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3588 new_dims(i) = rhs_dims(k++); |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3589 else |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3590 new_dims(i) = 1; |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3591 } |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3592 else |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3593 { |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3594 octave_idx_type nelem = idx(i).capacity (); |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3595 |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3596 if (nelem >= 1 |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3597 && (k < rhs_dims_len && nelem == rhs_dims(k))) |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3598 k++; |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3599 else if (nelem != 1) |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3600 { |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3601 (*current_liboctave_error_handler) |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3602 ("A(IDX-LIST) = RHS: mismatched index and RHS dimension"); |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3603 return retval; |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3604 } |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3605 new_dims(i) = idx(i).orig_empty () ? 0 : |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3606 idx(i).max () + 1; |
|
9a4541c622b5
refactor Array::assignN dimensioning code for empty initial matrices
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
3607 } |
| 5264 | 3608 } |
| 4746 | 3609 } |
| 5264 | 3610 } |
| 3611 else | |
| 3612 { | |
| 3613 for (int i = 0; i < n_idx; i++) | |
| 4746 | 3614 { |
| 4747 | 3615 // We didn't start out with all zero dimensions, so if |
| 3616 // index is a colon, it refers to the current LHS | |
| 3617 // dimension. Otherwise, it is OK to enlarge to a | |
| 5264 | 3618 // dimension given by the largest index, but if that |
| 4898 | 3619 // index is a colon the new dimension is singleton. |
| 4749 | 3620 |
| 3621 if (i < lhs_dims_len | |
| 6481 | 3622 && (idx(i).is_colon () |
| 3623 || idx(i).orig_empty () | |
| 3624 || idx(i).max () < lhs_dims(i))) | |
| 4749 | 3625 new_dims(i) = lhs_dims(i); |
| 3626 else if (! idx(i).is_colon ()) | |
| 3627 new_dims(i) = idx(i).max () + 1; | |
| 3628 else | |
| 4898 | 3629 new_dims(i) = 1; |
| 4745 | 3630 } |
| 4747 | 3631 } |
| 3632 | |
| 4749 | 3633 if (retval != 0) |
| 4747 | 3634 { |
| 4749 | 3635 if (! orig_empty |
| 3636 && n_idx < orig_lhs_dims_len | |
| 3637 && new_dims(n_idx-1) != lhs_dims(n_idx-1)) | |
| 4702 | 3638 { |
| 4749 | 3639 // We reshaped and the last dimension changed. This has to |
| 3640 // be an error, because we don't know how to undo that | |
| 3641 // later... | |
| 3642 | |
| 3643 (*current_liboctave_error_handler) | |
| 3644 ("array index %d (= %d) for assignment requires invalid resizing operation", | |
| 3645 n_idx, new_dims(n_idx-1)); | |
| 3646 | |
| 3647 retval = 0; | |
| 4743 | 3648 } |
| 3649 else | |
| 3650 { | |
| 5052 | 3651 // Determine final dimensions for LHS and reset the |
| 3652 // current size of the LHS. Note that we delay actually | |
| 3653 // resizing LHS until we know that the assignment will | |
| 3654 // succeed. | |
| 3655 | |
| 4749 | 3656 if (n_idx < orig_lhs_dims_len) |
| 4743 | 3657 { |
| 4749 | 3658 for (int i = 0; i < n_idx-1; i++) |
| 3659 final_lhs_dims(i) = new_dims(i); | |
| 4747 | 3660 } |
| 3661 else | |
| 4749 | 3662 final_lhs_dims = new_dims; |
| 3663 | |
| 5837 | 3664 lhs_dims_len = new_dims.length (); |
| 3665 | |
| 3666 frozen_len = freeze (idx, new_dims, true); | |
| 4749 | 3667 |
| 6141 | 3668 for (int i = 0; i < idx.length (); i++) |
| 3669 { | |
| 3670 if (! idx(i)) | |
| 3671 { | |
| 3672 retval = 0; | |
| 3673 lhs.clear_index (); | |
| 3674 return retval; | |
| 3675 } | |
| 3676 } | |
| 3677 | |
| 4749 | 3678 if (rhs_is_scalar) |
| 4747 | 3679 { |
| 6884 | 3680 lhs.make_unique (); |
| 3681 | |
| 5837 | 3682 if (n_idx < orig_lhs_dims_len) |
| 3683 lhs = lhs.reshape (lhs_dims); | |
| 3684 | |
| 5052 | 3685 lhs.resize_and_fill (new_dims, rfv); |
| 3686 | |
| 4747 | 3687 if (! final_lhs_dims.any_zero ()) |
| 3688 { | |
| 4749 | 3689 RT scalar = rhs.elem (0); |
| 3690 | |
| 6388 | 3691 if (n_idx == 1) |
| 3692 { | |
| 3693 idx_vector iidx = idx(0); | |
| 3694 | |
| 3695 octave_idx_type len = frozen_len(0); | |
| 3696 | |
| 6884 | 3697 if (iidx.is_colon ()) |
| 3698 { | |
| 3699 for (octave_idx_type i = 0; i < len; i++) | |
| 3700 lhs.xelem (i) = scalar; | |
| 3701 } | |
| 3702 else | |
| 6388 | 3703 { |
| 6884 | 3704 for (octave_idx_type i = 0; i < len; i++) |
| 3705 { | |
| 3706 octave_idx_type ii = iidx.elem (i); | |
| 3707 | |
| 3708 lhs.xelem (ii) = scalar; | |
| 3709 } | |
| 6388 | 3710 } |
| 3711 } | |
| 3712 else if (lhs_dims_len == 2 && n_idx == 2) | |
| 4747 | 3713 { |
| 6388 | 3714 idx_vector idx_i = idx(0); |
| 3715 idx_vector idx_j = idx(1); | |
| 3716 | |
| 3717 octave_idx_type i_len = frozen_len(0); | |
| 3718 octave_idx_type j_len = frozen_len(1); | |
| 3719 | |
| 6884 | 3720 if (idx_i.is_colon()) |
| 6388 | 3721 { |
| 6884 | 3722 for (octave_idx_type j = 0; j < j_len; j++) |
| 6388 | 3723 { |
| 6884 | 3724 octave_idx_type off = new_dims (0) * |
| 3725 idx_j.elem (j); | |
| 3726 for (octave_idx_type i = 0; i < i_len; i++) | |
| 3727 lhs.xelem (i + off) = scalar; | |
| 3728 } | |
| 3729 } | |
| 3730 else | |
| 3731 { | |
| 3732 for (octave_idx_type j = 0; j < j_len; j++) | |
| 3733 { | |
| 3734 octave_idx_type off = new_dims (0) * | |
| 3735 idx_j.elem (j); | |
| 3736 for (octave_idx_type i = 0; i < i_len; i++) | |
| 3737 { | |
| 3738 octave_idx_type ii = idx_i.elem (i); | |
| 3739 lhs.xelem (ii + off) = scalar; | |
| 3740 } | |
| 6388 | 3741 } |
| 3742 } | |
| 3743 } | |
| 3744 else | |
| 3745 { | |
| 3746 octave_idx_type n = Array<LT>::get_size (frozen_len); | |
| 3747 | |
| 3748 Array<octave_idx_type> result_idx (lhs_dims_len, 0); | |
| 3749 | |
| 3750 for (octave_idx_type i = 0; i < n; i++) | |
| 3751 { | |
| 3752 Array<octave_idx_type> elt_idx = get_elt_idx (idx, result_idx); | |
| 3753 | |
| 6884 | 3754 lhs.xelem (elt_idx) = scalar; |
| 6388 | 3755 |
| 3756 increment_index (result_idx, frozen_len); | |
| 3757 } | |
| 4747 | 3758 } |
| 3759 } | |
| 4743 | 3760 } |
| 4749 | 3761 else |
| 3762 { | |
| 3763 // RHS is matrix or higher dimension. | |
| 3764 | |
| 5275 | 3765 octave_idx_type n = Array<LT>::get_size (frozen_len); |
| 5264 | 3766 |
| 3767 if (n != rhs.numel ()) | |
| 4749 | 3768 { |
| 3769 (*current_liboctave_error_handler) | |
| 3770 ("A(IDX-LIST) = X: X must be a scalar or size of X must equal number of elements indexed by IDX-LIST"); | |
| 3771 | |
| 3772 retval = 0; | |
| 3773 } | |
| 3774 else | |
| 3775 { | |
| 6884 | 3776 lhs.make_unique (); |
| 3777 | |
| 5837 | 3778 if (n_idx < orig_lhs_dims_len) |
| 3779 lhs = lhs.reshape (lhs_dims); | |
| 3780 | |
| 5052 | 3781 lhs.resize_and_fill (new_dims, rfv); |
| 3782 | |
| 4749 | 3783 if (! final_lhs_dims.any_zero ()) |
| 3784 { | |
| 6388 | 3785 if (n_idx == 1) |
| 3786 { | |
| 3787 idx_vector iidx = idx(0); | |
| 3788 | |
| 3789 octave_idx_type len = frozen_len(0); | |
| 3790 | |
| 6884 | 3791 if (iidx.is_colon ()) |
| 3792 { | |
| 3793 for (octave_idx_type i = 0; i < len; i++) | |
| 3794 lhs.xelem (i) = rhs.elem (i); | |
| 3795 } | |
| 3796 else | |
| 6388 | 3797 { |
| 6884 | 3798 for (octave_idx_type i = 0; i < len; i++) |
| 3799 { | |
| 3800 octave_idx_type ii = iidx.elem (i); | |
| 3801 | |
| 3802 lhs.xelem (ii) = rhs.elem (i); | |
| 3803 } | |
| 6388 | 3804 } |
| 3805 } | |
| 3806 else if (lhs_dims_len == 2 && n_idx == 2) | |
| 4749 | 3807 { |
| 6388 | 3808 idx_vector idx_i = idx(0); |
| 3809 idx_vector idx_j = idx(1); | |
| 3810 | |
| 3811 octave_idx_type i_len = frozen_len(0); | |
| 3812 octave_idx_type j_len = frozen_len(1); | |
| 3813 octave_idx_type k = 0; | |
| 3814 | |
| 6884 | 3815 if (idx_i.is_colon()) |
| 6388 | 3816 { |
| 6884 | 3817 for (octave_idx_type j = 0; j < j_len; j++) |
| 6388 | 3818 { |
| 6884 | 3819 octave_idx_type off = new_dims (0) * |
| 3820 idx_j.elem (j); | |
| 3821 for (octave_idx_type i = 0; | |
| 3822 i < i_len; i++) | |
| 3823 lhs.xelem (i + off) = rhs.elem (k++); | |
| 6388 | 3824 } |
| 3825 } | |
| 6884 | 3826 else |
| 3827 { | |
| 3828 for (octave_idx_type j = 0; j < j_len; j++) | |
| 3829 { | |
| 3830 octave_idx_type off = new_dims (0) * | |
| 3831 idx_j.elem (j); | |
| 3832 for (octave_idx_type i = 0; i < i_len; i++) | |
| 3833 { | |
| 3834 octave_idx_type ii = idx_i.elem (i); | |
| 3835 lhs.xelem (ii + off) = rhs.elem (k++); | |
| 3836 } | |
| 3837 } | |
| 3838 } | |
| 3839 | |
| 6388 | 3840 } |
| 3841 else | |
| 3842 { | |
| 3843 n = Array<LT>::get_size (frozen_len); | |
| 3844 | |
| 3845 Array<octave_idx_type> result_idx (lhs_dims_len, 0); | |
| 3846 | |
| 3847 for (octave_idx_type i = 0; i < n; i++) | |
| 3848 { | |
| 3849 Array<octave_idx_type> elt_idx = get_elt_idx (idx, result_idx); | |
| 3850 | |
| 6884 | 3851 lhs.xelem (elt_idx) = rhs.elem (i); |
| 6388 | 3852 |
| 3853 increment_index (result_idx, frozen_len); | |
| 3854 } | |
| 4749 | 3855 } |
| 3856 } | |
| 3857 } | |
| 3858 } | |
| 4743 | 3859 } |
| 4517 | 3860 } |
| 4745 | 3861 |
| 5632 | 3862 lhs.clear_index (); |
| 3863 | |
| 5052 | 3864 if (retval != 0) |
| 5516 | 3865 lhs = lhs.reshape (final_lhs_dims); |
| 4517 | 3866 } |
| 3867 | |
| 5052 | 3868 if (retval != 0) |
| 3869 lhs.chop_trailing_singletons (); | |
| 4757 | 3870 |
| 4517 | 3871 lhs.clear_index (); |
| 3872 | |
| 3873 return retval; | |
| 3874 } | |
| 3875 | |
| 3876 template <class T> | |
| 3877 void | |
| 3933 | 3878 Array<T>::print_info (std::ostream& os, const std::string& prefix) const |
| 3879 { | |
| 3880 os << prefix << "rep address: " << rep << "\n" | |
| 3881 << prefix << "rep->len: " << rep->len << "\n" | |
| 3882 << prefix << "rep->data: " << static_cast<void *> (rep->data) << "\n" | |
| 3883 << prefix << "rep->count: " << rep->count << "\n"; | |
| 4513 | 3884 |
| 3885 // 2D info: | |
| 3886 // | |
| 4657 | 3887 // << pefix << "rows: " << rows () << "\n" |
| 4513 | 3888 // << prefix << "cols: " << cols () << "\n"; |
| 3933 | 3889 } |
| 3890 | |
| 237 | 3891 /* |
| 3892 ;;; Local Variables: *** | |
| 3893 ;;; mode: C++ *** | |
| 3894 ;;; End: *** | |
| 3895 */ |