Mercurial > hg > octave-nkf
annotate liboctave/Array.h @ 9731:7b9cbaad68d6
extend Array<T>
| author | Jaroslav Hajek <highegg@gmail.com> |
|---|---|
| date | Fri, 16 Oct 2009 10:28:26 +0200 |
| parents | aea3a3a950e1 |
| children | b4fdfee405b5 |
| 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 | |
|
9556
948795dc1974
make a few Array methods inline
Jaroslav Hajek <highegg@gmail.com>
parents:
9546
diff
changeset
|
101 void make_unique (void) |
|
948795dc1974
make a few Array methods inline
Jaroslav Hajek <highegg@gmail.com>
parents:
9546
diff
changeset
|
102 { |
|
948795dc1974
make a few Array methods inline
Jaroslav Hajek <highegg@gmail.com>
parents:
9546
diff
changeset
|
103 if (rep->count > 1) |
|
948795dc1974
make a few Array methods inline
Jaroslav Hajek <highegg@gmail.com>
parents:
9546
diff
changeset
|
104 { |
|
948795dc1974
make a few Array methods inline
Jaroslav Hajek <highegg@gmail.com>
parents:
9546
diff
changeset
|
105 --rep->count; |
|
948795dc1974
make a few Array methods inline
Jaroslav Hajek <highegg@gmail.com>
parents:
9546
diff
changeset
|
106 rep = new ArrayRep (slice_data, slice_len, true); |
|
948795dc1974
make a few Array methods inline
Jaroslav Hajek <highegg@gmail.com>
parents:
9546
diff
changeset
|
107 slice_data = rep->data; |
|
948795dc1974
make a few Array methods inline
Jaroslav Hajek <highegg@gmail.com>
parents:
9546
diff
changeset
|
108 } |
|
948795dc1974
make a few Array methods inline
Jaroslav Hajek <highegg@gmail.com>
parents:
9546
diff
changeset
|
109 } |
| 238 | 110 |
| 5900 | 111 typedef T element_type; |
| 112 | |
| 8725 | 113 typedef bool (*compare_fcn_type) (typename ref_param<T>::type, |
| 114 typename ref_param<T>::type); | |
| 115 | |
|
8524
937921654627
clean up Array and DiagArray2
Jaroslav Hajek <highegg@gmail.com>
parents:
8523
diff
changeset
|
116 protected: |
| 4902 | 117 |
| 118 typename Array<T>::ArrayRep *rep; | |
| 4518 | 119 |
| 4513 | 120 dim_vector dimensions; |
| 121 | |
|
8531
b01fef323c24
add some explaining comments
Jaroslav Hajek <highegg@gmail.com>
parents:
8524
diff
changeset
|
122 // Rationale: |
|
b01fef323c24
add some explaining comments
Jaroslav Hajek <highegg@gmail.com>
parents:
8524
diff
changeset
|
123 // 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
|
124 // 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
|
125 // 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
|
126 // 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
|
127 // need to be properly updated. |
|
b01fef323c24
add some explaining comments
Jaroslav Hajek <highegg@gmail.com>
parents:
8524
diff
changeset
|
128 |
|
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
129 T* slice_data; |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
130 octave_idx_type slice_len; |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
131 |
| 5275 | 132 Array (T *d, octave_idx_type n) |
|
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
133 : 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
|
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 } |
| 1619 | 138 |
| 4587 | 139 Array (T *d, const dim_vector& dv) |
| 140 : 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
|
141 dimensions (dv) |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
142 { |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
143 slice_data = rep->data; |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
144 slice_len = rep->len; |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
145 } |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
146 |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
147 // slice constructor |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
148 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
|
149 octave_idx_type l, octave_idx_type u) |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
150 : rep(a.rep), dimensions (dv) |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
151 { |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
152 rep->count++; |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
153 slice_data = a.slice_data + l; |
| 9731 | 154 slice_len = u - l; |
|
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
155 } |
| 4513 | 156 |
| 157 private: | |
| 158 | |
| 4585 | 159 typename Array<T>::ArrayRep *nil_rep (void) const |
| 4513 | 160 { |
| 161 static typename Array<T>::ArrayRep *nr | |
| 162 = new typename Array<T>::ArrayRep (); | |
| 163 | |
| 164 return nr; | |
| 1550 | 165 } |
| 238 | 166 |
| 4902 | 167 template <class U> |
| 168 T * | |
|
8118
311c9b36df8f
replace int->octave_idx_type in Array<T>
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
169 coerce (const U *a, octave_idx_type len) |
| 4902 | 170 { |
| 171 T *retval = new T [len]; | |
| 172 | |
|
8118
311c9b36df8f
replace int->octave_idx_type in Array<T>
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
173 for (octave_idx_type i = 0; i < len; i++) |
| 4902 | 174 retval[i] = T (a[i]); |
| 175 | |
| 176 return retval; | |
| 177 } | |
| 178 | |
| 228 | 179 public: |
| 238 | 180 |
| 1550 | 181 Array (void) |
|
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
182 : rep (nil_rep ()), dimensions () |
|
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 rep->count++; |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
185 slice_data = rep->data; |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
186 slice_len = rep->len; |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
187 } |
| 1550 | 188 |
| 5275 | 189 explicit Array (octave_idx_type n) |
|
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
190 : 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
|
191 { |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
192 slice_data = rep->data; |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
193 slice_len = rep->len; |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
194 } |
| 1619 | 195 |
| 5275 | 196 explicit Array (octave_idx_type n, const T& val) |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
197 : rep (new typename Array<T>::ArrayRep (n)), dimensions (n) |
| 4513 | 198 { |
|
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
199 slice_data = rep->data; |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
200 slice_len = rep->len; |
| 4513 | 201 fill (val); |
| 202 } | |
| 203 | |
| 4902 | 204 // Type conversion case. |
| 205 template <class U> | |
| 206 Array (const Array<U>& a) | |
| 207 : 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
|
208 dimensions (a.dims ()) |
| 4902 | 209 { |
|
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
210 slice_data = rep->data; |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
211 slice_len = rep->len; |
| 4902 | 212 } |
| 213 | |
| 214 // No type conversion case. | |
| 4513 | 215 Array (const Array<T>& a) |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
216 : rep (a.rep), dimensions (a.dimensions) |
| 4513 | 217 { |
| 218 rep->count++; | |
|
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
219 slice_data = a.slice_data; |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
220 slice_len = a.slice_len; |
| 1550 | 221 } |
| 222 | |
| 4513 | 223 public: |
| 224 | |
| 4587 | 225 Array (const dim_vector& dv) |
| 226 : 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
|
227 dimensions (dv) |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
228 { |
|
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; |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
231 } |
| 238 | 232 |
| 4587 | 233 Array (const dim_vector& dv, const T& val) |
| 234 : rep (new typename Array<T>::ArrayRep (get_size (dv))), | |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
235 dimensions (dv) |
| 1550 | 236 { |
|
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
237 slice_data = rep->data; |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
238 slice_len = rep->len; |
| 4513 | 239 fill (val); |
| 240 } | |
| 241 | |
| 9731 | 242 // Reshape constructor. |
| 4834 | 243 Array (const Array<T>& a, const dim_vector& dv); |
| 228 | 244 |
|
9556
948795dc1974
make a few Array methods inline
Jaroslav Hajek <highegg@gmail.com>
parents:
9546
diff
changeset
|
245 ~Array (void) |
|
948795dc1974
make a few Array methods inline
Jaroslav Hajek <highegg@gmail.com>
parents:
9546
diff
changeset
|
246 { |
|
948795dc1974
make a few Array methods inline
Jaroslav Hajek <highegg@gmail.com>
parents:
9546
diff
changeset
|
247 if (--rep->count <= 0) |
|
948795dc1974
make a few Array methods inline
Jaroslav Hajek <highegg@gmail.com>
parents:
9546
diff
changeset
|
248 delete rep; |
|
948795dc1974
make a few Array methods inline
Jaroslav Hajek <highegg@gmail.com>
parents:
9546
diff
changeset
|
249 } |
| 228 | 250 |
|
9556
948795dc1974
make a few Array methods inline
Jaroslav Hajek <highegg@gmail.com>
parents:
9546
diff
changeset
|
251 Array<T>& operator = (const Array<T>& a) |
|
948795dc1974
make a few Array methods inline
Jaroslav Hajek <highegg@gmail.com>
parents:
9546
diff
changeset
|
252 { |
|
948795dc1974
make a few Array methods inline
Jaroslav Hajek <highegg@gmail.com>
parents:
9546
diff
changeset
|
253 if (this != &a) |
|
948795dc1974
make a few Array methods inline
Jaroslav Hajek <highegg@gmail.com>
parents:
9546
diff
changeset
|
254 { |
|
948795dc1974
make a few Array methods inline
Jaroslav Hajek <highegg@gmail.com>
parents:
9546
diff
changeset
|
255 if (--rep->count <= 0) |
|
948795dc1974
make a few Array methods inline
Jaroslav Hajek <highegg@gmail.com>
parents:
9546
diff
changeset
|
256 delete rep; |
|
948795dc1974
make a few Array methods inline
Jaroslav Hajek <highegg@gmail.com>
parents:
9546
diff
changeset
|
257 |
|
948795dc1974
make a few Array methods inline
Jaroslav Hajek <highegg@gmail.com>
parents:
9546
diff
changeset
|
258 rep = a.rep; |
|
948795dc1974
make a few Array methods inline
Jaroslav Hajek <highegg@gmail.com>
parents:
9546
diff
changeset
|
259 rep->count++; |
|
948795dc1974
make a few Array methods inline
Jaroslav Hajek <highegg@gmail.com>
parents:
9546
diff
changeset
|
260 |
|
948795dc1974
make a few Array methods inline
Jaroslav Hajek <highegg@gmail.com>
parents:
9546
diff
changeset
|
261 dimensions = a.dimensions; |
|
948795dc1974
make a few Array methods inline
Jaroslav Hajek <highegg@gmail.com>
parents:
9546
diff
changeset
|
262 slice_data = a.slice_data; |
|
948795dc1974
make a few Array methods inline
Jaroslav Hajek <highegg@gmail.com>
parents:
9546
diff
changeset
|
263 slice_len = a.slice_len; |
|
948795dc1974
make a few Array methods inline
Jaroslav Hajek <highegg@gmail.com>
parents:
9546
diff
changeset
|
264 } |
|
948795dc1974
make a few Array methods inline
Jaroslav Hajek <highegg@gmail.com>
parents:
9546
diff
changeset
|
265 |
|
948795dc1974
make a few Array methods inline
Jaroslav Hajek <highegg@gmail.com>
parents:
9546
diff
changeset
|
266 return *this; |
|
948795dc1974
make a few Array methods inline
Jaroslav Hajek <highegg@gmail.com>
parents:
9546
diff
changeset
|
267 } |
| 4513 | 268 |
|
8524
937921654627
clean up Array and DiagArray2
Jaroslav Hajek <highegg@gmail.com>
parents:
8523
diff
changeset
|
269 void fill (const T& val); |
|
9624
3fc7272937ce
implement Array<T>::clear overloads
Jaroslav Hajek <highegg@gmail.com>
parents:
9556
diff
changeset
|
270 |
|
9546
1beb23d2b892
optimize op= in common cases
Jaroslav Hajek <highegg@gmail.com>
parents:
9341
diff
changeset
|
271 void clear (void); |
|
9624
3fc7272937ce
implement Array<T>::clear overloads
Jaroslav Hajek <highegg@gmail.com>
parents:
9556
diff
changeset
|
272 void clear (const dim_vector& dv); |
|
3fc7272937ce
implement Array<T>::clear overloads
Jaroslav Hajek <highegg@gmail.com>
parents:
9556
diff
changeset
|
273 void clear (octave_idx_type n) |
|
3fc7272937ce
implement Array<T>::clear overloads
Jaroslav Hajek <highegg@gmail.com>
parents:
9556
diff
changeset
|
274 { clear (dim_vector (n)); } |
|
3fc7272937ce
implement Array<T>::clear overloads
Jaroslav Hajek <highegg@gmail.com>
parents:
9556
diff
changeset
|
275 |
|
3fc7272937ce
implement Array<T>::clear overloads
Jaroslav Hajek <highegg@gmail.com>
parents:
9556
diff
changeset
|
276 void clear (octave_idx_type r, octave_idx_type c) |
|
3fc7272937ce
implement Array<T>::clear overloads
Jaroslav Hajek <highegg@gmail.com>
parents:
9556
diff
changeset
|
277 { clear (dim_vector (r, c)); } |
| 238 | 278 |
|
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
279 octave_idx_type capacity (void) const { return slice_len; } |
| 5275 | 280 octave_idx_type length (void) const { return capacity (); } |
| 281 octave_idx_type nelem (void) const { return capacity (); } | |
| 282 octave_idx_type numel (void) const { return nelem (); } | |
| 4513 | 283 |
| 5275 | 284 octave_idx_type dim1 (void) const { return dimensions(0); } |
| 285 octave_idx_type dim2 (void) const { return dimensions(1); } | |
| 286 octave_idx_type dim3 (void) const { return dimensions(2); } | |
| 4513 | 287 |
| 5275 | 288 octave_idx_type rows (void) const { return dim1 (); } |
| 289 octave_idx_type cols (void) const { return dim2 (); } | |
| 290 octave_idx_type columns (void) const { return dim2 (); } | |
| 291 octave_idx_type pages (void) const { return dim3 (); } | |
| 4513 | 292 |
| 4902 | 293 size_t byte_size (void) const { return numel () * sizeof (T); } |
| 294 | |
|
9026
6890d411a0b8
adjust some array dim query methods
Jaroslav Hajek <highegg@gmail.com>
parents:
9025
diff
changeset
|
295 // 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
|
296 const dim_vector& dims (void) const { return dimensions; } |
| 4513 | 297 |
| 4532 | 298 Array<T> squeeze (void) const; |
| 4703 | 299 |
| 300 void chop_trailing_singletons (void) | |
| 301 { dimensions.chop_trailing_singletons (); } | |
| 302 | |
| 5275 | 303 static octave_idx_type get_size (octave_idx_type r, octave_idx_type c); |
| 304 static octave_idx_type get_size (octave_idx_type r, octave_idx_type c, octave_idx_type p); | |
| 305 static octave_idx_type get_size (const dim_vector& dv); | |
| 228 | 306 |
| 5275 | 307 octave_idx_type compute_index (const Array<octave_idx_type>& ra_idx) const; |
| 4517 | 308 |
| 5275 | 309 T range_error (const char *fcn, octave_idx_type n) const; |
| 310 T& range_error (const char *fcn, octave_idx_type n); | |
| 3665 | 311 |
| 5275 | 312 T range_error (const char *fcn, octave_idx_type i, octave_idx_type j) const; |
| 313 T& range_error (const char *fcn, octave_idx_type i, octave_idx_type j); | |
| 4513 | 314 |
| 5275 | 315 T range_error (const char *fcn, octave_idx_type i, octave_idx_type j, octave_idx_type k) const; |
| 316 T& range_error (const char *fcn, octave_idx_type i, octave_idx_type j, octave_idx_type k); | |
| 4513 | 317 |
| 6867 | 318 T range_error (const char *fcn, const Array<octave_idx_type>& ra_idx) const; |
| 319 T& range_error (const char *fcn, const Array<octave_idx_type>& ra_idx); | |
| 4513 | 320 |
| 2108 | 321 // No checking, even for multiple references, ever. |
| 322 | |
|
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
323 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
|
324 T xelem (octave_idx_type n) const { return slice_data [n]; } |
| 2108 | 325 |
| 5275 | 326 T& xelem (octave_idx_type i, octave_idx_type j) { return xelem (dim1()*j+i); } |
| 327 T xelem (octave_idx_type i, octave_idx_type j) const { return xelem (dim1()*j+i); } | |
| 4513 | 328 |
| 5275 | 329 T& xelem (octave_idx_type i, octave_idx_type j, octave_idx_type k) { return xelem (i, dim2()*k+j); } |
| 330 T xelem (octave_idx_type i, octave_idx_type j, octave_idx_type k) const { return xelem (i, dim2()*k+j); } | |
| 4513 | 331 |
| 6867 | 332 T& xelem (const Array<octave_idx_type>& ra_idx) |
| 4513 | 333 { return xelem (compute_index (ra_idx)); } |
| 334 | |
| 6867 | 335 T xelem (const Array<octave_idx_type>& ra_idx) const |
| 4513 | 336 { return xelem (compute_index (ra_idx)); } |
| 337 | |
| 5775 | 338 // FIXME -- would be nice to fix this so that we don't |
| 2006 | 339 // unnecessarily force a copy, but that is not so easy, and I see no |
| 340 // clean way to do it. | |
| 341 | |
| 5275 | 342 T& checkelem (octave_idx_type n) |
| 2006 | 343 { |
|
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
344 if (n < 0 || n >= slice_len) |
| 2109 | 345 return range_error ("T& Array<T>::checkelem", n); |
| 2006 | 346 else |
| 2108 | 347 { |
| 348 make_unique (); | |
| 349 return xelem (n); | |
| 350 } | |
| 2006 | 351 } |
| 352 | |
| 5275 | 353 T& checkelem (octave_idx_type i, octave_idx_type j) |
| 4513 | 354 { |
| 355 if (i < 0 || j < 0 || i >= dim1 () || j >= dim2 ()) | |
| 356 return range_error ("T& Array<T>::checkelem", i, j); | |
| 357 else | |
| 358 return elem (dim1()*j+i); | |
| 359 } | |
| 360 | |
| 5275 | 361 T& checkelem (octave_idx_type i, octave_idx_type j, octave_idx_type k) |
| 4513 | 362 { |
| 363 if (i < 0 || j < 0 || k < 0 || i >= dim1 () || j >= dim2 () || k >= dim3 ()) | |
| 364 return range_error ("T& Array<T>::checkelem", i, j, k); | |
| 365 else | |
| 366 return elem (i, dim2()*k+j); | |
| 367 } | |
| 368 | |
| 6867 | 369 T& checkelem (const Array<octave_idx_type>& ra_idx) |
| 4513 | 370 { |
| 5275 | 371 octave_idx_type i = compute_index (ra_idx); |
| 4513 | 372 |
| 373 if (i < 0) | |
| 374 return range_error ("T& Array<T>::checkelem", ra_idx); | |
| 375 else | |
| 376 return elem (i); | |
| 377 } | |
| 378 | |
| 5275 | 379 T& elem (octave_idx_type n) |
| 2108 | 380 { |
| 381 make_unique (); | |
| 2109 | 382 return xelem (n); |
| 2108 | 383 } |
| 2306 | 384 |
| 5275 | 385 T& elem (octave_idx_type i, octave_idx_type j) { return elem (dim1()*j+i); } |
| 4513 | 386 |
| 5275 | 387 T& elem (octave_idx_type i, octave_idx_type j, octave_idx_type k) { return elem (i, dim2()*k+j); } |
| 4513 | 388 |
| 6867 | 389 T& elem (const Array<octave_idx_type>& ra_idx) |
| 4513 | 390 { return Array<T>::elem (compute_index (ra_idx)); } |
| 391 | |
| 2306 | 392 #if defined (BOUNDS_CHECKING) |
| 5275 | 393 T& operator () (octave_idx_type n) { return checkelem (n); } |
| 394 T& operator () (octave_idx_type i, octave_idx_type j) { return checkelem (i, j); } | |
| 395 T& operator () (octave_idx_type i, octave_idx_type j, octave_idx_type k) { return checkelem (i, j, k); } | |
| 6867 | 396 T& operator () (const Array<octave_idx_type>& ra_idx) { return checkelem (ra_idx); } |
| 2306 | 397 #else |
| 5275 | 398 T& operator () (octave_idx_type n) { return elem (n); } |
| 399 T& operator () (octave_idx_type i, octave_idx_type j) { return elem (i, j); } | |
| 400 T& operator () (octave_idx_type i, octave_idx_type j, octave_idx_type k) { return elem (i, j, k); } | |
| 6867 | 401 T& operator () (const Array<octave_idx_type>& ra_idx) { return elem (ra_idx); } |
| 2006 | 402 #endif |
| 403 | |
| 5275 | 404 T checkelem (octave_idx_type n) const |
| 2006 | 405 { |
|
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
406 if (n < 0 || n >= slice_len) |
| 2109 | 407 return range_error ("T Array<T>::checkelem", n); |
| 2049 | 408 else |
| 2108 | 409 return xelem (n); |
| 2006 | 410 } |
| 1989 | 411 |
| 5275 | 412 T checkelem (octave_idx_type i, octave_idx_type j) const |
| 4513 | 413 { |
| 414 if (i < 0 || j < 0 || i >= dim1 () || j >= dim2 ()) | |
| 415 return range_error ("T Array<T>::checkelem", i, j); | |
| 416 else | |
| 417 return elem (dim1()*j+i); | |
| 418 } | |
| 419 | |
| 5275 | 420 T checkelem (octave_idx_type i, octave_idx_type j, octave_idx_type k) const |
| 4513 | 421 { |
| 422 if (i < 0 || j < 0 || k < 0 || i >= dim1 () || j >= dim2 () || k >= dim3 ()) | |
| 423 return range_error ("T Array<T>::checkelem", i, j, k); | |
| 424 else | |
| 425 return Array<T>::elem (i, Array<T>::dim1()*k+j); | |
| 426 } | |
| 427 | |
| 6867 | 428 T checkelem (const Array<octave_idx_type>& ra_idx) const |
| 4513 | 429 { |
| 5275 | 430 octave_idx_type i = compute_index (ra_idx); |
| 4513 | 431 |
| 432 if (i < 0) | |
| 433 return range_error ("T Array<T>::checkelem", ra_idx); | |
| 434 else | |
| 435 return Array<T>::elem (i); | |
| 436 } | |
| 437 | |
| 5275 | 438 T elem (octave_idx_type n) const { return xelem (n); } |
| 2306 | 439 |
| 5275 | 440 T elem (octave_idx_type i, octave_idx_type j) const { return elem (dim1()*j+i); } |
| 4513 | 441 |
| 5275 | 442 T elem (octave_idx_type i, octave_idx_type j, octave_idx_type k) const { return elem (i, dim2()*k+j); } |
| 4513 | 443 |
| 6867 | 444 T elem (const Array<octave_idx_type>& ra_idx) const |
| 4513 | 445 { return Array<T>::elem (compute_index (ra_idx)); } |
| 446 | |
| 2108 | 447 #if defined (BOUNDS_CHECKING) |
| 5275 | 448 T operator () (octave_idx_type n) const { return checkelem (n); } |
| 449 T operator () (octave_idx_type i, octave_idx_type j) const { return checkelem (i, j); } | |
| 450 T operator () (octave_idx_type i, octave_idx_type j, octave_idx_type k) const { return checkelem (i, j, k); } | |
| 6867 | 451 T operator () (const Array<octave_idx_type>& ra_idx) const { return checkelem (ra_idx); } |
| 2006 | 452 #else |
| 5275 | 453 T operator () (octave_idx_type n) const { return elem (n); } |
| 454 T operator () (octave_idx_type i, octave_idx_type j) const { return elem (i, j); } | |
| 455 T operator () (octave_idx_type i, octave_idx_type j, octave_idx_type k) const { return elem (i, j, k); } | |
| 6867 | 456 T operator () (const Array<octave_idx_type>& ra_idx) const { return elem (ra_idx); } |
| 2006 | 457 #endif |
| 458 | |
| 9731 | 459 // Fast extractors. All of these produce shallow copies. |
| 460 // Warning: none of these do check bounds, unless BOUNDS_CHECKING is on! | |
| 461 | |
| 462 // Extract column: A(:,k+1). | |
| 463 Array<T> column (octave_idx_type k) const; | |
| 464 // Extract page: A(:,:,k+1). | |
| 465 Array<T> page (octave_idx_type k) const; | |
| 466 | |
| 467 // Give this array as a column vector: A(:). | |
| 468 Array<T> linearize (void) const; | |
| 469 | |
| 470 // Extract a slice from this array as a column vector: A(:)(lo+1:up). | |
| 471 // Must be 0 <= lo && up <= numel. May be up < lo. | |
| 472 Array<T> linear_slice (octave_idx_type lo, octave_idx_type up) const; | |
| 473 | |
| 474 Array<T> reshape (const dim_vector& new_dims) const | |
| 475 { return Array<T> (*this, new_dims); } | |
| 4567 | 476 |
| 5275 | 477 Array<T> permute (const Array<octave_idx_type>& vec, bool inv = false) const; |
| 478 Array<T> ipermute (const Array<octave_idx_type>& vec) const | |
| 4593 | 479 { return permute (vec, true); } |
| 480 | |
| 4513 | 481 bool is_square (void) const { return (dim1 () == dim2 ()); } |
| 482 | |
| 4559 | 483 bool is_empty (void) const { return numel () == 0; } |
| 484 | |
|
9026
6890d411a0b8
adjust some array dim query methods
Jaroslav Hajek <highegg@gmail.com>
parents:
9025
diff
changeset
|
485 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
|
486 |
| 4513 | 487 Array<T> transpose (void) const; |
|
7789
82be108cc558
First attempt at single precision tyeps
David Bateman <dbateman@free.fr>
parents:
7717
diff
changeset
|
488 Array<T> hermitian (T (*fcn) (const T&) = 0) const; |
| 238 | 489 |
|
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
490 const T *data (void) const { return slice_data; } |
| 228 | 491 |
| 3952 | 492 const T *fortran_vec (void) const { return data (); } |
| 493 | |
| 238 | 494 T *fortran_vec (void); |
| 1560 | 495 |
|
9546
1beb23d2b892
optimize op= in common cases
Jaroslav Hajek <highegg@gmail.com>
parents:
9341
diff
changeset
|
496 bool is_shared (void) { return rep->count > 1; } |
|
1beb23d2b892
optimize op= in common cases
Jaroslav Hajek <highegg@gmail.com>
parents:
9341
diff
changeset
|
497 |
| 4513 | 498 int ndims (void) const { return dimensions.length (); } |
| 1560 | 499 |
| 4517 | 500 void maybe_delete_dims (void); |
| 501 | |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
502 // Indexing without resizing. |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
503 |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
504 Array<T> index (const idx_vector& i) const; |
| 1560 | 505 |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
506 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
|
507 |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
508 Array<T> index (const Array<idx_vector>& ia) const; |
| 1560 | 509 |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
510 static T resize_fill_value (); |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
511 |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
512 // Resizing (with fill). |
| 1560 | 513 |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
514 void resize_fill (octave_idx_type n, const T& rfv); |
| 1560 | 515 |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
516 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
|
517 |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
518 void resize_fill (const dim_vector& dv, const T& rfv); |
| 1560 | 519 |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
520 // Resizing with default fill. |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
521 // Rationale: |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
522 // 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
|
523 // 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
|
524 // where part of the data is initialized an part isn't. |
| 4513 | 525 |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
526 void resize (octave_idx_type n) |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
527 { resize_fill (n, resize_fill_value ()); } |
| 4513 | 528 |
| 8333 | 529 // FIXME -- this method cannot be defined here because it would |
| 530 // clash with | |
| 531 // | |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
532 // void resize (octave_idx_type, const T&) |
| 8333 | 533 // |
| 534 // (these become indistinguishable when T = octave_idx_type). | |
| 535 // In the future, I think the resize (.., const T& rfv) overloads | |
| 536 // should go away in favor of using resize_fill. | |
| 4513 | 537 |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
538 // void resize (octave_idx_type nr, octave_idx_type nc) |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
539 // { resize_fill (nr, nc, resize_fill_value ()); } |
| 4513 | 540 |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
541 void resize (dim_vector dv) |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
542 { resize_fill (dv, resize_fill_value ()); } |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
543 |
| 8333 | 544 // FIXME -- these are here for backward compatibility. They should |
| 545 // go away in favor of using resize_fill directly. | |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
546 void resize (octave_idx_type n, const T& rfv) |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
547 { resize_fill (n, static_cast<T> (rfv)); } |
| 4513 | 548 |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
549 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
|
550 { resize_fill (nr, nc, rfv); } |
| 2382 | 551 |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
552 void resize (dim_vector dv, const T& rfv) |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
553 { resize_fill (dv, rfv); } |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
554 |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
555 // Indexing with possible resizing and fill |
| 8333 | 556 // FIXME -- this is really a corner case, that should better be |
| 557 // handled directly in liboctinterp. | |
| 3933 | 558 |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
559 Array<T> index (const idx_vector& i, bool resize_ok, |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
560 const T& rfv = resize_fill_value ()) const; |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
561 |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
562 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
|
563 bool resize_ok, const T& rfv = resize_fill_value ()) const; |
| 4513 | 564 |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
565 Array<T> index (const Array<idx_vector>& ia, |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
566 bool resize_ok, const T& rfv = resize_fill_value ()) const; |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
567 |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
568 // Indexed assignment (always with resize & fill). |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
569 |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
570 void assign (const idx_vector& i, const Array<T>& rhs, |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
571 const T& rfv = resize_fill_value ()); |
| 4513 | 572 |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
573 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
|
574 const T& rfv = resize_fill_value ()); |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
575 |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
576 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
|
577 const T& rfv = resize_fill_value ()); |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
578 |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
579 // Deleting elements. |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
580 |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
581 // A(I) = [] (with a single subscript) |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
582 void delete_elements (const idx_vector& i); |
| 4530 | 583 |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
584 // A(:,...,I,...,:) = [] (>= 2 subscripts, one of them is non-colon) |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
585 void delete_elements (int dim, const idx_vector& i); |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
586 |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
587 // Dispatcher to the above two. |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
588 void delete_elements (const Array<idx_vector>& ia); |
| 4513 | 589 |
| 8333 | 590 // FIXME -- are these required? What exactly are they supposed to do?. |
| 3928 | 591 |
|
8290
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
592 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
|
593 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
|
594 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
|
595 |
|
7cbe01c21986
improve dense array indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8179
diff
changeset
|
596 Array<T>& insert (const Array<T>& a, const Array<octave_idx_type>& idx); |
| 3933 | 597 |
|
8523
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
598 void maybe_economize (void) |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
599 { |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
600 if (rep->count == 1 && slice_len != rep->len) |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
601 { |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
602 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
|
603 delete rep; |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
604 rep = new_rep; |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
605 slice_data = rep->data; |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
606 } |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
607 } |
|
ad3afaaa19c1
implement non-copying contiguous range indexing
Jaroslav Hajek <highegg@gmail.com>
parents:
8503
diff
changeset
|
608 |
| 4517 | 609 void print_info (std::ostream& os, const std::string& prefix) const; |
| 5900 | 610 |
| 611 // Unsafe. This function exists to support the MEX interface. | |
| 612 // You should not use it anywhere else. | |
| 613 void *mex_get_data (void) const { return const_cast<T *> (data ()); } | |
| 7433 | 614 |
| 9725 | 615 Array<T> sort (int dim = 0, sortmode mode = ASCENDING) const; |
| 616 Array<T> sort (Array<octave_idx_type> &sidx, int dim = 0, | |
|
7463
2467639bd8c0
eliminate UNDEFINED sort mode
John W. Eaton <jwe@octave.org>
parents:
7433
diff
changeset
|
617 sortmode mode = ASCENDING) const; |
|
7503
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
618 |
|
8721
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
619 // Ordering is auto-detected or can be specified. |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
620 sortmode is_sorted (sortmode mode = UNSORTED) const; |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
621 |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
622 // Sort by rows returns only indices. |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
623 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
|
624 |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
625 // Ordering is auto-detected or can be specified. |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
626 sortmode is_sorted_rows (sortmode mode = UNSORTED) const; |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
627 |
|
8814
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
628 // Do a binary lookup in a sorted array. |
|
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
629 // 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
|
630 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
|
631 |
|
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
632 // 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
|
633 // 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
|
634 // (indices will be >= 1). |
|
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
635 // 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
|
636 // (indices will be <= length ()-1). |
|
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
637 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
|
638 bool linf = false, bool rinf = false) const; |
|
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
639 |
|
9341
9fd5c56ce57a
extend lookup capabilities
Jaroslav Hajek <highegg@gmail.com>
parents:
9201
diff
changeset
|
640 // 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
|
641 // the value -1. |
|
9fd5c56ce57a
extend lookup capabilities
Jaroslav Hajek <highegg@gmail.com>
parents:
9201
diff
changeset
|
642 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
|
643 |
|
9fd5c56ce57a
extend lookup capabilities
Jaroslav Hajek <highegg@gmail.com>
parents:
9201
diff
changeset
|
644 // This looks up only exact matches, returning true/false if match. |
|
9fd5c56ce57a
extend lookup capabilities
Jaroslav Hajek <highegg@gmail.com>
parents:
9201
diff
changeset
|
645 Array<bool> lookupb (const Array<T>& values, sortmode mode = UNSORTED) const; |
|
9fd5c56ce57a
extend lookup capabilities
Jaroslav Hajek <highegg@gmail.com>
parents:
9201
diff
changeset
|
646 |
| 9025 | 647 // Find indices of (at most n) nonzero elements. If n is specified, backward |
| 648 // specifies search from backward. | |
| 649 Array<octave_idx_type> find (octave_idx_type n = -1, bool backward = false) const; | |
| 650 | |
| 9725 | 651 // Returns the n-th element in increasing order, using the same ordering as |
| 652 // used for sort. n can either be a scalar index or a contiguous range. | |
| 653 Array<T> nth_element (const idx_vector& n, int dim = 0) const; | |
| 654 | |
|
7620
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7503
diff
changeset
|
655 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
|
656 |
|
7503
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
657 template <class U, class F> |
|
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
658 Array<U> |
|
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
659 map (F fcn) const |
|
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
660 { |
|
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
661 octave_idx_type len = length (); |
|
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
662 |
|
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
663 const T *m = data (); |
|
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
664 |
|
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
665 Array<U> result (dims ()); |
|
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
666 U *p = result.fortran_vec (); |
|
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
667 |
|
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
668 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
|
669 { |
|
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
670 OCTAVE_QUIT; |
|
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
671 |
|
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
672 p[i] = fcn (m[i]); |
|
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
673 } |
|
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
674 |
|
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
675 return result; |
|
8c32f95c2639
convert mapper functions to new format
David Bateman <dbateman@free.fr>
parents:
7463
diff
changeset
|
676 } |
|
8998
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
677 |
|
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
678 // 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
|
679 // 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
|
680 // to be OK with recent GCC. |
|
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
681 template <class U> |
|
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
682 Array<U> |
|
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
683 fastmap (U (*fcn) (typename ref_param<T>::type)) const |
|
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
684 { |
|
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
685 octave_idx_type len = length (); |
|
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
686 |
|
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
687 const T *m = data (); |
|
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
688 |
|
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
689 Array<U> result (dims ()); |
|
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
690 U *p = result.fortran_vec (); |
|
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
691 |
|
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
692 std::transform (m, m + len, p, fcn); |
|
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
693 |
|
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
694 return result; |
|
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
695 } |
|
a48fba01e4ac
optimize isnan/isinf/isfinite mappers
Jaroslav Hajek <highegg@gmail.com>
parents:
8950
diff
changeset
|
696 |
|
9046
88bf56bbccca
make Array::find already return Matlab-compatible dimensions
Jaroslav Hajek <highegg@gmail.com>
parents:
9026
diff
changeset
|
697 template <class U> friend class Array; |
|
9201
472f0e22aa60
guard against implicit instantiation
Jaroslav Hajek <highegg@gmail.com>
parents:
9046
diff
changeset
|
698 |
|
472f0e22aa60
guard against implicit instantiation
Jaroslav Hajek <highegg@gmail.com>
parents:
9046
diff
changeset
|
699 private: |
|
472f0e22aa60
guard against implicit instantiation
Jaroslav Hajek <highegg@gmail.com>
parents:
9046
diff
changeset
|
700 static void instantiation_guard (); |
| 4513 | 701 }; |
| 4459 | 702 |
|
9653
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
703 // This is a simple wrapper template that will subclass an Array<T> type or any |
|
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
704 // later type derived from it and override the default non-const operator() to |
|
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
705 // not check for the array's uniqueness. It is, however, the user's |
|
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
706 // responsibility to ensure the array is actually unaliased whenever elements |
|
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
707 // are accessed. |
|
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
708 |
|
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
709 template<class ArrayClass> |
|
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
710 class NoAlias : public ArrayClass |
|
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
711 { |
|
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
712 typedef typename ArrayClass::element_type T; |
|
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
713 public: |
|
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
714 NoAlias () : ArrayClass () { } |
|
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
715 |
|
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
716 // FIXME: this would be simpler once C++0x is available |
|
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
717 template <class X> |
|
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
718 explicit NoAlias (X x) : ArrayClass (x) { } |
|
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
719 |
|
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
720 template <class X, class Y> |
|
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
721 explicit NoAlias (X x, Y y) : ArrayClass (x, y) { } |
|
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
722 |
|
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
723 template <class X, class Y, class Z> |
|
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
724 explicit NoAlias (X x, Y y, Z z) : ArrayClass (x, y, z) { } |
|
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
725 |
|
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
726 T& operator () (octave_idx_type n) |
|
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
727 { return ArrayClass::xelem (n); } |
|
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
728 T& operator () (octave_idx_type i, octave_idx_type j) |
|
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
729 { return ArrayClass::xelem (i, j); } |
|
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
730 T& operator () (octave_idx_type i, octave_idx_type j, octave_idx_type k) |
|
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
731 { return ArrayClass::xelem (i, j, k); } |
|
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
732 T& operator () (const Array<octave_idx_type>& ra_idx) |
|
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
733 { return ArrayClass::xelem (ra_idx); } |
|
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
734 }; |
|
e087d7c77ff9
improve linspace in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9624
diff
changeset
|
735 |
| 228 | 736 #endif |
| 737 | |
| 738 /* | |
| 739 ;;; Local Variables: *** | |
| 740 ;;; mode: C++ *** | |
| 741 ;;; End: *** | |
| 742 */ |