Mercurial > hg > octave-nkf
annotate liboctave/dim-vector.h @ 10150:3778ea95adea
style fixes
| author | John W. Eaton <jwe@octave.org> |
|---|---|
| date | Wed, 20 Jan 2010 13:31:45 -0500 |
| parents | eb8ac0eed9f1 |
| children | 12884915a8e4 |
| rev | line source |
|---|---|
| 4513 | 1 /* |
| 2 | |
| 8920 | 3 Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009 John W. Eaton |
|
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
4 Copyirght (C) 2009 VZLU Prague |
| 4513 | 5 |
| 6 This file is part of Octave. | |
| 7 | |
| 8 Octave is free software; you can redistribute it and/or modify it | |
| 9 under the terms of the GNU General Public License as published by the | |
| 7016 | 10 Free Software Foundation; either version 3 of the License, or (at your |
| 11 option) any later version. | |
| 4513 | 12 |
| 13 Octave is distributed in the hope that it will be useful, but WITHOUT | |
| 14 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| 15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
| 16 for more details. | |
| 17 | |
| 18 You should have received a copy of the GNU General Public License | |
| 7016 | 19 along with Octave; see the file COPYING. If not, see |
| 20 <http://www.gnu.org/licenses/>. | |
| 4513 | 21 |
| 22 */ | |
| 23 | |
| 24 #if !defined (octave_dim_vector_h) | |
| 25 #define octave_dim_vector_h 1 | |
| 26 | |
| 27 #include <cassert> | |
|
9840
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
28 #include <limits> |
|
8950
d865363208d6
include <iosfwd> instead of <iostream> in header files
John W. Eaton <jwe@octave.org>
parents:
8920
diff
changeset
|
29 |
| 5765 | 30 #include <sstream> |
| 4543 | 31 #include <string> |
| 32 | |
| 6216 | 33 #include "lo-error.h" |
| 4513 | 34 |
| 10150 | 35 // Rationale: This implementation is more tricky than Array, but the |
| 36 // big plus is that dim_vector requires only one allocation instead of | |
| 37 // two. It is (slightly) patterned after GCC's basic_string | |
| 38 // implementation. rep is a pointer to an array of memory, comprising | |
| 39 // count, length, and the data: | |
| 40 // | |
|
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
41 // <count> |
|
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
42 // <ndims> |
|
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
43 // rep --> <dims[0]> |
|
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
44 // <dims[1]> |
| 10150 | 45 // ... |
|
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
46 // |
| 10150 | 47 // The inlines count(), ndims() recover this data from the rep. Note |
| 48 // that rep points to the beginning of dims to grant faster access | |
| 49 // (reinterpret_cast is assumed to be an inexpensive operation). | |
|
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
50 |
| 4513 | 51 class |
| 52 dim_vector | |
| 53 { | |
|
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
54 private: |
| 4513 | 55 |
|
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
56 octave_idx_type *rep; |
| 4548 | 57 |
| 10150 | 58 octave_idx_type& ndims (void) const { return rep[-1]; } |
| 4513 | 59 |
| 10150 | 60 octave_idx_type& count (void) const { return rep[-2]; } |
| 4513 | 61 |
| 10150 | 62 // Construct a new rep with count = 1 and ndims given. |
| 63 | |
|
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
64 static octave_idx_type *newrep (int ndims) |
| 10150 | 65 { |
| 66 octave_idx_type *r = new octave_idx_type[ndims + 2]; | |
| 67 | |
| 68 *r++ = 1; | |
| 69 *r++ = ndims; | |
| 4513 | 70 |
| 10150 | 71 return r; |
| 72 } | |
| 73 | |
| 74 // Clone this->rep. | |
| 75 | |
|
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
76 octave_idx_type *clonerep (void) |
| 10150 | 77 { |
| 78 int l = ndims (); | |
| 79 | |
| 80 octave_idx_type *r = new octave_idx_type[l + 2]; | |
| 81 | |
| 82 *r++ = 1; | |
| 83 *r++ = l; | |
| 4513 | 84 |
| 10150 | 85 for (int i = 0; i < l; i++) |
| 86 r[i] = rep[i]; | |
| 87 | |
| 88 return r; | |
| 89 } | |
| 90 | |
| 91 // Clone and resize this->rep to length n, filling by given value. | |
| 92 | |
|
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
93 octave_idx_type *resizerep (int n, octave_idx_type fill_value) |
| 10150 | 94 { |
| 95 int l = ndims (); | |
| 96 | |
| 97 if (n < 2) | |
| 98 n = 2; | |
| 99 | |
| 100 octave_idx_type *r = new octave_idx_type[n + 2]; | |
| 101 | |
| 102 *r++ = 1; | |
| 103 *r++ = n; | |
| 104 | |
| 105 if (l > n) | |
| 106 l = n; | |
| 4673 | 107 |
| 10150 | 108 int j; |
| 109 for (j = 0; j < l; j++) | |
| 110 r[j] = rep[j]; | |
| 111 for (; j < n; j++) | |
| 112 r[j] = fill_value; | |
| 113 | |
| 114 return r; | |
| 115 } | |
| 116 | |
| 117 // Free the rep. | |
| 118 | |
|
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
119 void freerep (void) |
| 10150 | 120 { |
| 121 assert (count () == 0); | |
| 122 delete [] (rep - 2); | |
| 123 } | |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
124 |
| 4548 | 125 void make_unique (void) |
| 126 { | |
| 10150 | 127 if (count () > 1) |
| 4548 | 128 { |
|
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
129 --count(); |
|
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
130 rep = clonerep (); |
| 4548 | 131 } |
| 132 } | |
| 133 | |
| 134 public: | |
| 135 | |
| 5275 | 136 explicit dim_vector (octave_idx_type n) |
|
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
137 : rep (newrep (2)) |
| 10150 | 138 { |
| 139 rep[0] = n; | |
| 140 rep[1] = 1; | |
| 141 } | |
| 4548 | 142 |
| 5275 | 143 explicit dim_vector (octave_idx_type r, octave_idx_type c) |
|
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
144 : rep (newrep (2)) |
| 10150 | 145 { |
| 146 rep[0] = r; | |
| 147 rep[1] = c; | |
| 148 } | |
| 4548 | 149 |
| 5275 | 150 explicit dim_vector (octave_idx_type r, octave_idx_type c, octave_idx_type p) |
|
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
151 : rep (newrep (3)) |
| 10150 | 152 { |
| 153 rep[0] = r; | |
| 154 rep[1] = c; | |
| 155 rep[2] = p; | |
| 156 } | |
|
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
157 |
|
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
158 octave_idx_type& elem (int i) |
| 10150 | 159 { |
| 160 assert (i >= 0 && i < ndims ()); | |
| 161 make_unique (); | |
| 162 return rep[i]; | |
| 163 } | |
|
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
164 |
|
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
165 octave_idx_type elem (int i) const |
| 10150 | 166 { |
| 167 assert (i >= 0 && i < ndims ()); | |
| 168 return rep[i]; | |
| 169 } | |
|
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
170 |
|
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
171 void chop_trailing_singletons (void) |
| 10150 | 172 { |
| 173 int l = ndims (); | |
| 174 if (l > 2 && rep[l-1] == 1) | |
| 175 { | |
| 176 make_unique (); | |
| 177 do | |
| 178 l--; | |
| 179 while (l > 2 && rep[l-1] == 1); | |
| 180 ndims () = l; | |
| 181 } | |
| 182 } | |
|
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
183 |
|
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
184 void chop_all_singletons (void) |
| 10150 | 185 { |
| 186 make_unique (); | |
| 187 | |
| 188 int j = 0; | |
| 189 int l = ndims(); | |
|
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
190 |
| 10150 | 191 for (int i = 0; i < l; i++) |
| 192 { | |
| 193 if (rep[i] != 1) | |
| 194 rep[j++] = rep[i]; | |
| 195 } | |
|
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
196 |
| 10150 | 197 if (j == 1) |
| 198 rep[1] = 1; | |
|
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
199 |
| 10150 | 200 ndims () = j > 2 ? j : 2; |
| 201 } | |
|
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
202 |
|
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
203 private: |
|
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
204 |
|
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
205 static octave_idx_type *nil_rep (void) |
|
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
206 { |
|
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
207 static dim_vector zv (0, 0); |
|
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
208 return zv.rep; |
|
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
209 } |
|
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
210 |
|
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
211 explicit dim_vector (octave_idx_type *r) |
|
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
212 : rep (r) { } |
|
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
213 |
|
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
214 public: |
|
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
215 |
| 10150 | 216 explicit dim_vector (void) : rep (nil_rep ()) { count()++; } |
| 4548 | 217 |
| 10150 | 218 dim_vector (const dim_vector& dv) : rep (dv.rep) { count()++; } |
|
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
219 |
|
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
220 static dim_vector alloc (int n) |
| 10150 | 221 { |
| 222 return dim_vector (newrep (n < 2 ? 2 : n)); | |
| 223 } | |
| 4548 | 224 |
| 225 dim_vector& operator = (const dim_vector& dv) | |
| 226 { | |
| 227 if (&dv != this) | |
| 228 { | |
| 10150 | 229 if (--count() <= 0) |
|
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
230 freerep (); |
| 4548 | 231 |
| 10150 | 232 rep = dv.rep; |
|
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
233 count()++; |
| 4548 | 234 } |
| 235 | |
| 236 return *this; | |
| 237 } | |
| 238 | |
| 239 ~dim_vector (void) | |
| 240 { | |
|
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
241 if (--count() <= 0) |
|
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
242 freerep (); |
| 4548 | 243 } |
| 244 | |
| 10150 | 245 int length (void) const { return ndims (); } |
| 4513 | 246 |
| 5275 | 247 octave_idx_type& operator () (int i) { return elem (i); } |
| 4513 | 248 |
| 5275 | 249 octave_idx_type operator () (int i) const { return elem (i); } |
| 4513 | 250 |
| 4887 | 251 void resize (int n, int fill_value = 0) |
| 4548 | 252 { |
| 253 int len = length (); | |
| 4513 | 254 |
| 4548 | 255 if (n != len) |
| 256 { | |
|
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
257 octave_idx_type *r = resizerep (n, fill_value); |
| 4513 | 258 |
|
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
259 if (--count() <= 0) |
|
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
260 freerep (); |
| 4513 | 261 |
|
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
262 rep = r; |
| 4548 | 263 } |
| 264 } | |
| 4513 | 265 |
| 4559 | 266 std::string str (char sep = 'x') const |
| 4548 | 267 { |
| 5765 | 268 std::ostringstream buf; |
| 4543 | 269 |
| 4548 | 270 for (int i = 0; i < length (); i++) |
| 271 { | |
| 10150 | 272 buf << elem (i); |
| 4543 | 273 |
| 10150 | 274 if (i < length () - 1) |
| 275 buf << sep; | |
| 4548 | 276 } |
| 4543 | 277 |
| 5765 | 278 std::string retval = buf.str (); |
| 4543 | 279 |
| 4548 | 280 return retval; |
| 281 } | |
| 4543 | 282 |
| 283 bool all_zero (void) const | |
| 4548 | 284 { |
| 285 bool retval = true; | |
| 4543 | 286 |
| 4548 | 287 for (int i = 0; i < length (); i++) |
| 288 { | |
| 10150 | 289 if (elem (i) != 0) |
| 290 { | |
| 291 retval = false; | |
| 292 break; | |
| 293 } | |
| 4548 | 294 } |
| 4543 | 295 |
| 4548 | 296 return retval; |
| 297 } | |
| 4559 | 298 |
|
9886
cddd5c3d5f04
fix & extend special-case optimizations for indexed assignment
Jaroslav Hajek <highegg@gmail.com>
parents:
9840
diff
changeset
|
299 bool zero_by_zero (void) const |
|
cddd5c3d5f04
fix & extend special-case optimizations for indexed assignment
Jaroslav Hajek <highegg@gmail.com>
parents:
9840
diff
changeset
|
300 { |
|
cddd5c3d5f04
fix & extend special-case optimizations for indexed assignment
Jaroslav Hajek <highegg@gmail.com>
parents:
9840
diff
changeset
|
301 return length () == 2 && elem (0) == 0 && elem (1) == 0; |
|
cddd5c3d5f04
fix & extend special-case optimizations for indexed assignment
Jaroslav Hajek <highegg@gmail.com>
parents:
9840
diff
changeset
|
302 } |
|
cddd5c3d5f04
fix & extend special-case optimizations for indexed assignment
Jaroslav Hajek <highegg@gmail.com>
parents:
9840
diff
changeset
|
303 |
| 4559 | 304 bool any_zero (void) const |
| 305 { | |
| 306 bool retval = false; | |
| 307 | |
| 308 for (int i = 0; i < length (); i++) | |
| 309 { | |
| 10150 | 310 if (elem (i) == 0) |
| 311 { | |
| 312 retval = true; | |
| 313 break; | |
| 314 } | |
| 4559 | 315 } |
| 316 | |
| 317 return retval; | |
| 318 } | |
| 4567 | 319 |
| 10150 | 320 int num_ones (void) const |
| 4635 | 321 { |
| 322 int retval = 0; | |
| 323 | |
| 324 for (int i = 0; i < length (); i++) | |
| 325 if (elem (i) == 1) | |
| 10150 | 326 retval++; |
| 4635 | 327 |
| 328 return retval; | |
| 329 } | |
| 330 | |
| 10150 | 331 bool all_ones (void) const |
| 4655 | 332 { |
| 333 return (num_ones () == length ()); | |
| 334 } | |
| 335 | |
| 10150 | 336 // Return the number of elements that a matrix with this dimension |
| 4567 | 337 // vector would have, NOT the number of dimensions (elements in the |
| 338 // dimension vector). | |
| 339 | |
|
9027
9a46ba093db4
generalize dim_vector::numel
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
340 octave_idx_type numel (int n = 0) const |
| 4567 | 341 { |
| 342 int n_dims = length (); | |
| 343 | |
|
9027
9a46ba093db4
generalize dim_vector::numel
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
344 octave_idx_type retval = 1; |
| 4567 | 345 |
|
9027
9a46ba093db4
generalize dim_vector::numel
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
346 for (int i = n; i < n_dims; i++) |
| 4567 | 347 retval *= elem (i); |
| 348 | |
| 349 return retval; | |
| 350 } | |
| 4673 | 351 |
|
9840
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
352 // The following function will throw a std::bad_alloc () |
|
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
353 // exception if the requested size is larger than can be indexed by |
|
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
354 // octave_idx_type. This may be smaller than the actual amount of |
|
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
355 // memory that can be safely allocated on a system. However, if we |
|
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
356 // don't fail here, we can end up with a mysterious crash inside a |
|
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
357 // function that is iterating over an array using octave_idx_type |
|
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
358 // indices. |
|
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
359 |
|
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
360 octave_idx_type safe_numel (void) const |
|
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
361 { |
|
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
362 octave_idx_type idx_max = std::numeric_limits<octave_idx_type>::max () - 1; |
|
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
363 octave_idx_type n = 1; |
|
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
364 int n_dims = length (); |
| 10150 | 365 |
|
9840
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
366 for (int i = 0; i < n_dims; i++) |
|
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
367 { |
|
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
368 n *= rep[i]; |
|
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
369 if (rep[i] != 0) |
|
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
370 idx_max /= rep[i]; |
|
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
371 if (idx_max <= 0) |
|
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
372 throw std::bad_alloc (); |
|
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
373 } |
| 10150 | 374 |
|
9840
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
375 return n; |
|
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
376 } |
|
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
377 |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
378 bool any_neg (void) const |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
379 { |
| 10150 | 380 int n_dims = length (); |
| 381 int i; | |
| 382 | |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
383 for (i = 0; i < n_dims; i++) |
| 10150 | 384 if (elem (i) < 0) |
| 385 break; | |
| 386 | |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
387 return i < n_dims; |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
388 } |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
389 |
| 4735 | 390 dim_vector squeeze (void) const |
| 391 { | |
| 392 dim_vector new_dims = *this; | |
| 393 | |
| 394 bool dims_changed = 1; | |
| 395 | |
| 396 int k = 0; | |
| 397 | |
| 398 for (int i = 0; i < length (); i++) | |
| 399 { | |
| 10150 | 400 if (elem (i) == 1) |
| 401 dims_changed = true; | |
| 402 else | |
| 403 new_dims(k++) = elem (i); | |
| 4735 | 404 } |
| 405 | |
| 406 if (dims_changed) | |
| 407 { | |
| 10150 | 408 if (k == 0) |
| 409 new_dims = dim_vector (1, 1); | |
| 410 else if (k == 1) | |
| 411 { | |
| 412 // There is one non-singleton dimension, so we need | |
| 413 // to decide the correct orientation. | |
| 4735 | 414 |
| 10150 | 415 if (elem (0) == 1) |
| 416 { | |
| 417 // The original dimension vector had a leading | |
| 418 // singleton dimension. | |
| 4735 | 419 |
| 10150 | 420 octave_idx_type tmp = new_dims(0); |
| 421 | |
| 422 new_dims.resize (2); | |
| 4735 | 423 |
| 10150 | 424 new_dims(0) = 1; |
| 425 new_dims(1) = tmp; | |
| 426 } | |
| 427 else | |
| 428 { | |
| 429 // The first element of the original dimension vector | |
| 430 // was not a singleton dimension. | |
| 4735 | 431 |
| 10150 | 432 new_dims.resize (2); |
| 4735 | 433 |
| 10150 | 434 new_dims(1) = 1; |
| 435 } | |
| 436 } | |
| 437 else | |
| 438 new_dims.resize(k); | |
| 4735 | 439 } |
| 440 | |
| 441 return new_dims; | |
| 442 } | |
| 4915 | 443 |
| 444 bool concat (const dim_vector& dvb, int dim = 0) | |
| 445 { | |
| 446 if (all_zero ()) | |
| 447 { | |
| 10150 | 448 *this = dvb; |
| 449 return true; | |
| 4915 | 450 } |
| 451 | |
| 452 if (dvb.all_zero ()) | |
| 453 return true; | |
| 454 | |
| 455 int na = length (); | |
| 456 int nb = dvb.length (); | |
| 457 | |
| 458 // Find the max and min value of na and nb | |
| 459 int n_max = na > nb ? na : nb; | |
| 460 int n_min = na < nb ? na : nb; | |
| 461 | |
| 462 // The elements of the dimension vectors can only differ | |
| 463 // if the dim variable differs from the actual dimension | |
| 464 // they differ. | |
| 465 | |
| 466 for (int i = 0; i < n_min; i++) | |
| 467 { | |
| 10150 | 468 if (elem(i) != dvb(i) && dim != i) |
| 469 return false; | |
| 4915 | 470 } |
| 471 | |
| 472 // Ditto. | |
| 473 for (int i = n_min; i < n_max; i++) | |
| 474 { | |
| 10150 | 475 if (na > n_min) |
| 476 { | |
| 477 if (elem(i) != 1 && dim != i) | |
| 478 return false; | |
| 479 } | |
| 480 else | |
| 481 { | |
| 482 if (dvb(i) != 1 && dim != i) | |
| 483 return false; | |
| 484 } | |
| 4915 | 485 } |
| 486 | |
| 487 // If we want to add the dimension vectors at a dimension | |
| 488 // larger than both, then we need to set n_max to this number | |
| 489 // so that we resize *this to the right dimension. | |
| 490 | |
| 491 n_max = n_max > (dim + 1) ? n_max : (dim + 1); | |
| 492 | |
| 493 // Resize *this to the appropriate dimensions. | |
| 494 | |
| 495 if (n_max > na) | |
|
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
496 resize (n_max, 1); |
| 4915 | 497 |
| 498 // Larger or equal since dim has been decremented by one. | |
| 499 | |
| 500 if (dim >= nb) | |
| 4940 | 501 elem (dim)++; |
| 4915 | 502 else |
| 503 elem (dim) += dvb(dim); | |
| 504 | |
| 505 return true; | |
| 506 } | |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
507 |
| 10150 | 508 // Force certain dimensionality, preserving numel (). Missing |
| 509 // dimensions are set to 1, redundant are folded into the trailing | |
| 510 // one. If n = 1, the result is 2d and the second dim is 1 | |
| 511 // (dim_vectors are always at least 2D). If the original dimensions | |
| 512 // were all zero, the padding value is zero. | |
| 513 | |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
514 dim_vector redim (int n) const |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
515 { |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
516 int n_dims = length (); |
| 10150 | 517 |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
518 if (n_dims == n) |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
519 return *this; |
|
9666
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
520 else if (n_dims < n) |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
521 { |
|
9666
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
522 dim_vector retval = alloc (n); |
|
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
523 |
|
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
524 int pad = 0; |
|
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
525 for (int i = 0; i < n_dims; i++) |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
526 { |
|
9666
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
527 retval.rep[i] = rep[i]; |
|
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
528 if (rep[i] != 0) |
|
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
529 pad = 1; |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
530 } |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
531 |
|
9666
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
532 for (int i = n_dims; i < n; i++) |
|
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
533 retval.rep[i] = pad; |
|
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
534 |
|
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
535 return retval; |
|
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
536 } |
|
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
537 else |
|
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
538 { |
|
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
539 if (n < 1) n = 1; |
|
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
540 |
|
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
541 dim_vector retval = alloc (n); |
|
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
542 |
|
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
543 retval.rep[1] = 1; |
|
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
544 |
|
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
545 for (int i = 0; i < n-1; i++) |
|
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
546 retval.rep[i] = rep[i]; |
|
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
547 |
|
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
548 int k = rep[n-1]; |
|
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
549 for (int i = n; i < n_dims; i++) |
|
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
550 k *= rep[i]; |
|
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
551 |
|
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
552 retval.rep[n-1] = k; |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
553 |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
554 return retval; |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
555 } |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
556 } |
|
8721
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8290
diff
changeset
|
557 |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8290
diff
changeset
|
558 bool is_vector (void) const |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8290
diff
changeset
|
559 { |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8290
diff
changeset
|
560 return (length () == 2 && (elem (0) == 1 || elem (1) == 1)); |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8290
diff
changeset
|
561 } |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8290
diff
changeset
|
562 |
|
9511
cc1fd3084cb2
implement dim_vector::first_non_singleton
Jaroslav Hajek <highegg@gmail.com>
parents:
9507
diff
changeset
|
563 int first_non_singleton (int def = 0) const |
|
cc1fd3084cb2
implement dim_vector::first_non_singleton
Jaroslav Hajek <highegg@gmail.com>
parents:
9507
diff
changeset
|
564 { |
|
cc1fd3084cb2
implement dim_vector::first_non_singleton
Jaroslav Hajek <highegg@gmail.com>
parents:
9507
diff
changeset
|
565 for (int i = 0; i < length (); i++) |
|
cc1fd3084cb2
implement dim_vector::first_non_singleton
Jaroslav Hajek <highegg@gmail.com>
parents:
9507
diff
changeset
|
566 { |
|
cc1fd3084cb2
implement dim_vector::first_non_singleton
Jaroslav Hajek <highegg@gmail.com>
parents:
9507
diff
changeset
|
567 if (elem (i) != 1) |
|
cc1fd3084cb2
implement dim_vector::first_non_singleton
Jaroslav Hajek <highegg@gmail.com>
parents:
9507
diff
changeset
|
568 return i; |
|
cc1fd3084cb2
implement dim_vector::first_non_singleton
Jaroslav Hajek <highegg@gmail.com>
parents:
9507
diff
changeset
|
569 } |
|
cc1fd3084cb2
implement dim_vector::first_non_singleton
Jaroslav Hajek <highegg@gmail.com>
parents:
9507
diff
changeset
|
570 |
|
cc1fd3084cb2
implement dim_vector::first_non_singleton
Jaroslav Hajek <highegg@gmail.com>
parents:
9507
diff
changeset
|
571 return def; |
|
cc1fd3084cb2
implement dim_vector::first_non_singleton
Jaroslav Hajek <highegg@gmail.com>
parents:
9507
diff
changeset
|
572 } |
|
cc1fd3084cb2
implement dim_vector::first_non_singleton
Jaroslav Hajek <highegg@gmail.com>
parents:
9507
diff
changeset
|
573 |
| 10150 | 574 // Compute a linear index from an index tuple. |
| 575 | |
|
9739
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
576 octave_idx_type compute_index (const octave_idx_type *idx) |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
577 { |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
578 octave_idx_type k = 0; |
|
9743
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9739
diff
changeset
|
579 for (int i = length () - 1; i >= 0; i--) |
|
9739
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
580 k = k * rep[i] + idx[i]; |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
581 |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
582 return k; |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
583 } |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
584 |
| 10150 | 585 // Increment a multi-dimensional index tuple, optionally starting |
| 586 // from an offset position and return the index of the last index | |
|
9739
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
587 // position that was changed, or length () if just cycled over. |
| 10150 | 588 |
|
9739
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
589 int increment_index (octave_idx_type *idx, int start = 0) |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
590 { |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
591 int i; |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
592 for (i = start; i < length (); i++) |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
593 { |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
594 if (++(*idx) == rep[i]) |
|
9743
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9739
diff
changeset
|
595 *idx++ = 0; |
|
9739
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
596 else |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
597 break; |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
598 } |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
599 return i; |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
600 } |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
601 |
| 10150 | 602 // Return cumulative dimensions. |
| 603 | |
|
9739
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
604 dim_vector cumulative (void) const |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
605 { |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
606 int nd = length (); |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
607 dim_vector retval = alloc (nd); |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
608 |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
609 octave_idx_type k = 1; |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
610 for (int i = 0; i < nd; i++) |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
611 retval.rep[i] = k *= rep[i]; |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
612 |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
613 return retval; |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
614 } |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
615 |
| 10150 | 616 // Compute a linear index from an index tuple. Dimensions are |
| 617 // required to be cumulative. | |
| 618 | |
|
9739
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
619 octave_idx_type cum_compute_index (const octave_idx_type *idx) |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
620 { |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
621 octave_idx_type k = idx[0]; |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
622 |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
623 for (int i = 1; i < length (); i++) |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
624 k += rep[i-1] * idx[i]; |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
625 |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
626 return k; |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
627 } |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
628 |
|
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
629 |
|
9694
50db3c5175b5
allow unpacked form of LU
Jaroslav Hajek <highegg@gmail.com>
parents:
9666
diff
changeset
|
630 friend bool operator == (const dim_vector& a, const dim_vector& b); |
| 4513 | 631 }; |
| 632 | |
|
9694
50db3c5175b5
allow unpacked form of LU
Jaroslav Hajek <highegg@gmail.com>
parents:
9666
diff
changeset
|
633 inline bool |
| 4543 | 634 operator == (const dim_vector& a, const dim_vector& b) |
| 635 { | |
|
9694
50db3c5175b5
allow unpacked form of LU
Jaroslav Hajek <highegg@gmail.com>
parents:
9666
diff
changeset
|
636 // Fast case. |
|
50db3c5175b5
allow unpacked form of LU
Jaroslav Hajek <highegg@gmail.com>
parents:
9666
diff
changeset
|
637 if (a.rep == b.rep) |
|
50db3c5175b5
allow unpacked form of LU
Jaroslav Hajek <highegg@gmail.com>
parents:
9666
diff
changeset
|
638 return true; |
|
50db3c5175b5
allow unpacked form of LU
Jaroslav Hajek <highegg@gmail.com>
parents:
9666
diff
changeset
|
639 |
| 4543 | 640 bool retval = true; |
| 641 | |
| 642 int a_len = a.length (); | |
| 643 int b_len = b.length (); | |
| 644 | |
| 645 if (a_len != b_len) | |
| 646 retval = false; | |
| 647 else | |
| 648 { | |
| 649 for (int i = 0; i < a_len; i++) | |
| 10150 | 650 { |
| 651 if (a(i) != b(i)) | |
| 652 { | |
| 653 retval = false; | |
| 654 break; | |
| 655 } | |
| 656 } | |
| 4543 | 657 } |
| 658 | |
| 659 return retval; | |
| 660 } | |
| 661 | |
|
9694
50db3c5175b5
allow unpacked form of LU
Jaroslav Hajek <highegg@gmail.com>
parents:
9666
diff
changeset
|
662 inline bool |
| 4543 | 663 operator != (const dim_vector& a, const dim_vector& b) |
| 664 { | |
| 665 return ! operator == (a, b); | |
| 666 } | |
| 667 | |
| 4513 | 668 #endif |