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