Mercurial > hg > octave-nkf
annotate liboctave/dim-vector.h @ 8920:eb63fbe60fab
update copyright notices
| author | John W. Eaton <jwe@octave.org> |
|---|---|
| date | Sat, 07 Mar 2009 10:41:27 -0500 |
| parents | e9cb742df9eb |
| children | d865363208d6 |
| rev | line source |
|---|---|
| 4513 | 1 /* |
| 2 | |
| 8920 | 3 Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009 John W. Eaton |
| 4513 | 4 |
| 5 This file is part of Octave. | |
| 6 | |
| 7 Octave is free software; you can redistribute it and/or modify it | |
| 8 under the terms of the GNU General Public License as published by the | |
| 7016 | 9 Free Software Foundation; either version 3 of the License, or (at your |
| 10 option) any later version. | |
| 4513 | 11 |
| 12 Octave is distributed in the hope that it will be useful, but WITHOUT | |
| 13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| 14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
| 15 for more details. | |
| 16 | |
| 17 You should have received a copy of the GNU General Public License | |
| 7016 | 18 along with Octave; see the file COPYING. If not, see |
| 19 <http://www.gnu.org/licenses/>. | |
| 4513 | 20 |
| 21 */ | |
| 22 | |
| 23 #if !defined (octave_dim_vector_h) | |
| 24 #define octave_dim_vector_h 1 | |
| 25 | |
| 26 #include <cassert> | |
| 5765 | 27 #include <sstream> |
| 4543 | 28 #include <string> |
| 29 | |
| 6216 | 30 #include "lo-error.h" |
| 5275 | 31 #include "oct-types.h" |
| 4513 | 32 |
| 33 class | |
| 34 dim_vector | |
| 35 { | |
| 4548 | 36 protected: |
| 4513 | 37 |
| 4548 | 38 class dim_vector_rep |
| 39 { | |
| 40 public: | |
| 4513 | 41 |
| 5275 | 42 octave_idx_type *dims; |
| 4548 | 43 int ndims; |
| 44 int count; | |
| 4513 | 45 |
| 6216 | 46 dim_vector_rep (void) |
| 47 : dims (new octave_idx_type [2]), ndims (2), count (1) | |
| 48 { | |
| 49 dims[0] = 0; | |
| 50 dims[1] = 0; | |
| 51 } | |
| 4548 | 52 |
| 6216 | 53 |
| 54 dim_vector_rep (octave_idx_type n) | |
| 55 : dims (new octave_idx_type [2]), ndims (2), count (1) | |
| 4548 | 56 { |
| 57 dims[0] = n; | |
| 6216 | 58 dims[1] = 1; |
| 4548 | 59 } |
| 4513 | 60 |
| 6216 | 61 dim_vector_rep (octave_idx_type r, octave_idx_type c) |
| 62 : dims (new octave_idx_type [2]), ndims (2), count (1) | |
| 4548 | 63 { |
| 64 dims[0] = r; | |
| 65 dims[1] = c; | |
| 66 } | |
| 4513 | 67 |
| 5275 | 68 dim_vector_rep (octave_idx_type r, octave_idx_type c, octave_idx_type p) |
| 69 : dims (new octave_idx_type [3]), ndims (3), count (1) | |
| 4513 | 70 { |
| 4548 | 71 dims[0] = r; |
| 72 dims[1] = c; | |
| 73 dims[2] = p; | |
| 74 } | |
| 75 | |
| 76 dim_vector_rep (const dim_vector_rep& dv) | |
| 5275 | 77 : dims (dv.ndims > 0 ? new octave_idx_type [dv.ndims] : 0), |
| 4548 | 78 ndims (dv.ndims > 0 ? dv.ndims : 0), count (1) |
| 79 { | |
| 80 if (dims) | |
| 4513 | 81 { |
| 82 for (int i = 0; i < ndims; i++) | |
| 83 dims[i] = dv.dims[i]; | |
| 84 } | |
| 85 } | |
| 86 | |
| 6216 | 87 dim_vector_rep (octave_idx_type n, const dim_vector_rep *dv, |
| 88 int fill_value = 0) | |
| 5275 | 89 : dims ((dv && n > 0) ? new octave_idx_type [n] : 0), |
| 4548 | 90 ndims (n > 0 ? n : 0), count (1) |
| 4513 | 91 { |
| 4548 | 92 if (dims) |
| 4513 | 93 { |
| 4548 | 94 int dv_ndims = dv ? dv->ndims : 0; |
| 4513 | 95 |
| 4565 | 96 int min_len = n < dv_ndims ? n : dv_ndims; |
| 97 | |
| 98 for (int i = 0; i < min_len; i++) | |
| 4548 | 99 dims[i] = dv->dims[i]; |
| 4513 | 100 |
| 4548 | 101 for (int i = dv_ndims; i < n; i++) |
| 4887 | 102 dims[i] = fill_value; |
| 4513 | 103 } |
| 104 } | |
| 105 | |
| 4548 | 106 ~dim_vector_rep (void) { delete [] dims; } |
| 4513 | 107 |
| 4548 | 108 int length (void) const { return ndims; } |
| 4513 | 109 |
| 5275 | 110 octave_idx_type& elem (int i) |
| 4513 | 111 { |
| 4548 | 112 assert (i >= 0 && i < ndims); |
| 113 return dims[i]; | |
| 114 } | |
| 4513 | 115 |
| 5275 | 116 octave_idx_type elem (int i) const |
| 4548 | 117 { |
| 118 assert (i >= 0 && i < ndims); | |
| 4513 | 119 return dims[i]; |
| 120 } | |
| 121 | |
| 4673 | 122 void chop_trailing_singletons (void) |
| 123 { | |
| 124 for (int i = ndims - 1; i > 1; i--) | |
| 125 { | |
| 126 if (dims[i] == 1) | |
| 127 ndims--; | |
| 128 else | |
| 129 break; | |
| 130 } | |
| 131 } | |
| 132 | |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
133 void chop_all_singletons (void) |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
134 { |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
135 int j = 0; |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
136 for (int i = 0; i < ndims; i++) |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
137 { |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
138 if (dims[i] != 1) |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
139 dims[j++] = dims[i]; |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
140 } |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
141 if (j == 1) dims[1] = 1; |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
142 ndims = j > 2 ? j : 2; |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
143 } |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
144 |
| 4548 | 145 private: |
| 146 | |
| 147 // No assignment! | |
| 148 | |
| 149 dim_vector_rep& operator = (const dim_vector_rep& dv); | |
| 150 }; | |
| 151 | |
| 152 dim_vector_rep *rep; | |
| 153 | |
| 154 void make_unique (void) | |
| 155 { | |
| 156 if (rep->count > 1) | |
| 157 { | |
| 158 --rep->count; | |
| 159 rep = new dim_vector_rep (*rep); | |
| 160 } | |
| 161 } | |
| 162 | |
| 163 private: | |
| 164 | |
| 165 dim_vector_rep *nil_rep (void) const | |
| 166 { | |
| 167 static dim_vector_rep *nr = new dim_vector_rep (); | |
| 168 | |
| 169 return nr; | |
| 170 } | |
| 171 | |
| 172 public: | |
| 173 | |
| 174 explicit dim_vector (void) | |
| 175 : rep (nil_rep ()) { rep->count++; } | |
| 176 | |
| 5275 | 177 explicit dim_vector (octave_idx_type n) |
| 4548 | 178 : rep (new dim_vector_rep (n)) { } |
| 179 | |
| 5275 | 180 explicit dim_vector (octave_idx_type r, octave_idx_type c) |
| 4548 | 181 : rep (new dim_vector_rep (r, c)) { } |
| 182 | |
| 5275 | 183 explicit dim_vector (octave_idx_type r, octave_idx_type c, octave_idx_type p) |
| 4548 | 184 : rep (new dim_vector_rep (r, c, p)) { } |
| 185 | |
| 186 dim_vector (const dim_vector& dv) | |
| 187 : rep (dv.rep) { rep->count++; } | |
| 188 | |
| 189 dim_vector& operator = (const dim_vector& dv) | |
| 190 { | |
| 191 if (&dv != this) | |
| 192 { | |
| 193 if (--rep->count <= 0) | |
| 194 delete rep; | |
| 195 | |
| 196 rep = dv.rep; | |
| 197 rep->count++; | |
| 198 } | |
| 199 | |
| 200 return *this; | |
| 201 } | |
| 202 | |
| 203 ~dim_vector (void) | |
| 204 { | |
| 205 if (--rep->count <= 0) | |
| 206 delete rep; | |
| 207 } | |
| 208 | |
| 209 int length (void) const { return rep->length (); } | |
| 210 | |
| 5275 | 211 octave_idx_type& elem (int i) { make_unique (); return rep->elem (i); } |
| 4548 | 212 |
| 5275 | 213 octave_idx_type elem (int i) const { return rep->elem (i); } |
| 4513 | 214 |
| 5275 | 215 octave_idx_type& operator () (int i) { return elem (i); } |
| 4513 | 216 |
| 5275 | 217 octave_idx_type operator () (int i) const { return elem (i); } |
| 4513 | 218 |
| 4887 | 219 void resize (int n, int fill_value = 0) |
| 4548 | 220 { |
| 221 int len = length (); | |
| 4513 | 222 |
| 4548 | 223 if (n != len) |
| 224 { | |
| 6216 | 225 if (n < 2) |
| 226 { | |
| 227 (*current_liboctave_error_handler) | |
| 228 ("unable to resize object to fewer than 2 dimensions"); | |
| 229 return; | |
| 230 } | |
| 231 | |
| 4548 | 232 dim_vector_rep *old_rep = rep; |
| 4513 | 233 |
| 4887 | 234 rep = new dim_vector_rep (n, old_rep, fill_value); |
| 4513 | 235 |
| 4548 | 236 if (--old_rep->count <= 0) |
| 237 delete old_rep; | |
| 238 } | |
| 239 } | |
| 4513 | 240 |
| 4559 | 241 std::string str (char sep = 'x') const |
| 4548 | 242 { |
| 5765 | 243 std::ostringstream buf; |
| 4543 | 244 |
| 4548 | 245 for (int i = 0; i < length (); i++) |
| 246 { | |
| 247 buf << elem (i); | |
| 4543 | 248 |
| 4548 | 249 if (i < length () - 1) |
| 4559 | 250 buf << sep; |
| 4548 | 251 } |
| 4543 | 252 |
| 5765 | 253 std::string retval = buf.str (); |
| 4543 | 254 |
| 4548 | 255 return retval; |
| 256 } | |
| 4543 | 257 |
| 258 bool all_zero (void) const | |
| 4548 | 259 { |
| 260 bool retval = true; | |
| 4543 | 261 |
| 4548 | 262 for (int i = 0; i < length (); i++) |
| 263 { | |
| 264 if (elem (i) != 0) | |
| 265 { | |
| 266 retval = false; | |
| 267 break; | |
| 268 } | |
| 269 } | |
| 4543 | 270 |
| 4548 | 271 return retval; |
| 272 } | |
| 4559 | 273 |
| 274 bool any_zero (void) const | |
| 275 { | |
| 276 bool retval = false; | |
| 277 | |
| 278 for (int i = 0; i < length (); i++) | |
| 279 { | |
| 280 if (elem (i) == 0) | |
| 281 { | |
| 282 retval = true; | |
| 283 break; | |
| 284 } | |
| 285 } | |
| 286 | |
| 287 return retval; | |
| 288 } | |
| 4567 | 289 |
| 4635 | 290 int |
| 291 num_ones (void) const | |
| 292 { | |
| 293 int retval = 0; | |
| 294 | |
| 295 for (int i = 0; i < length (); i++) | |
| 296 if (elem (i) == 1) | |
| 297 retval++; | |
| 298 | |
| 299 return retval; | |
| 300 } | |
| 301 | |
| 4655 | 302 bool |
| 303 all_ones (void) const | |
| 304 { | |
| 305 return (num_ones () == length ()); | |
| 306 } | |
| 307 | |
| 4567 | 308 // This is the number of elements that a matrix with this dimension |
| 309 // vector would have, NOT the number of dimensions (elements in the | |
| 310 // dimension vector). | |
| 311 | |
| 5275 | 312 octave_idx_type numel (void) const |
| 4567 | 313 { |
| 314 int n_dims = length (); | |
| 315 | |
| 5275 | 316 octave_idx_type retval = n_dims > 0 ? elem (0) : 0; |
| 4567 | 317 |
| 318 for (int i = 1; i < n_dims; i++) | |
| 319 retval *= elem (i); | |
| 320 | |
| 321 return retval; | |
| 322 } | |
| 4673 | 323 |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
324 bool any_neg (void) const |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
325 { |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
326 int n_dims = length (), i; |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
327 for (i = 0; i < n_dims; i++) |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
328 if (elem (i) < 0) break; |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
329 return i < n_dims; |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
330 } |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
331 |
| 4673 | 332 void chop_trailing_singletons (void) |
| 333 { | |
| 334 make_unique (); | |
| 335 rep->chop_trailing_singletons (); | |
| 336 } | |
| 4735 | 337 |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
338 void chop_all_singletons (void) |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
339 { |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
340 make_unique (); |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
341 rep->chop_all_singletons (); |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
342 } |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
343 |
| 4735 | 344 dim_vector squeeze (void) const |
| 345 { | |
| 346 dim_vector new_dims = *this; | |
| 347 | |
| 348 bool dims_changed = 1; | |
| 349 | |
| 350 int k = 0; | |
| 351 | |
| 352 for (int i = 0; i < length (); i++) | |
| 353 { | |
| 354 if (elem (i) == 1) | |
| 355 dims_changed = true; | |
| 356 else | |
| 357 new_dims(k++) = elem (i); | |
| 358 } | |
| 359 | |
| 360 if (dims_changed) | |
| 361 { | |
| 362 if (k == 0) | |
| 363 new_dims = dim_vector (1, 1); | |
| 364 else if (k == 1) | |
| 365 { | |
| 366 // There is one non-singleton dimension, so we need | |
| 367 // to decide the correct orientation. | |
| 368 | |
| 369 if (elem (0) == 1) | |
| 370 { | |
| 371 // The original dimension vector had a leading | |
| 372 // singleton dimension. | |
| 373 | |
| 5275 | 374 octave_idx_type tmp = new_dims(0); |
| 4735 | 375 |
| 376 new_dims.resize (2); | |
| 377 | |
| 378 new_dims(0) = 1; | |
| 379 new_dims(1) = tmp; | |
| 380 } | |
| 381 else | |
| 382 { | |
| 383 // The first element of the original dimension vector | |
| 384 // was not a singleton dimension. | |
| 385 | |
| 386 new_dims.resize (2); | |
| 387 | |
| 388 new_dims(1) = 1; | |
| 389 } | |
| 390 } | |
| 391 else | |
| 392 new_dims.resize(k); | |
| 393 } | |
| 394 | |
| 395 return new_dims; | |
| 396 } | |
| 4915 | 397 |
| 398 bool concat (const dim_vector& dvb, int dim = 0) | |
| 399 { | |
| 400 if (all_zero ()) | |
| 401 { | |
| 402 *this = dvb; | |
| 403 return true; | |
| 404 } | |
| 405 | |
| 406 if (dvb.all_zero ()) | |
| 407 return true; | |
| 408 | |
| 409 int na = length (); | |
| 410 int nb = dvb.length (); | |
| 411 | |
| 412 // Find the max and min value of na and nb | |
| 413 int n_max = na > nb ? na : nb; | |
| 414 int n_min = na < nb ? na : nb; | |
| 415 | |
| 416 // The elements of the dimension vectors can only differ | |
| 417 // if the dim variable differs from the actual dimension | |
| 418 // they differ. | |
| 419 | |
| 420 for (int i = 0; i < n_min; i++) | |
| 421 { | |
| 422 if (elem(i) != dvb(i) && dim != i) | |
| 423 return false; | |
| 424 } | |
| 425 | |
| 426 // Ditto. | |
| 427 for (int i = n_min; i < n_max; i++) | |
| 428 { | |
| 429 if (na > n_min) | |
| 430 { | |
| 431 if (elem(i) != 1 && dim != i) | |
| 432 return false; | |
| 433 } | |
| 434 else | |
| 435 { | |
| 436 if (dvb(i) != 1 && dim != i) | |
| 437 return false; | |
| 438 } | |
| 439 } | |
| 440 | |
| 441 // If we want to add the dimension vectors at a dimension | |
| 442 // larger than both, then we need to set n_max to this number | |
| 443 // so that we resize *this to the right dimension. | |
| 444 | |
| 445 n_max = n_max > (dim + 1) ? n_max : (dim + 1); | |
| 446 | |
| 447 // Resize *this to the appropriate dimensions. | |
| 448 | |
| 449 if (n_max > na) | |
| 450 { | |
| 451 dim_vector_rep *old_rep = rep; | |
| 452 | |
| 453 rep = new dim_vector_rep (n_max, old_rep, 1); | |
| 454 | |
| 455 if (--old_rep->count <= 0) | |
| 456 delete old_rep; | |
| 457 } | |
| 458 | |
| 459 // Larger or equal since dim has been decremented by one. | |
| 460 | |
| 461 if (dim >= nb) | |
| 4940 | 462 elem (dim)++; |
| 4915 | 463 else |
| 464 elem (dim) += dvb(dim); | |
| 465 | |
| 466 return true; | |
| 467 } | |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
468 |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
469 // Forces certain dimensionality, preserving numel (). Missing dimensions are |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
470 // set to 1, redundant are folded into the trailing one. If n = 1, the result |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
471 // is 2d and the second dim is 1 (dim_vectors are always at least 2D). |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
472 // If the original dimensions were all zero, the padding value is zero. |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
473 dim_vector redim (int n) const |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
474 { |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
475 int n_dims = length (); |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
476 if (n_dims == n) |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
477 return *this; |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
478 else |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
479 { |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
480 dim_vector retval; |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
481 retval.resize (n == 1 ? 2 : n, 1); |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
482 |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
483 bool zeros = true; |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
484 for (int i = 0; i < n && i < n_dims; i++) |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
485 { |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
486 retval(i) = elem (i); |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
487 zeros = zeros && elem (i) == 0; |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
488 } |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
489 |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
490 if (n < n_dims) |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
491 { |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
492 octave_idx_type k = 1; |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
493 for (int i = n; i < n_dims; i++) |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
494 k *= elem (i); |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
495 retval(n - 1) *= k; |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
496 } |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
497 else if (zeros) |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
498 { |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
499 for (int i = n_dims; i < n; i++) |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
500 retval.elem (i) = 0; |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
501 } |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
502 |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
503 return retval; |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
504 } |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
505 } |
|
8721
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8290
diff
changeset
|
506 |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8290
diff
changeset
|
507 bool is_vector (void) const |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8290
diff
changeset
|
508 { |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8290
diff
changeset
|
509 return (length () == 2 && (elem (0) == 1 || elem (1) == 1)); |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8290
diff
changeset
|
510 } |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8290
diff
changeset
|
511 |
| 4513 | 512 }; |
| 513 | |
| 4543 | 514 static inline bool |
| 515 operator == (const dim_vector& a, const dim_vector& b) | |
| 516 { | |
| 517 bool retval = true; | |
| 518 | |
| 519 int a_len = a.length (); | |
| 520 int b_len = b.length (); | |
| 521 | |
| 522 if (a_len != b_len) | |
| 523 retval = false; | |
| 524 else | |
| 525 { | |
| 526 for (int i = 0; i < a_len; i++) | |
| 527 { | |
| 528 if (a(i) != b(i)) | |
| 529 { | |
| 530 retval = false; | |
| 531 break; | |
| 532 } | |
| 533 } | |
| 534 } | |
| 535 | |
| 536 return retval; | |
| 537 } | |
| 538 | |
| 539 static inline bool | |
| 540 operator != (const dim_vector& a, const dim_vector& b) | |
| 541 { | |
| 542 return ! operator == (a, b); | |
| 543 } | |
| 544 | |
| 4513 | 545 #endif |
| 546 | |
| 547 /* | |
| 548 ;;; Local Variables: *** | |
| 549 ;;; mode: C++ *** | |
| 550 ;;; End: *** | |
| 551 */ |