Mercurial > octave-dspies
annotate liboctave/Array.h @ 9546:1beb23d2b892
optimize op= in common cases
author | Jaroslav Hajek <highegg@gmail.com> |
---|---|
date | Wed, 19 Aug 2009 13:47:59 +0200 |
parents | 9fd5c56ce57a |
children | 948795dc1974 |
rev | line source |
---|---|
1993 | 1 // Template array classes |
228 | 2 /* |
3 | |
8920 | 4 Copyright (C) 2008, 2009 Jaroslav Hajek |
7017 | 5 Copyright (C) 1993, 1994, 1995, 1996, 1997, 2000, 2001, 2002, 2003, |
6 2004, 2005, 2006, 2007 John W. Eaton | |
228 | 7 |
8 This file is part of Octave. | |
9 | |
10 Octave is free software; you can redistribute it and/or modify it | |
11 under the terms of the GNU General Public License as published by the | |
7016 | 12 Free Software Foundation; either version 3 of the License, or (at your |
13 option) any later version. | |
228 | 14 |
15 Octave is distributed in the hope that it will be useful, but WITHOUT | |
16 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
17 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
18 for more details. | |
19 | |
20 You should have received a copy of the GNU General Public License | |
7016 | 21 along with Octave; see the file COPYING. If not, see |
22 <http://www.gnu.org/licenses/>. | |
228 | 23 |
24 */ | |
25 | |
382 | 26 #if !defined (octave_Array_h) |
27 #define octave_Array_h 1 | |
28 | |
1366 | 29 #include <cassert> |
4152 | 30 #include <cstddef> |
3613 | 31 |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
32 #include <algorithm> |
8950
d865363208d6
include <iosfwd> instead of <iostream> in header files
John W. Eaton <jwe@octave.org>
parents:
8920
diff
changeset
|
33 #include <iosfwd> |
3933 | 34 |
4513 | 35 #include "dim-vector.h" |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
36 #include "idx-vector.h" |
8725 | 37 #include "lo-traits.h" |
3613 | 38 #include "lo-utils.h" |
7433 | 39 #include "oct-sort.h" |
7503
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
40 #include "quit.h" |
7433 | 41 |
1359 | 42 // One dimensional array class. Handles the reference counting for |
43 // all the derived classes. | |
238 | 44 |
228 | 45 template <class T> |
3585 | 46 class |
47 Array | |
228 | 48 { |
3504 | 49 protected: |
1619 | 50 |
4513 | 51 //-------------------------------------------------------------------- |
52 // The real representation of all arrays. | |
53 //-------------------------------------------------------------------- | |
1735 | 54 |
55 class ArrayRep | |
56 { | |
57 public: | |
58 | |
59 T *data; | |
5275 | 60 octave_idx_type len; |
1735 | 61 int count; |
62 | |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
63 ArrayRep (T *d, octave_idx_type l, bool copy = false) |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
64 : data (copy ? new T [l] : d), len (l), count (1) |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
65 { |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
66 if (copy) |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
67 std::copy (d, d + l, data); |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
68 } |
1735 | 69 |
70 ArrayRep (void) : data (0), len (0), count (1) { } | |
71 | |
5275 | 72 explicit ArrayRep (octave_idx_type n) : data (new T [n]), len (n), count (1) { } |
1735 | 73 |
5275 | 74 explicit ArrayRep (octave_idx_type n, const T& val) |
4513 | 75 : data (new T [n]), len (n), count (1) |
76 { | |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
77 std::fill (data, data + n, val); |
4513 | 78 } |
79 | |
1735 | 80 ArrayRep (const ArrayRep& a) |
81 : data (new T [a.len]), len (a.len), count (1) | |
4513 | 82 { |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
83 std::copy (a.data, a.data + a.len, data); |
4513 | 84 } |
4517 | 85 |
1735 | 86 ~ArrayRep (void) { delete [] data; } |
87 | |
5275 | 88 octave_idx_type length (void) const { return len; } |
1735 | 89 |
4517 | 90 private: |
91 | |
92 // No assignment! | |
93 | |
94 ArrayRep& operator = (const ArrayRep& a); | |
1735 | 95 }; |
96 | |
4513 | 97 //-------------------------------------------------------------------- |
98 | |
6884 | 99 public: |
100 | |
8524
937921654627
clean up Array and DiagArray2
Jaroslav Hajek <highegg@gmail.com>
parents:
8523
diff
changeset
|
101 void make_unique (void); |
238 | 102 |
5900 | 103 typedef T element_type; |
104 | |
8725 | 105 typedef bool (*compare_fcn_type) (typename ref_param<T>::type, |
106 typename ref_param<T>::type); | |
107 | |
8524
937921654627
clean up Array and DiagArray2
Jaroslav Hajek <highegg@gmail.com>
parents:
8523
diff
changeset
|
108 protected: |
4902 | 109 |
110 typename Array<T>::ArrayRep *rep; | |
4518 | 111 |
4513 | 112 dim_vector dimensions; |
113 | |
8531
b01fef323c24
add some explaining comments
Jaroslav Hajek <highegg@gmail.com>
parents:
8524
diff
changeset
|
114 // Rationale: |
b01fef323c24
add some explaining comments
Jaroslav Hajek <highegg@gmail.com>
parents:
8524
diff
changeset
|
115 // slice_data is a pointer to rep->data, denoting together with slice_len the |
b01fef323c24
add some explaining comments
Jaroslav Hajek <highegg@gmail.com>
parents:
8524
diff
changeset
|
116 // actual portion of the data referenced by this Array<T> object. This allows |
b01fef323c24
add some explaining comments
Jaroslav Hajek <highegg@gmail.com>
parents:
8524
diff
changeset
|
117 // to make shallow copies not only of a whole array, but also of contiguous |
b01fef323c24
add some explaining comments
Jaroslav Hajek <highegg@gmail.com>
parents:
8524
diff
changeset
|
118 // subranges. Every time rep is directly manipulated, slice_data and slice_len |
b01fef323c24
add some explaining comments
Jaroslav Hajek <highegg@gmail.com>
parents:
8524
diff
changeset
|
119 // need to be properly updated. |
b01fef323c24
add some explaining comments
Jaroslav Hajek <highegg@gmail.com>
parents:
8524
diff
changeset
|
120 |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
121 T* slice_data; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
122 octave_idx_type slice_len; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
123 |
5275 | 124 Array (T *d, octave_idx_type n) |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
125 : rep (new typename Array<T>::ArrayRep (d, n)), dimensions (n) |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
126 { |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
127 slice_data = rep->data; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
128 slice_len = rep->len; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
129 } |
1619 | 130 |
4587 | 131 Array (T *d, const dim_vector& dv) |
132 : rep (new typename Array<T>::ArrayRep (d, get_size (dv))), | |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
133 dimensions (dv) |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
134 { |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
135 slice_data = rep->data; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
136 slice_len = rep->len; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
137 } |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
138 |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
139 // slice constructor |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
140 Array (const Array<T>& a, const dim_vector& dv, |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
141 octave_idx_type l, octave_idx_type u) |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
142 : rep(a.rep), dimensions (dv) |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
143 { |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
144 rep->count++; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
145 slice_data = a.slice_data + l; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
146 slice_len = std::min (u, a.slice_len) - l; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
147 } |
4513 | 148 |
149 private: | |
150 | |
4585 | 151 typename Array<T>::ArrayRep *nil_rep (void) const |
4513 | 152 { |
153 static typename Array<T>::ArrayRep *nr | |
154 = new typename Array<T>::ArrayRep (); | |
155 | |
156 return nr; | |
1550 | 157 } |
238 | 158 |
4902 | 159 template <class U> |
160 T * | |
8118
311c9b36df8f
replace int->octave_idx_type in Array<T>
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
161 coerce (const U *a, octave_idx_type len) |
4902 | 162 { |
163 T *retval = new T [len]; | |
164 | |
8118
311c9b36df8f
replace int->octave_idx_type in Array<T>
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
165 for (octave_idx_type i = 0; i < len; i++) |
4902 | 166 retval[i] = T (a[i]); |
167 | |
168 return retval; | |
169 } | |
170 | |
228 | 171 public: |
238 | 172 |
1550 | 173 Array (void) |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
174 : rep (nil_rep ()), dimensions () |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
175 { |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
176 rep->count++; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
177 slice_data = rep->data; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
178 slice_len = rep->len; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
179 } |
1550 | 180 |
5275 | 181 explicit Array (octave_idx_type n) |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
182 : rep (new typename Array<T>::ArrayRep (n)), dimensions (n) |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
183 { |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
184 slice_data = rep->data; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
185 slice_len = rep->len; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
186 } |
1619 | 187 |
5275 | 188 explicit Array (octave_idx_type n, const T& val) |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
189 : rep (new typename Array<T>::ArrayRep (n)), dimensions (n) |
4513 | 190 { |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
191 slice_data = rep->data; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
192 slice_len = rep->len; |
4513 | 193 fill (val); |
194 } | |
195 | |
4902 | 196 // Type conversion case. |
197 template <class U> | |
198 Array (const Array<U>& a) | |
199 : rep (new typename Array<T>::ArrayRep (coerce (a.data (), a.length ()), a.length ())), | |
8524
937921654627
clean up Array and DiagArray2
Jaroslav Hajek <highegg@gmail.com>
parents:
8523
diff
changeset
|
200 dimensions (a.dims ()) |
4902 | 201 { |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
202 slice_data = rep->data; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
203 slice_len = rep->len; |
4902 | 204 } |
205 | |
206 // No type conversion case. | |
4513 | 207 Array (const Array<T>& a) |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
208 : rep (a.rep), dimensions (a.dimensions) |
4513 | 209 { |
210 rep->count++; | |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
211 slice_data = a.slice_data; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
212 slice_len = a.slice_len; |
1550 | 213 } |
214 | |
4513 | 215 public: |
216 | |
4587 | 217 Array (const dim_vector& dv) |
218 : rep (new typename Array<T>::ArrayRep (get_size (dv))), | |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
219 dimensions (dv) |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
220 { |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
221 slice_data = rep->data; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
222 slice_len = rep->len; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
223 } |
238 | 224 |
4587 | 225 Array (const dim_vector& dv, const T& val) |
226 : rep (new typename Array<T>::ArrayRep (get_size (dv))), | |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
227 dimensions (dv) |
1550 | 228 { |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
229 slice_data = rep->data; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
230 slice_len = rep->len; |
4513 | 231 fill (val); |
232 } | |
233 | |
4834 | 234 Array (const Array<T>& a, const dim_vector& dv); |
228 | 235 |
4979 | 236 virtual ~Array (void); |
228 | 237 |
7717
ff918ee1a983
Delete idx in Sparse<T> and Array<T> operator =
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
238 Array<T>& operator = (const Array<T>& a); |
4513 | 239 |
8524
937921654627
clean up Array and DiagArray2
Jaroslav Hajek <highegg@gmail.com>
parents:
8523
diff
changeset
|
240 void fill (const T& val); |
9546
1beb23d2b892
optimize op= in common cases
Jaroslav Hajek <highegg@gmail.com>
parents:
9341
diff
changeset
|
241 void clear (void); |
238 | 242 |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
243 octave_idx_type capacity (void) const { return slice_len; } |
5275 | 244 octave_idx_type length (void) const { return capacity (); } |
245 octave_idx_type nelem (void) const { return capacity (); } | |
246 octave_idx_type numel (void) const { return nelem (); } | |
4513 | 247 |
5275 | 248 octave_idx_type dim1 (void) const { return dimensions(0); } |
249 octave_idx_type dim2 (void) const { return dimensions(1); } | |
250 octave_idx_type dim3 (void) const { return dimensions(2); } | |
4513 | 251 |
5275 | 252 octave_idx_type rows (void) const { return dim1 (); } |
253 octave_idx_type cols (void) const { return dim2 (); } | |
254 octave_idx_type columns (void) const { return dim2 (); } | |
255 octave_idx_type pages (void) const { return dim3 (); } | |
4513 | 256 |
4902 | 257 size_t byte_size (void) const { return numel () * sizeof (T); } |
258 | |
9026
6890d411a0b8
adjust some array dim query methods
Jaroslav Hajek <highegg@gmail.com>
parents:
9025
diff
changeset
|
259 // Return a const-reference so that dims ()(i) works efficiently. |
6890d411a0b8
adjust some array dim query methods
Jaroslav Hajek <highegg@gmail.com>
parents:
9025
diff
changeset
|
260 const dim_vector& dims (void) const { return dimensions; } |
4513 | 261 |
4532 | 262 Array<T> squeeze (void) const; |
4703 | 263 |
264 void chop_trailing_singletons (void) | |
265 { dimensions.chop_trailing_singletons (); } | |
266 | |
5275 | 267 static octave_idx_type get_size (octave_idx_type r, octave_idx_type c); |
268 static octave_idx_type get_size (octave_idx_type r, octave_idx_type c, octave_idx_type p); | |
269 static octave_idx_type get_size (const dim_vector& dv); | |
228 | 270 |
5275 | 271 octave_idx_type compute_index (const Array<octave_idx_type>& ra_idx) const; |
4517 | 272 |
5275 | 273 T range_error (const char *fcn, octave_idx_type n) const; |
274 T& range_error (const char *fcn, octave_idx_type n); | |
3665 | 275 |
5275 | 276 T range_error (const char *fcn, octave_idx_type i, octave_idx_type j) const; |
277 T& range_error (const char *fcn, octave_idx_type i, octave_idx_type j); | |
4513 | 278 |
5275 | 279 T range_error (const char *fcn, octave_idx_type i, octave_idx_type j, octave_idx_type k) const; |
280 T& range_error (const char *fcn, octave_idx_type i, octave_idx_type j, octave_idx_type k); | |
4513 | 281 |
6867 | 282 T range_error (const char *fcn, const Array<octave_idx_type>& ra_idx) const; |
283 T& range_error (const char *fcn, const Array<octave_idx_type>& ra_idx); | |
4513 | 284 |
2108 | 285 // No checking, even for multiple references, ever. |
286 | |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
287 T& xelem (octave_idx_type n) { return slice_data [n]; } |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
288 T xelem (octave_idx_type n) const { return slice_data [n]; } |
2108 | 289 |
5275 | 290 T& xelem (octave_idx_type i, octave_idx_type j) { return xelem (dim1()*j+i); } |
291 T xelem (octave_idx_type i, octave_idx_type j) const { return xelem (dim1()*j+i); } | |
4513 | 292 |
5275 | 293 T& xelem (octave_idx_type i, octave_idx_type j, octave_idx_type k) { return xelem (i, dim2()*k+j); } |
294 T xelem (octave_idx_type i, octave_idx_type j, octave_idx_type k) const { return xelem (i, dim2()*k+j); } | |
4513 | 295 |
6867 | 296 T& xelem (const Array<octave_idx_type>& ra_idx) |
4513 | 297 { return xelem (compute_index (ra_idx)); } |
298 | |
6867 | 299 T xelem (const Array<octave_idx_type>& ra_idx) const |
4513 | 300 { return xelem (compute_index (ra_idx)); } |
301 | |
5775 | 302 // FIXME -- would be nice to fix this so that we don't |
2006 | 303 // unnecessarily force a copy, but that is not so easy, and I see no |
304 // clean way to do it. | |
305 | |
5275 | 306 T& checkelem (octave_idx_type n) |
2006 | 307 { |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
308 if (n < 0 || n >= slice_len) |
2109 | 309 return range_error ("T& Array<T>::checkelem", n); |
2006 | 310 else |
2108 | 311 { |
312 make_unique (); | |
313 return xelem (n); | |
314 } | |
2006 | 315 } |
316 | |
5275 | 317 T& checkelem (octave_idx_type i, octave_idx_type j) |
4513 | 318 { |
319 if (i < 0 || j < 0 || i >= dim1 () || j >= dim2 ()) | |
320 return range_error ("T& Array<T>::checkelem", i, j); | |
321 else | |
322 return elem (dim1()*j+i); | |
323 } | |
324 | |
5275 | 325 T& checkelem (octave_idx_type i, octave_idx_type j, octave_idx_type k) |
4513 | 326 { |
327 if (i < 0 || j < 0 || k < 0 || i >= dim1 () || j >= dim2 () || k >= dim3 ()) | |
328 return range_error ("T& Array<T>::checkelem", i, j, k); | |
329 else | |
330 return elem (i, dim2()*k+j); | |
331 } | |
332 | |
6867 | 333 T& checkelem (const Array<octave_idx_type>& ra_idx) |
4513 | 334 { |
5275 | 335 octave_idx_type i = compute_index (ra_idx); |
4513 | 336 |
337 if (i < 0) | |
338 return range_error ("T& Array<T>::checkelem", ra_idx); | |
339 else | |
340 return elem (i); | |
341 } | |
342 | |
5275 | 343 T& elem (octave_idx_type n) |
2108 | 344 { |
345 make_unique (); | |
2109 | 346 return xelem (n); |
2108 | 347 } |
2306 | 348 |
5275 | 349 T& elem (octave_idx_type i, octave_idx_type j) { return elem (dim1()*j+i); } |
4513 | 350 |
5275 | 351 T& elem (octave_idx_type i, octave_idx_type j, octave_idx_type k) { return elem (i, dim2()*k+j); } |
4513 | 352 |
6867 | 353 T& elem (const Array<octave_idx_type>& ra_idx) |
4513 | 354 { return Array<T>::elem (compute_index (ra_idx)); } |
355 | |
2306 | 356 #if defined (BOUNDS_CHECKING) |
5275 | 357 T& operator () (octave_idx_type n) { return checkelem (n); } |
358 T& operator () (octave_idx_type i, octave_idx_type j) { return checkelem (i, j); } | |
359 T& operator () (octave_idx_type i, octave_idx_type j, octave_idx_type k) { return checkelem (i, j, k); } | |
6867 | 360 T& operator () (const Array<octave_idx_type>& ra_idx) { return checkelem (ra_idx); } |
2306 | 361 #else |
5275 | 362 T& operator () (octave_idx_type n) { return elem (n); } |
363 T& operator () (octave_idx_type i, octave_idx_type j) { return elem (i, j); } | |
364 T& operator () (octave_idx_type i, octave_idx_type j, octave_idx_type k) { return elem (i, j, k); } | |
6867 | 365 T& operator () (const Array<octave_idx_type>& ra_idx) { return elem (ra_idx); } |
2006 | 366 #endif |
367 | |
5275 | 368 T checkelem (octave_idx_type n) const |
2006 | 369 { |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
370 if (n < 0 || n >= slice_len) |
2109 | 371 return range_error ("T Array<T>::checkelem", n); |
2049 | 372 else |
2108 | 373 return xelem (n); |
2006 | 374 } |
1989 | 375 |
5275 | 376 T checkelem (octave_idx_type i, octave_idx_type j) const |
4513 | 377 { |
378 if (i < 0 || j < 0 || i >= dim1 () || j >= dim2 ()) | |
379 return range_error ("T Array<T>::checkelem", i, j); | |
380 else | |
381 return elem (dim1()*j+i); | |
382 } | |
383 | |
5275 | 384 T checkelem (octave_idx_type i, octave_idx_type j, octave_idx_type k) const |
4513 | 385 { |
386 if (i < 0 || j < 0 || k < 0 || i >= dim1 () || j >= dim2 () || k >= dim3 ()) | |
387 return range_error ("T Array<T>::checkelem", i, j, k); | |
388 else | |
389 return Array<T>::elem (i, Array<T>::dim1()*k+j); | |
390 } | |
391 | |
6867 | 392 T checkelem (const Array<octave_idx_type>& ra_idx) const |
4513 | 393 { |
5275 | 394 octave_idx_type i = compute_index (ra_idx); |
4513 | 395 |
396 if (i < 0) | |
397 return range_error ("T Array<T>::checkelem", ra_idx); | |
398 else | |
399 return Array<T>::elem (i); | |
400 } | |
401 | |
5275 | 402 T elem (octave_idx_type n) const { return xelem (n); } |
2306 | 403 |
5275 | 404 T elem (octave_idx_type i, octave_idx_type j) const { return elem (dim1()*j+i); } |
4513 | 405 |
5275 | 406 T elem (octave_idx_type i, octave_idx_type j, octave_idx_type k) const { return elem (i, dim2()*k+j); } |
4513 | 407 |
6867 | 408 T elem (const Array<octave_idx_type>& ra_idx) const |
4513 | 409 { return Array<T>::elem (compute_index (ra_idx)); } |
410 | |
2108 | 411 #if defined (BOUNDS_CHECKING) |
5275 | 412 T operator () (octave_idx_type n) const { return checkelem (n); } |
413 T operator () (octave_idx_type i, octave_idx_type j) const { return checkelem (i, j); } | |
414 T operator () (octave_idx_type i, octave_idx_type j, octave_idx_type k) const { return checkelem (i, j, k); } | |
6867 | 415 T operator () (const Array<octave_idx_type>& ra_idx) const { return checkelem (ra_idx); } |
2006 | 416 #else |
5275 | 417 T operator () (octave_idx_type n) const { return elem (n); } |
418 T operator () (octave_idx_type i, octave_idx_type j) const { return elem (i, j); } | |
419 T operator () (octave_idx_type i, octave_idx_type j, octave_idx_type k) const { return elem (i, j, k); } | |
6867 | 420 T operator () (const Array<octave_idx_type>& ra_idx) const { return elem (ra_idx); } |
2006 | 421 #endif |
422 | |
4567 | 423 Array<T> reshape (const dim_vector& new_dims) const; |
424 | |
5275 | 425 Array<T> permute (const Array<octave_idx_type>& vec, bool inv = false) const; |
426 Array<T> ipermute (const Array<octave_idx_type>& vec) const | |
4593 | 427 { return permute (vec, true); } |
428 | |
4513 | 429 bool is_square (void) const { return (dim1 () == dim2 ()); } |
430 | |
4559 | 431 bool is_empty (void) const { return numel () == 0; } |
432 | |
9026
6890d411a0b8
adjust some array dim query methods
Jaroslav Hajek <highegg@gmail.com>
parents:
9025
diff
changeset
|
433 bool is_vector (void) const { return dimensions.is_vector (); } |
6890d411a0b8
adjust some array dim query methods
Jaroslav Hajek <highegg@gmail.com>
parents:
9025
diff
changeset
|
434 |
4513 | 435 Array<T> transpose (void) const; |
7789
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
436 Array<T> hermitian (T (*fcn) (const T&) = 0) const; |
238 | 437 |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
438 const T *data (void) const { return slice_data; } |
228 | 439 |
3952 | 440 const T *fortran_vec (void) const { return data (); } |
441 | |
238 | 442 T *fortran_vec (void); |
1560 | 443 |
9546
1beb23d2b892
optimize op= in common cases
Jaroslav Hajek <highegg@gmail.com>
parents:
9341
diff
changeset
|
444 bool is_shared (void) { return rep->count > 1; } |
1beb23d2b892
optimize op= in common cases
Jaroslav Hajek <highegg@gmail.com>
parents:
9341
diff
changeset
|
445 |
4513 | 446 int ndims (void) const { return dimensions.length (); } |
1560 | 447 |
4517 | 448 void maybe_delete_dims (void); |
449 | |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
450 // Indexing without resizing. |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
451 |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
452 Array<T> index (const idx_vector& i) const; |
1560 | 453 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
454 Array<T> index (const idx_vector& i, const idx_vector& j) const; |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
455 |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
456 Array<T> index (const Array<idx_vector>& ia) const; |
1560 | 457 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
458 static T resize_fill_value (); |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
459 |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
460 // Resizing (with fill). |
1560 | 461 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
462 void resize_fill (octave_idx_type n, const T& rfv); |
1560 | 463 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
464 void resize_fill (octave_idx_type nr, octave_idx_type nc, const T& rfv); |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
465 |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
466 void resize_fill (const dim_vector& dv, const T& rfv); |
1560 | 467 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
468 // Resizing with default fill. |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
469 // Rationale: |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
470 // These use the default fill value rather than leaving memory uninitialized. |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
471 // Resizing without fill leaves the resulting array in a rather weird state, |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
472 // where part of the data is initialized an part isn't. |
4513 | 473 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
474 void resize (octave_idx_type n) |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
475 { resize_fill (n, resize_fill_value ()); } |
4513 | 476 |
8333 | 477 // FIXME -- this method cannot be defined here because it would |
478 // clash with | |
479 // | |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
480 // void resize (octave_idx_type, const T&) |
8333 | 481 // |
482 // (these become indistinguishable when T = octave_idx_type). | |
483 // In the future, I think the resize (.., const T& rfv) overloads | |
484 // should go away in favor of using resize_fill. | |
4513 | 485 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
486 // void resize (octave_idx_type nr, octave_idx_type nc) |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
487 // { resize_fill (nr, nc, resize_fill_value ()); } |
4513 | 488 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
489 void resize (dim_vector dv) |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
490 { resize_fill (dv, resize_fill_value ()); } |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
491 |
8333 | 492 // FIXME -- these are here for backward compatibility. They should |
493 // go away in favor of using resize_fill directly. | |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
494 void resize (octave_idx_type n, const T& rfv) |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
495 { resize_fill (n, static_cast<T> (rfv)); } |
4513 | 496 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
497 void resize (octave_idx_type nr, octave_idx_type nc, const T& rfv) |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
498 { resize_fill (nr, nc, rfv); } |
2382 | 499 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
500 void resize (dim_vector dv, const T& rfv) |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
501 { resize_fill (dv, rfv); } |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
502 |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
503 // Indexing with possible resizing and fill |
8333 | 504 // FIXME -- this is really a corner case, that should better be |
505 // handled directly in liboctinterp. | |
3933 | 506 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
507 Array<T> index (const idx_vector& i, bool resize_ok, |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
508 const T& rfv = resize_fill_value ()) const; |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
509 |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
510 Array<T> index (const idx_vector& i, const idx_vector& j, |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
511 bool resize_ok, const T& rfv = resize_fill_value ()) const; |
4513 | 512 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
513 Array<T> index (const Array<idx_vector>& ia, |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
514 bool resize_ok, const T& rfv = resize_fill_value ()) const; |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
515 |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
516 // Indexed assignment (always with resize & fill). |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
517 |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
518 void assign (const idx_vector& i, const Array<T>& rhs, |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
519 const T& rfv = resize_fill_value ()); |
4513 | 520 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
521 void assign (const idx_vector& i, const idx_vector& j, const Array<T>& rhs, |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
522 const T& rfv = resize_fill_value ()); |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
523 |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
524 void assign (const Array<idx_vector>& ia, const Array<T>& rhs, |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
525 const T& rfv = resize_fill_value ()); |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
526 |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
527 // Deleting elements. |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
528 |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
529 // A(I) = [] (with a single subscript) |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
530 void delete_elements (const idx_vector& i); |
4530 | 531 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
532 // A(:,...,I,...,:) = [] (>= 2 subscripts, one of them is non-colon) |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
533 void delete_elements (int dim, const idx_vector& i); |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
534 |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
535 // Dispatcher to the above two. |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
536 void delete_elements (const Array<idx_vector>& ia); |
4513 | 537 |
8333 | 538 // FIXME -- are these required? What exactly are they supposed to do?. |
3928 | 539 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
540 Array<T>& insert (const Array<T>& a, octave_idx_type r, octave_idx_type c); |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
541 Array<T>& insert2 (const Array<T>& a, octave_idx_type r, octave_idx_type c); |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
542 Array<T>& insertN (const Array<T>& a, octave_idx_type r, octave_idx_type c); |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
543 |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
544 Array<T>& insert (const Array<T>& a, const Array<octave_idx_type>& idx); |
3933 | 545 |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
546 void maybe_economize (void) |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
547 { |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
548 if (rep->count == 1 && slice_len != rep->len) |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
549 { |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
550 ArrayRep *new_rep = new ArrayRep (slice_data, slice_len, true); |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
551 delete rep; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
552 rep = new_rep; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
553 slice_data = rep->data; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
554 } |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
555 } |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
556 |
4517 | 557 void print_info (std::ostream& os, const std::string& prefix) const; |
5900 | 558 |
559 // Unsafe. This function exists to support the MEX interface. | |
560 // You should not use it anywhere else. | |
561 void *mex_get_data (void) const { return const_cast<T *> (data ()); } | |
7433 | 562 |
7463
2467639bd8c0
eliminate UNDEFINED sort mode
John W. Eaton <jwe@octave.org>
parents:
7433
diff
changeset
|
563 Array<T> sort (octave_idx_type dim = 0, sortmode mode = ASCENDING) const; |
7433 | 564 Array<T> sort (Array<octave_idx_type> &sidx, octave_idx_type dim = 0, |
7463
2467639bd8c0
eliminate UNDEFINED sort mode
John W. Eaton <jwe@octave.org>
parents:
7433
diff
changeset
|
565 sortmode mode = ASCENDING) const; |
7503
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
566 |
8721
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
567 // Ordering is auto-detected or can be specified. |
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
568 sortmode is_sorted (sortmode mode = UNSORTED) const; |
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
569 |
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
570 // Sort by rows returns only indices. |
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
571 Array<octave_idx_type> sort_rows_idx (sortmode mode = ASCENDING) const; |
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
572 |
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
573 // Ordering is auto-detected or can be specified. |
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
574 sortmode is_sorted_rows (sortmode mode = UNSORTED) const; |
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
575 |
8814
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
576 // Do a binary lookup in a sorted array. |
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
577 // Mode can be specified or is auto-detected by comparing 1st and last element. |
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
578 octave_idx_type lookup (const T& value, sortmode mode = UNSORTED) const; |
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
579 |
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
580 // Ditto, but for an array of values, specializing on long runs. |
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
581 // If linf is true, the leftmost interval is extended to infinity |
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
582 // (indices will be >= 1). |
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
583 // If rinf is true, the rightmost interval is extended to infinity |
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
584 // (indices will be <= length ()-1). |
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
585 Array<octave_idx_type> lookup (const Array<T>& values, sortmode mode = UNSORTED, |
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
586 bool linf = false, bool rinf = false) const; |
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
587 |
9341
9fd5c56ce57a
extend lookup capabilities
Jaroslav Hajek <highegg@gmail.com>
parents:
9201
diff
changeset
|
588 // This looks up only exact matches, giving their indices. Non-exact matches get |
9fd5c56ce57a
extend lookup capabilities
Jaroslav Hajek <highegg@gmail.com>
parents:
9201
diff
changeset
|
589 // the value -1. |
9fd5c56ce57a
extend lookup capabilities
Jaroslav Hajek <highegg@gmail.com>
parents:
9201
diff
changeset
|
590 Array<octave_idx_type> lookupm (const Array<T>& values, sortmode mode = UNSORTED) const; |
9fd5c56ce57a
extend lookup capabilities
Jaroslav Hajek <highegg@gmail.com>
parents:
9201
diff
changeset
|
591 |
9fd5c56ce57a
extend lookup capabilities
Jaroslav Hajek <highegg@gmail.com>
parents:
9201
diff
changeset
|
592 // This looks up only exact matches, returning true/false if match. |
9fd5c56ce57a
extend lookup capabilities
Jaroslav Hajek <highegg@gmail.com>
parents:
9201
diff
changeset
|
593 Array<bool> lookupb (const Array<T>& values, sortmode mode = UNSORTED) const; |
9fd5c56ce57a
extend lookup capabilities
Jaroslav Hajek <highegg@gmail.com>
parents:
9201
diff
changeset
|
594 |
9025 | 595 // Find indices of (at most n) nonzero elements. If n is specified, backward |
596 // specifies search from backward. | |
597 Array<octave_idx_type> find (octave_idx_type n = -1, bool backward = false) const; | |
598 | |
7620
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7503
diff
changeset
|
599 Array<T> diag (octave_idx_type k = 0) const; |
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7503
diff
changeset
|
600 |
7503
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
601 template <class U, class F> |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
602 Array<U> |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
603 map (F fcn) const |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
604 { |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
605 octave_idx_type len = length (); |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
606 |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
607 const T *m = data (); |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
608 |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
609 Array<U> result (dims ()); |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
610 U *p = result.fortran_vec (); |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
611 |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
612 for (octave_idx_type i = 0; i < len; i++) |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
613 { |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
614 OCTAVE_QUIT; |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
615 |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
616 p[i] = fcn (m[i]); |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
617 } |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
618 |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
619 return result; |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
620 } |
8998
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
621 |
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
622 // This is non-breakable map, suitable for fast functions. Efficiency |
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
623 // relies on compiler's ability to inline a function pointer. This seems |
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
624 // to be OK with recent GCC. |
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
625 template <class U> |
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
626 Array<U> |
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
627 fastmap (U (*fcn) (typename ref_param<T>::type)) const |
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
628 { |
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
629 octave_idx_type len = length (); |
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
630 |
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
631 const T *m = data (); |
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
632 |
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
633 Array<U> result (dims ()); |
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
634 U *p = result.fortran_vec (); |
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
635 |
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
636 std::transform (m, m + len, p, fcn); |
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
637 |
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
638 return result; |
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
639 } |
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
640 |
9046
88bf56bbccca
make Array::find already return Matlab-compatible dimensions
Jaroslav Hajek <highegg@gmail.com>
parents:
9026
diff
changeset
|
641 template <class U> friend class Array; |
9201
472f0e22aa60
guard against implicit instantiation
Jaroslav Hajek <highegg@gmail.com>
parents:
9046
diff
changeset
|
642 |
472f0e22aa60
guard against implicit instantiation
Jaroslav Hajek <highegg@gmail.com>
parents:
9046
diff
changeset
|
643 private: |
472f0e22aa60
guard against implicit instantiation
Jaroslav Hajek <highegg@gmail.com>
parents:
9046
diff
changeset
|
644 static void instantiation_guard (); |
4513 | 645 }; |
4459 | 646 |
228 | 647 #endif |
648 | |
649 /* | |
650 ;;; Local Variables: *** | |
651 ;;; mode: C++ *** | |
652 ;;; End: *** | |
653 */ |