Mercurial > hg > octave-nkf
annotate liboctave/Array.h @ 8531:b01fef323c24
add some explaining comments
author | Jaroslav Hajek <highegg@gmail.com> |
---|---|
date | Sat, 17 Jan 2009 16:33:30 +0100 |
parents | 937921654627 |
children | ea8e65ca234f |
rev | line source |
---|---|
1993 | 1 // Template array classes |
228 | 2 /* |
3 | |
7017 | 4 Copyright (C) 1993, 1994, 1995, 1996, 1997, 2000, 2001, 2002, 2003, |
5 2004, 2005, 2006, 2007 John W. Eaton | |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
6 Copyright (C) 2008, 2009 Jaroslav Hajek <highegg@gmail.com> |
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 |
3933 | 32 #include <iostream> |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
33 #include <algorithm> |
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" |
3613 | 37 #include "lo-utils.h" |
7433 | 38 #include "oct-sort.h" |
7503
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
39 #include "quit.h" |
7433 | 40 |
1359 | 41 // One dimensional array class. Handles the reference counting for |
42 // all the derived classes. | |
238 | 43 |
228 | 44 template <class T> |
3585 | 45 class |
46 Array | |
228 | 47 { |
3504 | 48 protected: |
1619 | 49 |
4513 | 50 //-------------------------------------------------------------------- |
51 // The real representation of all arrays. | |
52 //-------------------------------------------------------------------- | |
1735 | 53 |
54 class ArrayRep | |
55 { | |
56 public: | |
57 | |
58 T *data; | |
5275 | 59 octave_idx_type len; |
1735 | 60 int count; |
61 | |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
62 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
|
63 : 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
|
64 { |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
65 if (copy) |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
66 std::copy (d, d + l, data); |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
67 } |
1735 | 68 |
69 ArrayRep (void) : data (0), len (0), count (1) { } | |
70 | |
5275 | 71 explicit ArrayRep (octave_idx_type n) : data (new T [n]), len (n), count (1) { } |
1735 | 72 |
5275 | 73 explicit ArrayRep (octave_idx_type n, const T& val) |
4513 | 74 : data (new T [n]), len (n), count (1) |
75 { | |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
76 std::fill (data, data + n, val); |
4513 | 77 } |
78 | |
1735 | 79 ArrayRep (const ArrayRep& a) |
80 : data (new T [a.len]), len (a.len), count (1) | |
4513 | 81 { |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
82 std::copy (a.data, a.data + a.len, data); |
4513 | 83 } |
4517 | 84 |
1735 | 85 ~ArrayRep (void) { delete [] data; } |
86 | |
5275 | 87 octave_idx_type length (void) const { return len; } |
1735 | 88 |
4517 | 89 private: |
90 | |
91 // No assignment! | |
92 | |
93 ArrayRep& operator = (const ArrayRep& a); | |
1735 | 94 }; |
95 | |
4513 | 96 //-------------------------------------------------------------------- |
97 | |
6884 | 98 public: |
99 | |
8524
937921654627
clean up Array and DiagArray2
Jaroslav Hajek <highegg@gmail.com>
parents:
8523
diff
changeset
|
100 void make_unique (void); |
238 | 101 |
5900 | 102 typedef T element_type; |
103 | |
8524
937921654627
clean up Array and DiagArray2
Jaroslav Hajek <highegg@gmail.com>
parents:
8523
diff
changeset
|
104 protected: |
4902 | 105 |
106 typename Array<T>::ArrayRep *rep; | |
4518 | 107 |
4513 | 108 dim_vector dimensions; |
109 | |
8531
b01fef323c24
add some explaining comments
Jaroslav Hajek <highegg@gmail.com>
parents:
8524
diff
changeset
|
110 // Rationale: |
b01fef323c24
add some explaining comments
Jaroslav Hajek <highegg@gmail.com>
parents:
8524
diff
changeset
|
111 // 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
|
112 // 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
|
113 // 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
|
114 // 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
|
115 // need to be properly updated. |
b01fef323c24
add some explaining comments
Jaroslav Hajek <highegg@gmail.com>
parents:
8524
diff
changeset
|
116 |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
117 T* slice_data; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
118 octave_idx_type slice_len; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
119 |
5275 | 120 Array (T *d, octave_idx_type n) |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
121 : 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
|
122 { |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
123 slice_data = rep->data; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
124 slice_len = rep->len; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
125 } |
1619 | 126 |
4587 | 127 Array (T *d, const dim_vector& dv) |
128 : 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
|
129 dimensions (dv) |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
130 { |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
131 slice_data = rep->data; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
132 slice_len = rep->len; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
133 } |
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 constructor |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
136 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
|
137 octave_idx_type l, octave_idx_type u) |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
138 : rep(a.rep), dimensions (dv) |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
139 { |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
140 rep->count++; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
141 slice_data = a.slice_data + l; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
142 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
|
143 } |
4513 | 144 |
145 private: | |
146 | |
4585 | 147 typename Array<T>::ArrayRep *nil_rep (void) const |
4513 | 148 { |
149 static typename Array<T>::ArrayRep *nr | |
150 = new typename Array<T>::ArrayRep (); | |
151 | |
152 return nr; | |
1550 | 153 } |
238 | 154 |
4902 | 155 template <class U> |
156 T * | |
8118
311c9b36df8f
replace int->octave_idx_type in Array<T>
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
157 coerce (const U *a, octave_idx_type len) |
4902 | 158 { |
159 T *retval = new T [len]; | |
160 | |
8118
311c9b36df8f
replace int->octave_idx_type in Array<T>
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
161 for (octave_idx_type i = 0; i < len; i++) |
4902 | 162 retval[i] = T (a[i]); |
163 | |
164 return retval; | |
165 } | |
166 | |
228 | 167 public: |
238 | 168 |
1550 | 169 Array (void) |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
170 : rep (nil_rep ()), dimensions () |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
171 { |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
172 rep->count++; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
173 slice_data = rep->data; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
174 slice_len = rep->len; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
175 } |
1550 | 176 |
5275 | 177 explicit Array (octave_idx_type n) |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
178 : 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
|
179 { |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
180 slice_data = rep->data; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
181 slice_len = rep->len; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
182 } |
1619 | 183 |
5275 | 184 explicit Array (octave_idx_type n, const T& val) |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
185 : rep (new typename Array<T>::ArrayRep (n)), dimensions (n) |
4513 | 186 { |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
187 slice_data = rep->data; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
188 slice_len = rep->len; |
4513 | 189 fill (val); |
190 } | |
191 | |
4902 | 192 // Type conversion case. |
193 template <class U> | |
194 Array (const Array<U>& a) | |
195 : 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
|
196 dimensions (a.dims ()) |
4902 | 197 { |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
198 slice_data = rep->data; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
199 slice_len = rep->len; |
4902 | 200 } |
201 | |
202 // No type conversion case. | |
4513 | 203 Array (const Array<T>& a) |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
204 : rep (a.rep), dimensions (a.dimensions) |
4513 | 205 { |
206 rep->count++; | |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
207 slice_data = a.slice_data; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
208 slice_len = a.slice_len; |
1550 | 209 } |
210 | |
4513 | 211 public: |
212 | |
4587 | 213 Array (const dim_vector& dv) |
214 : 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
|
215 dimensions (dv) |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
216 { |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
217 slice_data = rep->data; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
218 slice_len = rep->len; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
219 } |
238 | 220 |
4587 | 221 Array (const dim_vector& dv, const T& val) |
222 : rep (new typename Array<T>::ArrayRep (get_size (dv))), | |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
223 dimensions (dv) |
1550 | 224 { |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
225 slice_data = rep->data; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
226 slice_len = rep->len; |
4513 | 227 fill (val); |
228 } | |
229 | |
4834 | 230 Array (const Array<T>& a, const dim_vector& dv); |
228 | 231 |
4979 | 232 virtual ~Array (void); |
228 | 233 |
7717
ff918ee1a983
Delete idx in Sparse<T> and Array<T> operator =
David Bateman <dbateman@free.fr>
parents:
7620
diff
changeset
|
234 Array<T>& operator = (const Array<T>& a); |
4513 | 235 |
8524
937921654627
clean up Array and DiagArray2
Jaroslav Hajek <highegg@gmail.com>
parents:
8523
diff
changeset
|
236 void fill (const T& val); |
238 | 237 |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
238 octave_idx_type capacity (void) const { return slice_len; } |
5275 | 239 octave_idx_type length (void) const { return capacity (); } |
240 octave_idx_type nelem (void) const { return capacity (); } | |
241 octave_idx_type numel (void) const { return nelem (); } | |
4513 | 242 |
5275 | 243 octave_idx_type dim1 (void) const { return dimensions(0); } |
244 octave_idx_type dim2 (void) const { return dimensions(1); } | |
245 octave_idx_type dim3 (void) const { return dimensions(2); } | |
4513 | 246 |
5275 | 247 octave_idx_type rows (void) const { return dim1 (); } |
248 octave_idx_type cols (void) const { return dim2 (); } | |
249 octave_idx_type columns (void) const { return dim2 (); } | |
250 octave_idx_type pages (void) const { return dim3 (); } | |
4513 | 251 |
4902 | 252 size_t byte_size (void) const { return numel () * sizeof (T); } |
253 | |
4513 | 254 dim_vector dims (void) const { return dimensions; } |
255 | |
4532 | 256 Array<T> squeeze (void) const; |
4703 | 257 |
258 void chop_trailing_singletons (void) | |
259 { dimensions.chop_trailing_singletons (); } | |
260 | |
5275 | 261 static octave_idx_type get_size (octave_idx_type r, octave_idx_type c); |
262 static octave_idx_type get_size (octave_idx_type r, octave_idx_type c, octave_idx_type p); | |
263 static octave_idx_type get_size (const dim_vector& dv); | |
228 | 264 |
5275 | 265 octave_idx_type compute_index (const Array<octave_idx_type>& ra_idx) const; |
4517 | 266 |
5275 | 267 T range_error (const char *fcn, octave_idx_type n) const; |
268 T& range_error (const char *fcn, octave_idx_type n); | |
3665 | 269 |
5275 | 270 T range_error (const char *fcn, octave_idx_type i, octave_idx_type j) const; |
271 T& range_error (const char *fcn, octave_idx_type i, octave_idx_type j); | |
4513 | 272 |
5275 | 273 T range_error (const char *fcn, octave_idx_type i, octave_idx_type j, octave_idx_type k) const; |
274 T& range_error (const char *fcn, octave_idx_type i, octave_idx_type j, octave_idx_type k); | |
4513 | 275 |
6867 | 276 T range_error (const char *fcn, const Array<octave_idx_type>& ra_idx) const; |
277 T& range_error (const char *fcn, const Array<octave_idx_type>& ra_idx); | |
4513 | 278 |
2108 | 279 // No checking, even for multiple references, ever. |
280 | |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
281 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
|
282 T xelem (octave_idx_type n) const { return slice_data [n]; } |
2108 | 283 |
5275 | 284 T& xelem (octave_idx_type i, octave_idx_type j) { return xelem (dim1()*j+i); } |
285 T xelem (octave_idx_type i, octave_idx_type j) const { return xelem (dim1()*j+i); } | |
4513 | 286 |
5275 | 287 T& xelem (octave_idx_type i, octave_idx_type j, octave_idx_type k) { return xelem (i, dim2()*k+j); } |
288 T xelem (octave_idx_type i, octave_idx_type j, octave_idx_type k) const { return xelem (i, dim2()*k+j); } | |
4513 | 289 |
6867 | 290 T& xelem (const Array<octave_idx_type>& ra_idx) |
4513 | 291 { return xelem (compute_index (ra_idx)); } |
292 | |
6867 | 293 T xelem (const Array<octave_idx_type>& ra_idx) const |
4513 | 294 { return xelem (compute_index (ra_idx)); } |
295 | |
5775 | 296 // FIXME -- would be nice to fix this so that we don't |
2006 | 297 // unnecessarily force a copy, but that is not so easy, and I see no |
298 // clean way to do it. | |
299 | |
5275 | 300 T& checkelem (octave_idx_type n) |
2006 | 301 { |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
302 if (n < 0 || n >= slice_len) |
2109 | 303 return range_error ("T& Array<T>::checkelem", n); |
2006 | 304 else |
2108 | 305 { |
306 make_unique (); | |
307 return xelem (n); | |
308 } | |
2006 | 309 } |
310 | |
5275 | 311 T& checkelem (octave_idx_type i, octave_idx_type j) |
4513 | 312 { |
313 if (i < 0 || j < 0 || i >= dim1 () || j >= dim2 ()) | |
314 return range_error ("T& Array<T>::checkelem", i, j); | |
315 else | |
316 return elem (dim1()*j+i); | |
317 } | |
318 | |
5275 | 319 T& checkelem (octave_idx_type i, octave_idx_type j, octave_idx_type k) |
4513 | 320 { |
321 if (i < 0 || j < 0 || k < 0 || i >= dim1 () || j >= dim2 () || k >= dim3 ()) | |
322 return range_error ("T& Array<T>::checkelem", i, j, k); | |
323 else | |
324 return elem (i, dim2()*k+j); | |
325 } | |
326 | |
6867 | 327 T& checkelem (const Array<octave_idx_type>& ra_idx) |
4513 | 328 { |
5275 | 329 octave_idx_type i = compute_index (ra_idx); |
4513 | 330 |
331 if (i < 0) | |
332 return range_error ("T& Array<T>::checkelem", ra_idx); | |
333 else | |
334 return elem (i); | |
335 } | |
336 | |
5275 | 337 T& elem (octave_idx_type n) |
2108 | 338 { |
339 make_unique (); | |
2109 | 340 return xelem (n); |
2108 | 341 } |
2306 | 342 |
5275 | 343 T& elem (octave_idx_type i, octave_idx_type j) { return elem (dim1()*j+i); } |
4513 | 344 |
5275 | 345 T& elem (octave_idx_type i, octave_idx_type j, octave_idx_type k) { return elem (i, dim2()*k+j); } |
4513 | 346 |
6867 | 347 T& elem (const Array<octave_idx_type>& ra_idx) |
4513 | 348 { return Array<T>::elem (compute_index (ra_idx)); } |
349 | |
2306 | 350 #if defined (BOUNDS_CHECKING) |
5275 | 351 T& operator () (octave_idx_type n) { return checkelem (n); } |
352 T& operator () (octave_idx_type i, octave_idx_type j) { return checkelem (i, j); } | |
353 T& operator () (octave_idx_type i, octave_idx_type j, octave_idx_type k) { return checkelem (i, j, k); } | |
6867 | 354 T& operator () (const Array<octave_idx_type>& ra_idx) { return checkelem (ra_idx); } |
2306 | 355 #else |
5275 | 356 T& operator () (octave_idx_type n) { return elem (n); } |
357 T& operator () (octave_idx_type i, octave_idx_type j) { return elem (i, j); } | |
358 T& operator () (octave_idx_type i, octave_idx_type j, octave_idx_type k) { return elem (i, j, k); } | |
6867 | 359 T& operator () (const Array<octave_idx_type>& ra_idx) { return elem (ra_idx); } |
2006 | 360 #endif |
361 | |
5275 | 362 T checkelem (octave_idx_type n) const |
2006 | 363 { |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
364 if (n < 0 || n >= slice_len) |
2109 | 365 return range_error ("T Array<T>::checkelem", n); |
2049 | 366 else |
2108 | 367 return xelem (n); |
2006 | 368 } |
1989 | 369 |
5275 | 370 T checkelem (octave_idx_type i, octave_idx_type j) const |
4513 | 371 { |
372 if (i < 0 || j < 0 || i >= dim1 () || j >= dim2 ()) | |
373 return range_error ("T Array<T>::checkelem", i, j); | |
374 else | |
375 return elem (dim1()*j+i); | |
376 } | |
377 | |
5275 | 378 T checkelem (octave_idx_type i, octave_idx_type j, octave_idx_type k) const |
4513 | 379 { |
380 if (i < 0 || j < 0 || k < 0 || i >= dim1 () || j >= dim2 () || k >= dim3 ()) | |
381 return range_error ("T Array<T>::checkelem", i, j, k); | |
382 else | |
383 return Array<T>::elem (i, Array<T>::dim1()*k+j); | |
384 } | |
385 | |
6867 | 386 T checkelem (const Array<octave_idx_type>& ra_idx) const |
4513 | 387 { |
5275 | 388 octave_idx_type i = compute_index (ra_idx); |
4513 | 389 |
390 if (i < 0) | |
391 return range_error ("T Array<T>::checkelem", ra_idx); | |
392 else | |
393 return Array<T>::elem (i); | |
394 } | |
395 | |
5275 | 396 T elem (octave_idx_type n) const { return xelem (n); } |
2306 | 397 |
5275 | 398 T elem (octave_idx_type i, octave_idx_type j) const { return elem (dim1()*j+i); } |
4513 | 399 |
5275 | 400 T elem (octave_idx_type i, octave_idx_type j, octave_idx_type k) const { return elem (i, dim2()*k+j); } |
4513 | 401 |
6867 | 402 T elem (const Array<octave_idx_type>& ra_idx) const |
4513 | 403 { return Array<T>::elem (compute_index (ra_idx)); } |
404 | |
2108 | 405 #if defined (BOUNDS_CHECKING) |
5275 | 406 T operator () (octave_idx_type n) const { return checkelem (n); } |
407 T operator () (octave_idx_type i, octave_idx_type j) const { return checkelem (i, j); } | |
408 T operator () (octave_idx_type i, octave_idx_type j, octave_idx_type k) const { return checkelem (i, j, k); } | |
6867 | 409 T operator () (const Array<octave_idx_type>& ra_idx) const { return checkelem (ra_idx); } |
2006 | 410 #else |
5275 | 411 T operator () (octave_idx_type n) const { return elem (n); } |
412 T operator () (octave_idx_type i, octave_idx_type j) const { return elem (i, j); } | |
413 T operator () (octave_idx_type i, octave_idx_type j, octave_idx_type k) const { return elem (i, j, k); } | |
6867 | 414 T operator () (const Array<octave_idx_type>& ra_idx) const { return elem (ra_idx); } |
2006 | 415 #endif |
416 | |
4567 | 417 Array<T> reshape (const dim_vector& new_dims) const; |
418 | |
5275 | 419 Array<T> permute (const Array<octave_idx_type>& vec, bool inv = false) const; |
420 Array<T> ipermute (const Array<octave_idx_type>& vec) const | |
4593 | 421 { return permute (vec, true); } |
422 | |
4513 | 423 bool is_square (void) const { return (dim1 () == dim2 ()); } |
424 | |
4559 | 425 bool is_empty (void) const { return numel () == 0; } |
426 | |
4513 | 427 Array<T> transpose (void) const; |
7789
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
428 Array<T> hermitian (T (*fcn) (const T&) = 0) const; |
238 | 429 |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
430 const T *data (void) const { return slice_data; } |
228 | 431 |
3952 | 432 const T *fortran_vec (void) const { return data (); } |
433 | |
238 | 434 T *fortran_vec (void); |
1560 | 435 |
4513 | 436 int ndims (void) const { return dimensions.length (); } |
1560 | 437 |
4517 | 438 void maybe_delete_dims (void); |
439 | |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
440 // Indexing without resizing. |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
441 |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
442 Array<T> index (const idx_vector& i) const; |
1560 | 443 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
444 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
|
445 |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
446 Array<T> index (const Array<idx_vector>& ia) const; |
1560 | 447 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
448 static T resize_fill_value (); |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
449 |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
450 // Resizing (with fill). |
1560 | 451 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
452 void resize_fill (octave_idx_type n, const T& rfv); |
1560 | 453 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
454 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
|
455 |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
456 void resize_fill (const dim_vector& dv, const T& rfv); |
1560 | 457 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
458 // Resizing with default fill. |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
459 // Rationale: |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
460 // 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
|
461 // 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
|
462 // where part of the data is initialized an part isn't. |
4513 | 463 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
464 void resize (octave_idx_type n) |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
465 { resize_fill (n, resize_fill_value ()); } |
4513 | 466 |
8333 | 467 // FIXME -- this method cannot be defined here because it would |
468 // clash with | |
469 // | |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
470 // void resize (octave_idx_type, const T&) |
8333 | 471 // |
472 // (these become indistinguishable when T = octave_idx_type). | |
473 // In the future, I think the resize (.., const T& rfv) overloads | |
474 // should go away in favor of using resize_fill. | |
4513 | 475 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
476 // void resize (octave_idx_type nr, octave_idx_type nc) |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
477 // { resize_fill (nr, nc, resize_fill_value ()); } |
4513 | 478 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
479 void resize (dim_vector dv) |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
480 { resize_fill (dv, resize_fill_value ()); } |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
481 |
8333 | 482 // FIXME -- these are here for backward compatibility. They should |
483 // go away in favor of using resize_fill directly. | |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
484 void resize (octave_idx_type n, const T& rfv) |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
485 { resize_fill (n, static_cast<T> (rfv)); } |
4513 | 486 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
487 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
|
488 { resize_fill (nr, nc, rfv); } |
2382 | 489 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
490 void resize (dim_vector dv, const T& rfv) |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
491 { resize_fill (dv, rfv); } |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
492 |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
493 // Indexing with possible resizing and fill |
8333 | 494 // FIXME -- this is really a corner case, that should better be |
495 // handled directly in liboctinterp. | |
3933 | 496 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
497 Array<T> index (const idx_vector& i, bool resize_ok, |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
498 const T& rfv = resize_fill_value ()) const; |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
499 |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
500 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
|
501 bool resize_ok, const T& rfv = resize_fill_value ()) const; |
4513 | 502 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
503 Array<T> index (const Array<idx_vector>& ia, |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
504 bool resize_ok, const T& rfv = resize_fill_value ()) const; |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
505 |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
506 // Indexed assignment (always with resize & fill). |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
507 |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
508 void assign (const idx_vector& i, const Array<T>& rhs, |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
509 const T& rfv = resize_fill_value ()); |
4513 | 510 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
511 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
|
512 const T& rfv = resize_fill_value ()); |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
513 |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
514 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
|
515 const T& rfv = resize_fill_value ()); |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
516 |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
517 // Deleting elements. |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
518 |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
519 // A(I) = [] (with a single subscript) |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
520 void delete_elements (const idx_vector& i); |
4530 | 521 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
522 // A(:,...,I,...,:) = [] (>= 2 subscripts, one of them is non-colon) |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
523 void delete_elements (int dim, const idx_vector& i); |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
524 |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
525 // Dispatcher to the above two. |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
526 void delete_elements (const Array<idx_vector>& ia); |
4513 | 527 |
8333 | 528 // FIXME -- are these required? What exactly are they supposed to do?. |
3928 | 529 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
530 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
|
531 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
|
532 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
|
533 |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
534 Array<T>& insert (const Array<T>& a, const Array<octave_idx_type>& idx); |
3933 | 535 |
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
536 void maybe_economize (void) |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
537 { |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
538 if (rep->count == 1 && slice_len != rep->len) |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
539 { |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
540 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
|
541 delete rep; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
542 rep = new_rep; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
543 slice_data = rep->data; |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
544 } |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
545 } |
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
546 |
4517 | 547 void print_info (std::ostream& os, const std::string& prefix) const; |
5900 | 548 |
549 // Unsafe. This function exists to support the MEX interface. | |
550 // You should not use it anywhere else. | |
551 void *mex_get_data (void) const { return const_cast<T *> (data ()); } | |
7433 | 552 |
7463
2467639bd8c0
eliminate UNDEFINED sort mode
John W. Eaton <jwe@octave.org>
parents:
7433
diff
changeset
|
553 Array<T> sort (octave_idx_type dim = 0, sortmode mode = ASCENDING) const; |
7433 | 554 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
|
555 sortmode mode = ASCENDING) const; |
7503
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
556 |
7620
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7503
diff
changeset
|
557 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
|
558 |
7503
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
559 template <class U, class F> |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
560 Array<U> |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
561 map (F fcn) const |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
562 { |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
563 octave_idx_type len = length (); |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
564 |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
565 const T *m = data (); |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
566 |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
567 Array<U> result (dims ()); |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
568 U *p = result.fortran_vec (); |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
569 |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
570 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
|
571 { |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
572 OCTAVE_QUIT; |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
573 |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
574 p[i] = fcn (m[i]); |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
575 } |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
576 |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
577 return result; |
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
578 } |
4513 | 579 }; |
4459 | 580 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
581 #define INSTANTIATE_ARRAY(T, API) \ |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
582 template class API Array<T> |
4518 | 583 |
8333 | 584 // FIXME -- these are here for compatibility. In the current |
585 // implementation, only homogeneous array assignments are actually | |
586 // instantiated. I think heterogeneous indexed assignments are rare | |
587 // enough to be implemented via conversion first. This decision may | |
588 // still be revised, that's why these macros stay here. | |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
589 #define INSTANTIATE_ARRAY_AND_ASSIGN(T, API) \ |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
590 INSTANTIATE_ARRAY(T, API) |
1560 | 591 |
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
592 #define INSTANTIATE_ARRAY_ASSIGN(LT, RT, API) |
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
593 // do nothing |
4594 | 594 |
7433 | 595 #define INSTANTIATE_ARRAY_SORT(T) \ |
596 template class octave_sort<T>; \ | |
597 template class vec_index<T>; \ | |
598 template class octave_sort<vec_index<T> *>; | |
599 | |
600 #define NO_INSTANTIATE_ARRAY_SORT(T) \ | |
601 template class vec_index<T>; \ | |
602 template <> bool ascending_compare (T, T) { return true; } \ | |
603 template <> bool ascending_compare (vec_index<T> *, vec_index<T> *) \ | |
604 { return true; } \ | |
605 template <> bool descending_compare (T, T) { return true; } \ | |
606 template <> bool descending_compare (vec_index<T> *, vec_index<T> *) \ | |
607 { return true; } \ | |
608 template <> Array<T> Array<T>::sort \ | |
609 (octave_idx_type, sortmode) const { return *this; } \ | |
610 template <> Array<T> Array<T>::sort (Array<octave_idx_type> &sidx, \ | |
611 octave_idx_type, sortmode) const \ | |
612 { sidx = Array<octave_idx_type> (); return *this; } | |
613 | |
228 | 614 #endif |
615 | |
616 /* | |
617 ;;; Local Variables: *** | |
618 ;;; mode: C++ *** | |
619 ;;; End: *** | |
620 */ |