Mercurial > hg > octave-lyh
annotate liboctave/dim-vector.h @ 10418:6c19d6fcd7e5
up to 7th-order dim_vector constructors
author | Jaroslav Hajek <highegg@gmail.com> |
---|---|
date | Wed, 17 Mar 2010 08:46:46 +0100 |
parents | 69ecfbffcf4f |
children | afe44ee90cbd |
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 | |
10350
12884915a8e4
merge MArray classes & improve Array interface
Jaroslav Hajek <highegg@gmail.com>
parents:
10150
diff
changeset
|
136 explicit dim_vector (octave_idx_type n) GCC_ATTR_DEPRECATED |
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 |
10418
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
143 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 |
10418
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
150 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 } | |
10403
69ecfbffcf4f
liboctave/dim-vector.h: New constructor accepting a C array of dimensions.
Soren Hauberg <hauberg@gmail.com>
parents:
10366
diff
changeset
|
157 |
10418
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
158 dim_vector (octave_idx_type r, octave_idx_type c, octave_idx_type p, |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
159 octave_idx_type q) |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
160 : rep (newrep (4)) |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
161 { |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
162 rep[0] = r; |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
163 rep[1] = c; |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
164 rep[2] = p; |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
165 rep[3] = q; |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
166 } |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
167 |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
168 dim_vector (octave_idx_type r, octave_idx_type c, octave_idx_type p, |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
169 octave_idx_type q, octave_idx_type s) |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
170 : rep (newrep (5)) |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
171 { |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
172 rep[0] = r; |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
173 rep[1] = c; |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
174 rep[2] = p; |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
175 rep[3] = q; |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
176 rep[4] = s; |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
177 } |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
178 |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
179 dim_vector (octave_idx_type r, octave_idx_type c, octave_idx_type p, |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
180 octave_idx_type q, octave_idx_type s, octave_idx_type t) |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
181 : rep (newrep (6)) |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
182 { |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
183 rep[0] = r; |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
184 rep[1] = c; |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
185 rep[2] = p; |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
186 rep[3] = q; |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
187 rep[4] = s; |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
188 rep[5] = t; |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
189 } |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
190 |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
191 dim_vector (octave_idx_type r, octave_idx_type c, octave_idx_type p, |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
192 octave_idx_type q, octave_idx_type s, octave_idx_type t, |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
193 octave_idx_type u) |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
194 : rep (newrep (7)) |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
195 { |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
196 rep[0] = r; |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
197 rep[1] = c; |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
198 rep[2] = p; |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
199 rep[3] = q; |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
200 rep[4] = s; |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
201 rep[5] = t; |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
202 rep[6] = u; |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
203 } |
6c19d6fcd7e5
up to 7th-order dim_vector constructors
Jaroslav Hajek <highegg@gmail.com>
parents:
10403
diff
changeset
|
204 |
10403
69ecfbffcf4f
liboctave/dim-vector.h: New constructor accepting a C array of dimensions.
Soren Hauberg <hauberg@gmail.com>
parents:
10366
diff
changeset
|
205 dim_vector (const octave_idx_type *vec, size_t vec_size) |
69ecfbffcf4f
liboctave/dim-vector.h: New constructor accepting a C array of dimensions.
Soren Hauberg <hauberg@gmail.com>
parents:
10366
diff
changeset
|
206 : rep (newrep (vec_size)) |
69ecfbffcf4f
liboctave/dim-vector.h: New constructor accepting a C array of dimensions.
Soren Hauberg <hauberg@gmail.com>
parents:
10366
diff
changeset
|
207 { |
69ecfbffcf4f
liboctave/dim-vector.h: New constructor accepting a C array of dimensions.
Soren Hauberg <hauberg@gmail.com>
parents:
10366
diff
changeset
|
208 for (size_t k = 0; k < vec_size; k++) |
69ecfbffcf4f
liboctave/dim-vector.h: New constructor accepting a C array of dimensions.
Soren Hauberg <hauberg@gmail.com>
parents:
10366
diff
changeset
|
209 rep[k] = vec[k]; |
69ecfbffcf4f
liboctave/dim-vector.h: New constructor accepting a C array of dimensions.
Soren Hauberg <hauberg@gmail.com>
parents:
10366
diff
changeset
|
210 } |
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
211 |
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
212 octave_idx_type& elem (int i) |
10150 | 213 { |
10366
e5ae13b8b2c2
improve Array indexing error messages
Jaroslav Hajek <highegg@gmail.com>
parents:
10350
diff
changeset
|
214 #ifdef BOUNDS_CHECKING |
10150 | 215 assert (i >= 0 && i < ndims ()); |
10366
e5ae13b8b2c2
improve Array indexing error messages
Jaroslav Hajek <highegg@gmail.com>
parents:
10350
diff
changeset
|
216 #endif |
10150 | 217 make_unique (); |
218 return rep[i]; | |
219 } | |
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
220 |
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
221 octave_idx_type elem (int i) const |
10150 | 222 { |
10366
e5ae13b8b2c2
improve Array indexing error messages
Jaroslav Hajek <highegg@gmail.com>
parents:
10350
diff
changeset
|
223 #ifdef BOUNDS_CHECKING |
10150 | 224 assert (i >= 0 && i < ndims ()); |
10366
e5ae13b8b2c2
improve Array indexing error messages
Jaroslav Hajek <highegg@gmail.com>
parents:
10350
diff
changeset
|
225 #endif |
10150 | 226 return rep[i]; |
227 } | |
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
228 |
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
229 void chop_trailing_singletons (void) |
10150 | 230 { |
231 int l = ndims (); | |
232 if (l > 2 && rep[l-1] == 1) | |
233 { | |
234 make_unique (); | |
235 do | |
236 l--; | |
237 while (l > 2 && rep[l-1] == 1); | |
238 ndims () = l; | |
239 } | |
240 } | |
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
241 |
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
242 void chop_all_singletons (void) |
10150 | 243 { |
244 make_unique (); | |
245 | |
246 int j = 0; | |
247 int l = ndims(); | |
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
248 |
10150 | 249 for (int i = 0; i < l; i++) |
250 { | |
251 if (rep[i] != 1) | |
252 rep[j++] = rep[i]; | |
253 } | |
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
254 |
10150 | 255 if (j == 1) |
256 rep[1] = 1; | |
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
257 |
10150 | 258 ndims () = j > 2 ? j : 2; |
259 } | |
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
260 |
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
261 private: |
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
262 |
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
263 static octave_idx_type *nil_rep (void) |
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
264 { |
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
265 static dim_vector zv (0, 0); |
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
266 return zv.rep; |
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
267 } |
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
268 |
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
269 explicit dim_vector (octave_idx_type *r) |
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
270 : rep (r) { } |
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
271 |
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
272 public: |
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
273 |
10150 | 274 explicit dim_vector (void) : rep (nil_rep ()) { count()++; } |
4548 | 275 |
10150 | 276 dim_vector (const dim_vector& dv) : rep (dv.rep) { count()++; } |
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
277 |
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
278 static dim_vector alloc (int n) |
10150 | 279 { |
280 return dim_vector (newrep (n < 2 ? 2 : n)); | |
281 } | |
4548 | 282 |
283 dim_vector& operator = (const dim_vector& dv) | |
284 { | |
285 if (&dv != this) | |
286 { | |
10150 | 287 if (--count() <= 0) |
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
288 freerep (); |
4548 | 289 |
10150 | 290 rep = dv.rep; |
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
291 count()++; |
4548 | 292 } |
293 | |
294 return *this; | |
295 } | |
296 | |
297 ~dim_vector (void) | |
298 { | |
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
299 if (--count() <= 0) |
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
300 freerep (); |
4548 | 301 } |
302 | |
10150 | 303 int length (void) const { return ndims (); } |
4513 | 304 |
5275 | 305 octave_idx_type& operator () (int i) { return elem (i); } |
4513 | 306 |
5275 | 307 octave_idx_type operator () (int i) const { return elem (i); } |
4513 | 308 |
4887 | 309 void resize (int n, int fill_value = 0) |
4548 | 310 { |
311 int len = length (); | |
4513 | 312 |
4548 | 313 if (n != len) |
314 { | |
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
315 octave_idx_type *r = resizerep (n, fill_value); |
4513 | 316 |
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
317 if (--count() <= 0) |
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
318 freerep (); |
4513 | 319 |
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
320 rep = r; |
4548 | 321 } |
322 } | |
4513 | 323 |
4559 | 324 std::string str (char sep = 'x') const |
4548 | 325 { |
5765 | 326 std::ostringstream buf; |
4543 | 327 |
4548 | 328 for (int i = 0; i < length (); i++) |
329 { | |
10150 | 330 buf << elem (i); |
4543 | 331 |
10150 | 332 if (i < length () - 1) |
333 buf << sep; | |
4548 | 334 } |
4543 | 335 |
5765 | 336 std::string retval = buf.str (); |
4543 | 337 |
4548 | 338 return retval; |
339 } | |
4543 | 340 |
341 bool all_zero (void) const | |
4548 | 342 { |
343 bool retval = true; | |
4543 | 344 |
4548 | 345 for (int i = 0; i < length (); i++) |
346 { | |
10150 | 347 if (elem (i) != 0) |
348 { | |
349 retval = false; | |
350 break; | |
351 } | |
4548 | 352 } |
4543 | 353 |
4548 | 354 return retval; |
355 } | |
4559 | 356 |
9886
cddd5c3d5f04
fix & extend special-case optimizations for indexed assignment
Jaroslav Hajek <highegg@gmail.com>
parents:
9840
diff
changeset
|
357 bool zero_by_zero (void) const |
cddd5c3d5f04
fix & extend special-case optimizations for indexed assignment
Jaroslav Hajek <highegg@gmail.com>
parents:
9840
diff
changeset
|
358 { |
cddd5c3d5f04
fix & extend special-case optimizations for indexed assignment
Jaroslav Hajek <highegg@gmail.com>
parents:
9840
diff
changeset
|
359 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
|
360 } |
cddd5c3d5f04
fix & extend special-case optimizations for indexed assignment
Jaroslav Hajek <highegg@gmail.com>
parents:
9840
diff
changeset
|
361 |
4559 | 362 bool any_zero (void) const |
363 { | |
364 bool retval = false; | |
365 | |
366 for (int i = 0; i < length (); i++) | |
367 { | |
10150 | 368 if (elem (i) == 0) |
369 { | |
370 retval = true; | |
371 break; | |
372 } | |
4559 | 373 } |
374 | |
375 return retval; | |
376 } | |
4567 | 377 |
10150 | 378 int num_ones (void) const |
4635 | 379 { |
380 int retval = 0; | |
381 | |
382 for (int i = 0; i < length (); i++) | |
383 if (elem (i) == 1) | |
10150 | 384 retval++; |
4635 | 385 |
386 return retval; | |
387 } | |
388 | |
10150 | 389 bool all_ones (void) const |
4655 | 390 { |
391 return (num_ones () == length ()); | |
392 } | |
393 | |
10150 | 394 // Return the number of elements that a matrix with this dimension |
4567 | 395 // vector would have, NOT the number of dimensions (elements in the |
396 // dimension vector). | |
397 | |
9027
9a46ba093db4
generalize dim_vector::numel
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
398 octave_idx_type numel (int n = 0) const |
4567 | 399 { |
400 int n_dims = length (); | |
401 | |
9027
9a46ba093db4
generalize dim_vector::numel
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
402 octave_idx_type retval = 1; |
4567 | 403 |
9027
9a46ba093db4
generalize dim_vector::numel
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
404 for (int i = n; i < n_dims; i++) |
4567 | 405 retval *= elem (i); |
406 | |
407 return retval; | |
408 } | |
4673 | 409 |
9840
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
410 // 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
|
411 // 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
|
412 // 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
|
413 // 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
|
414 // 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
|
415 // 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
|
416 // indices. |
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
417 |
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
418 octave_idx_type safe_numel (void) const |
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
419 { |
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
420 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
|
421 octave_idx_type n = 1; |
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
422 int n_dims = length (); |
10150 | 423 |
9840
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
424 for (int i = 0; i < n_dims; i++) |
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
425 { |
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
426 n *= rep[i]; |
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
427 if (rep[i] != 0) |
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
428 idx_max /= rep[i]; |
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
429 if (idx_max <= 0) |
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
430 throw std::bad_alloc (); |
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
431 } |
10150 | 432 |
9840
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
433 return n; |
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
434 } |
c0b54271904b
improve safe numel() calculation for arrays
Jaroslav Hajek <highegg@gmail.com>
parents:
9743
diff
changeset
|
435 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
436 bool any_neg (void) const |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
437 { |
10150 | 438 int n_dims = length (); |
439 int i; | |
440 | |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
441 for (i = 0; i < n_dims; i++) |
10150 | 442 if (elem (i) < 0) |
443 break; | |
444 | |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
445 return i < n_dims; |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
446 } |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
447 |
4735 | 448 dim_vector squeeze (void) const |
449 { | |
450 dim_vector new_dims = *this; | |
451 | |
452 bool dims_changed = 1; | |
453 | |
454 int k = 0; | |
455 | |
456 for (int i = 0; i < length (); i++) | |
457 { | |
10150 | 458 if (elem (i) == 1) |
459 dims_changed = true; | |
460 else | |
461 new_dims(k++) = elem (i); | |
4735 | 462 } |
463 | |
464 if (dims_changed) | |
465 { | |
10150 | 466 if (k == 0) |
467 new_dims = dim_vector (1, 1); | |
468 else if (k == 1) | |
469 { | |
470 // There is one non-singleton dimension, so we need | |
471 // to decide the correct orientation. | |
4735 | 472 |
10150 | 473 if (elem (0) == 1) |
474 { | |
475 // The original dimension vector had a leading | |
476 // singleton dimension. | |
4735 | 477 |
10150 | 478 octave_idx_type tmp = new_dims(0); |
479 | |
480 new_dims.resize (2); | |
4735 | 481 |
10150 | 482 new_dims(0) = 1; |
483 new_dims(1) = tmp; | |
484 } | |
485 else | |
486 { | |
487 // The first element of the original dimension vector | |
488 // was not a singleton dimension. | |
4735 | 489 |
10150 | 490 new_dims.resize (2); |
4735 | 491 |
10150 | 492 new_dims(1) = 1; |
493 } | |
494 } | |
495 else | |
496 new_dims.resize(k); | |
4735 | 497 } |
498 | |
499 return new_dims; | |
500 } | |
4915 | 501 |
502 bool concat (const dim_vector& dvb, int dim = 0) | |
503 { | |
504 if (all_zero ()) | |
505 { | |
10150 | 506 *this = dvb; |
507 return true; | |
4915 | 508 } |
509 | |
510 if (dvb.all_zero ()) | |
511 return true; | |
512 | |
513 int na = length (); | |
514 int nb = dvb.length (); | |
515 | |
516 // Find the max and min value of na and nb | |
517 int n_max = na > nb ? na : nb; | |
518 int n_min = na < nb ? na : nb; | |
519 | |
520 // The elements of the dimension vectors can only differ | |
521 // if the dim variable differs from the actual dimension | |
522 // they differ. | |
523 | |
524 for (int i = 0; i < n_min; i++) | |
525 { | |
10150 | 526 if (elem(i) != dvb(i) && dim != i) |
527 return false; | |
4915 | 528 } |
529 | |
530 // Ditto. | |
531 for (int i = n_min; i < n_max; i++) | |
532 { | |
10150 | 533 if (na > n_min) |
534 { | |
535 if (elem(i) != 1 && dim != i) | |
536 return false; | |
537 } | |
538 else | |
539 { | |
540 if (dvb(i) != 1 && dim != i) | |
541 return false; | |
542 } | |
4915 | 543 } |
544 | |
545 // If we want to add the dimension vectors at a dimension | |
546 // larger than both, then we need to set n_max to this number | |
547 // so that we resize *this to the right dimension. | |
548 | |
549 n_max = n_max > (dim + 1) ? n_max : (dim + 1); | |
550 | |
551 // Resize *this to the appropriate dimensions. | |
552 | |
553 if (n_max > na) | |
9507
b096d11237be
dim_vector improvements
Jaroslav Hajek <highegg@gmail.com>
parents:
9420
diff
changeset
|
554 resize (n_max, 1); |
4915 | 555 |
556 // Larger or equal since dim has been decremented by one. | |
557 | |
558 if (dim >= nb) | |
4940 | 559 elem (dim)++; |
4915 | 560 else |
561 elem (dim) += dvb(dim); | |
562 | |
563 return true; | |
564 } | |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
565 |
10150 | 566 // Force certain dimensionality, preserving numel (). Missing |
567 // dimensions are set to 1, redundant are folded into the trailing | |
568 // one. If n = 1, the result is 2d and the second dim is 1 | |
569 // (dim_vectors are always at least 2D). If the original dimensions | |
570 // were all zero, the padding value is zero. | |
571 | |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
572 dim_vector redim (int n) const |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
573 { |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
574 int n_dims = length (); |
10150 | 575 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
576 if (n_dims == n) |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
577 return *this; |
9666
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
578 else if (n_dims < n) |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
579 { |
9666
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
580 dim_vector retval = alloc (n); |
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
581 |
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
582 int pad = 0; |
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
583 for (int i = 0; i < n_dims; i++) |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
584 { |
9666
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
585 retval.rep[i] = rep[i]; |
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
586 if (rep[i] != 0) |
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
587 pad = 1; |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
588 } |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
589 |
9666
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
590 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
|
591 retval.rep[i] = pad; |
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
592 |
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
593 return retval; |
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
594 } |
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
595 else |
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
596 { |
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
597 if (n < 1) n = 1; |
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
598 |
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
599 dim_vector retval = alloc (n); |
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
600 |
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
601 retval.rep[1] = 1; |
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
602 |
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
603 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
|
604 retval.rep[i] = rep[i]; |
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
605 |
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
606 int k = rep[n-1]; |
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
607 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
|
608 k *= rep[i]; |
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
609 |
a531dec450c4
allow 1D case for sub2ind and ind2sub
Jaroslav Hajek <highegg@gmail.com>
parents:
9648
diff
changeset
|
610 retval.rep[n-1] = k; |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
611 |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
612 return retval; |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
613 } |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
7017
diff
changeset
|
614 } |
8721
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8290
diff
changeset
|
615 |
10350
12884915a8e4
merge MArray classes & improve Array interface
Jaroslav Hajek <highegg@gmail.com>
parents:
10150
diff
changeset
|
616 dim_vector as_column (void) const |
12884915a8e4
merge MArray classes & improve Array interface
Jaroslav Hajek <highegg@gmail.com>
parents:
10150
diff
changeset
|
617 { |
12884915a8e4
merge MArray classes & improve Array interface
Jaroslav Hajek <highegg@gmail.com>
parents:
10150
diff
changeset
|
618 if (length () == 2 && elem (1) == 1) |
12884915a8e4
merge MArray classes & improve Array interface
Jaroslav Hajek <highegg@gmail.com>
parents:
10150
diff
changeset
|
619 return *this; |
12884915a8e4
merge MArray classes & improve Array interface
Jaroslav Hajek <highegg@gmail.com>
parents:
10150
diff
changeset
|
620 else |
12884915a8e4
merge MArray classes & improve Array interface
Jaroslav Hajek <highegg@gmail.com>
parents:
10150
diff
changeset
|
621 return dim_vector (numel (), 1); |
12884915a8e4
merge MArray classes & improve Array interface
Jaroslav Hajek <highegg@gmail.com>
parents:
10150
diff
changeset
|
622 } |
12884915a8e4
merge MArray classes & improve Array interface
Jaroslav Hajek <highegg@gmail.com>
parents:
10150
diff
changeset
|
623 |
12884915a8e4
merge MArray classes & improve Array interface
Jaroslav Hajek <highegg@gmail.com>
parents:
10150
diff
changeset
|
624 dim_vector as_row (void) const |
12884915a8e4
merge MArray classes & improve Array interface
Jaroslav Hajek <highegg@gmail.com>
parents:
10150
diff
changeset
|
625 { |
12884915a8e4
merge MArray classes & improve Array interface
Jaroslav Hajek <highegg@gmail.com>
parents:
10150
diff
changeset
|
626 if (length () == 2 && elem (0) == 1) |
12884915a8e4
merge MArray classes & improve Array interface
Jaroslav Hajek <highegg@gmail.com>
parents:
10150
diff
changeset
|
627 return *this; |
12884915a8e4
merge MArray classes & improve Array interface
Jaroslav Hajek <highegg@gmail.com>
parents:
10150
diff
changeset
|
628 else |
12884915a8e4
merge MArray classes & improve Array interface
Jaroslav Hajek <highegg@gmail.com>
parents:
10150
diff
changeset
|
629 return dim_vector (1, numel ()); |
12884915a8e4
merge MArray classes & improve Array interface
Jaroslav Hajek <highegg@gmail.com>
parents:
10150
diff
changeset
|
630 } |
12884915a8e4
merge MArray classes & improve Array interface
Jaroslav Hajek <highegg@gmail.com>
parents:
10150
diff
changeset
|
631 |
8721
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8290
diff
changeset
|
632 bool is_vector (void) const |
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8290
diff
changeset
|
633 { |
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8290
diff
changeset
|
634 return (length () == 2 && (elem (0) == 1 || elem (1) == 1)); |
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8290
diff
changeset
|
635 } |
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8290
diff
changeset
|
636 |
9511
cc1fd3084cb2
implement dim_vector::first_non_singleton
Jaroslav Hajek <highegg@gmail.com>
parents:
9507
diff
changeset
|
637 int first_non_singleton (int def = 0) const |
cc1fd3084cb2
implement dim_vector::first_non_singleton
Jaroslav Hajek <highegg@gmail.com>
parents:
9507
diff
changeset
|
638 { |
cc1fd3084cb2
implement dim_vector::first_non_singleton
Jaroslav Hajek <highegg@gmail.com>
parents:
9507
diff
changeset
|
639 for (int i = 0; i < length (); i++) |
cc1fd3084cb2
implement dim_vector::first_non_singleton
Jaroslav Hajek <highegg@gmail.com>
parents:
9507
diff
changeset
|
640 { |
cc1fd3084cb2
implement dim_vector::first_non_singleton
Jaroslav Hajek <highegg@gmail.com>
parents:
9507
diff
changeset
|
641 if (elem (i) != 1) |
cc1fd3084cb2
implement dim_vector::first_non_singleton
Jaroslav Hajek <highegg@gmail.com>
parents:
9507
diff
changeset
|
642 return i; |
cc1fd3084cb2
implement dim_vector::first_non_singleton
Jaroslav Hajek <highegg@gmail.com>
parents:
9507
diff
changeset
|
643 } |
cc1fd3084cb2
implement dim_vector::first_non_singleton
Jaroslav Hajek <highegg@gmail.com>
parents:
9507
diff
changeset
|
644 |
cc1fd3084cb2
implement dim_vector::first_non_singleton
Jaroslav Hajek <highegg@gmail.com>
parents:
9507
diff
changeset
|
645 return def; |
cc1fd3084cb2
implement dim_vector::first_non_singleton
Jaroslav Hajek <highegg@gmail.com>
parents:
9507
diff
changeset
|
646 } |
cc1fd3084cb2
implement dim_vector::first_non_singleton
Jaroslav Hajek <highegg@gmail.com>
parents:
9507
diff
changeset
|
647 |
10150 | 648 // Compute a linear index from an index tuple. |
649 | |
9739
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
650 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
|
651 { |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
652 octave_idx_type k = 0; |
9743
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9739
diff
changeset
|
653 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
|
654 k = k * rep[i] + idx[i]; |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
655 |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
656 return k; |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
657 } |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
658 |
10150 | 659 // Increment a multi-dimensional index tuple, optionally starting |
660 // 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
|
661 // position that was changed, or length () if just cycled over. |
10150 | 662 |
9739
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
663 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
|
664 { |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
665 int i; |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
666 for (i = start; i < length (); i++) |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
667 { |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
668 if (++(*idx) == rep[i]) |
9743
26abff55f6fe
optimize bsxfun for common built-in operations
Jaroslav Hajek <highegg@gmail.com>
parents:
9739
diff
changeset
|
669 *idx++ = 0; |
9739
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
670 else |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
671 break; |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
672 } |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
673 return i; |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
674 } |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
675 |
10150 | 676 // Return cumulative dimensions. |
677 | |
9739
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
678 dim_vector cumulative (void) const |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
679 { |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
680 int nd = length (); |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
681 dim_vector retval = alloc (nd); |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
682 |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
683 octave_idx_type k = 1; |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
684 for (int i = 0; i < nd; i++) |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
685 retval.rep[i] = k *= rep[i]; |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
686 |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
687 return retval; |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
688 } |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
689 |
10150 | 690 // Compute a linear index from an index tuple. Dimensions are |
691 // required to be cumulative. | |
692 | |
9739
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
693 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
|
694 { |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
695 octave_idx_type k = idx[0]; |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
696 |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
697 for (int i = 1; i < length (); i++) |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
698 k += rep[i-1] * idx[i]; |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
699 |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
700 return k; |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
701 } |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
702 |
13b57eec9440
a few handy methods for dim_vector
Jaroslav Hajek <highegg@gmail.com>
parents:
9694
diff
changeset
|
703 |
9694
50db3c5175b5
allow unpacked form of LU
Jaroslav Hajek <highegg@gmail.com>
parents:
9666
diff
changeset
|
704 friend bool operator == (const dim_vector& a, const dim_vector& b); |
4513 | 705 }; |
706 | |
9694
50db3c5175b5
allow unpacked form of LU
Jaroslav Hajek <highegg@gmail.com>
parents:
9666
diff
changeset
|
707 inline bool |
4543 | 708 operator == (const dim_vector& a, const dim_vector& b) |
709 { | |
9694
50db3c5175b5
allow unpacked form of LU
Jaroslav Hajek <highegg@gmail.com>
parents:
9666
diff
changeset
|
710 // Fast case. |
50db3c5175b5
allow unpacked form of LU
Jaroslav Hajek <highegg@gmail.com>
parents:
9666
diff
changeset
|
711 if (a.rep == b.rep) |
50db3c5175b5
allow unpacked form of LU
Jaroslav Hajek <highegg@gmail.com>
parents:
9666
diff
changeset
|
712 return true; |
50db3c5175b5
allow unpacked form of LU
Jaroslav Hajek <highegg@gmail.com>
parents:
9666
diff
changeset
|
713 |
4543 | 714 bool retval = true; |
715 | |
716 int a_len = a.length (); | |
717 int b_len = b.length (); | |
718 | |
719 if (a_len != b_len) | |
720 retval = false; | |
721 else | |
722 { | |
723 for (int i = 0; i < a_len; i++) | |
10150 | 724 { |
725 if (a(i) != b(i)) | |
726 { | |
727 retval = false; | |
728 break; | |
729 } | |
730 } | |
4543 | 731 } |
732 | |
733 return retval; | |
734 } | |
735 | |
9694
50db3c5175b5
allow unpacked form of LU
Jaroslav Hajek <highegg@gmail.com>
parents:
9666
diff
changeset
|
736 inline bool |
4543 | 737 operator != (const dim_vector& a, const dim_vector& b) |
738 { | |
739 return ! operator == (a, b); | |
740 } | |
741 | |
4513 | 742 #endif |