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