Mercurial > hg > octave-lyh
annotate liboctave/oct-sort.h @ 11449:93b8c7ca211f
isa.m: Add tests against logical types
| author | Rik <octave@nomad.inbox5.com> |
|---|---|
| date | Wed, 05 Jan 2011 21:21:37 -0800 |
| parents | 4d1fc073fbb7 |
| children | 331fcc41ca23 |
| rev | line source |
|---|---|
| 4851 | 1 /* |
| 8920 | 2 Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009 David Bateman |
|
10521
4d1fc073fbb7
add some missing copyright stmts
Jaroslav Hajek <highegg@gmail.com>
parents:
10312
diff
changeset
|
3 Copyright (C) 2009, 2010 VZLU Prague |
| 4851 | 4 |
| 5 This file is part of Octave. | |
| 6 | |
| 7 Octave is free software; you can redistribute it and/or modify it | |
| 8 under the terms of the GNU General Public License as published by the | |
| 7016 | 9 Free Software Foundation; either version 3 of the License, or (at your |
| 10 option) any later version. | |
| 4851 | 11 |
| 12 Octave is distributed in the hope that it will be useful, but WITHOUT | |
| 13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| 14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
| 15 for more details. | |
| 16 | |
| 17 You should have received a copy of the GNU General Public License | |
| 7016 | 18 along with Octave; see the file COPYING. If not, see |
| 19 <http://www.gnu.org/licenses/>. | |
| 4851 | 20 |
| 21 Code stolen in large part from Python's, listobject.c, which itself had | |
| 22 no license header. However, thanks to Tim Peters for the parts of the | |
| 23 code I ripped-off. | |
| 24 | |
| 25 As required in the Python license the short description of the changes | |
| 26 made are | |
| 27 | |
| 28 * convert the sorting code in listobject.cc into a generic class, | |
| 29 replacing PyObject* with the type of the class T. | |
| 30 | |
| 31 The Python license is | |
| 32 | |
| 33 PSF LICENSE AGREEMENT FOR PYTHON 2.3 | |
| 34 -------------------------------------- | |
| 35 | |
| 36 1. This LICENSE AGREEMENT is between the Python Software Foundation | |
| 37 ("PSF"), and the Individual or Organization ("Licensee") accessing and | |
| 38 otherwise using Python 2.3 software in source or binary form and its | |
| 39 associated documentation. | |
| 40 | |
| 41 2. Subject to the terms and conditions of this License Agreement, PSF | |
| 42 hereby grants Licensee a nonexclusive, royalty-free, world-wide | |
| 43 license to reproduce, analyze, test, perform and/or display publicly, | |
| 44 prepare derivative works, distribute, and otherwise use Python 2.3 | |
| 45 alone or in any derivative version, provided, however, that PSF's | |
| 46 License Agreement and PSF's notice of copyright, i.e., "Copyright (c) | |
| 47 2001, 2002, 2003 Python Software Foundation; All Rights Reserved" are | |
| 48 retained in Python 2.3 alone or in any derivative version prepared by | |
| 49 Licensee. | |
| 50 | |
| 51 3. In the event Licensee prepares a derivative work that is based on | |
| 52 or incorporates Python 2.3 or any part thereof, and wants to make | |
| 53 the derivative work available to others as provided herein, then | |
| 54 Licensee hereby agrees to include in any such work a brief summary of | |
| 55 the changes made to Python 2.3. | |
| 56 | |
| 57 4. PSF is making Python 2.3 available to Licensee on an "AS IS" | |
| 58 basis. PSF MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR | |
| 59 IMPLIED. BY WAY OF EXAMPLE, BUT NOT LIMITATION, PSF MAKES NO AND | |
| 60 DISCLAIMS ANY REPRESENTATION OR WARRANTY OF MERCHANTABILITY OR FITNESS | |
| 61 FOR ANY PARTICULAR PURPOSE OR THAT THE USE OF PYTHON 2.3 WILL NOT | |
| 62 INFRINGE ANY THIRD PARTY RIGHTS. | |
| 63 | |
| 64 5. PSF SHALL NOT BE LIABLE TO LICENSEE OR ANY OTHER USERS OF PYTHON | |
| 65 2.3 FOR ANY INCIDENTAL, SPECIAL, OR CONSEQUENTIAL DAMAGES OR LOSS AS | |
| 66 A RESULT OF MODIFYING, DISTRIBUTING, OR OTHERWISE USING PYTHON 2.3, | |
| 67 OR ANY DERIVATIVE THEREOF, EVEN IF ADVISED OF THE POSSIBILITY THEREOF. | |
| 68 | |
| 69 6. This License Agreement will automatically terminate upon a material | |
| 70 breach of its terms and conditions. | |
| 71 | |
| 72 7. Nothing in this License Agreement shall be deemed to create any | |
| 73 relationship of agency, partnership, or joint venture between PSF and | |
| 74 Licensee. This License Agreement does not grant permission to use PSF | |
| 75 trademarks or trade name in a trademark sense to endorse or promote | |
| 76 products or services of Licensee, or any third party. | |
| 77 | |
| 78 8. By copying, installing or otherwise using Python 2.3, Licensee | |
| 79 agrees to be bound by the terms and conditions of this License | |
| 80 Agreement. | |
| 81 */ | |
| 82 | |
| 83 #if !defined (octave_sort_h) | |
| 84 #define octave_sort_h 1 | |
| 85 | |
| 8725 | 86 #include "lo-traits.h" |
| 87 | |
| 7234 | 88 // The maximum number of entries in a MergeState's pending-runs stack. |
| 89 // This is enough to sort arrays of size up to about | |
| 90 // 32 * phi ** MAX_MERGE_PENDING | |
| 91 // where phi ~= 1.618. 85 is ridiculously large enough, good for an array | |
| 92 // with 2**64 elements. | |
| 4851 | 93 #define MAX_MERGE_PENDING 85 |
| 94 | |
| 7234 | 95 // When we get into galloping mode, we stay there until both runs win less |
| 96 // often than MIN_GALLOP consecutive times. See listsort.txt for more info. | |
| 4851 | 97 #define MIN_GALLOP 7 |
| 98 | |
| 7234 | 99 // Avoid malloc for small temp arrays. |
| 4851 | 100 #define MERGESTATE_TEMP_SIZE 1024 |
| 101 | |
| 7433 | 102 // Enum for type of sort function |
|
8721
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
103 enum sortmode { UNSORTED = 0, ASCENDING, DESCENDING }; |
| 7433 | 104 |
| 4851 | 105 template <class T> |
| 106 class | |
| 107 octave_sort | |
| 108 { | |
| 4998 | 109 public: |
| 110 | |
| 8725 | 111 typedef bool (*compare_fcn_type) (typename ref_param<T>::type, |
|
10312
cbc402e64d83
untabify liboctave header files
John W. Eaton <jwe@octave.org>
parents:
10158
diff
changeset
|
112 typename ref_param<T>::type); |
| 8725 | 113 |
| 4851 | 114 octave_sort (void); |
| 115 | |
| 8725 | 116 octave_sort (compare_fcn_type); |
| 4851 | 117 |
|
8814
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
118 ~octave_sort (void); |
| 4998 | 119 |
| 8725 | 120 void set_compare (compare_fcn_type comp) { compare = comp; } |
| 4851 | 121 |
|
8721
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
122 void set_compare (sortmode mode); |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
123 |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
124 // Sort an array in-place. |
| 8700 | 125 void sort (T *data, octave_idx_type nel); |
| 126 | |
|
8721
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
127 // Ditto, but also permute the passed indices (may not be valid indices). |
| 8700 | 128 void sort (T *data, octave_idx_type *idx, octave_idx_type nel); |
| 129 | |
|
8721
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
130 // Check whether an array is sorted. |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
131 bool is_sorted (const T *data, octave_idx_type nel); |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
132 |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
133 // Sort a matrix by rows, return a permutation |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
134 // vector. |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
135 void sort_rows (const T *data, octave_idx_type *idx, |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
136 octave_idx_type rows, octave_idx_type cols); |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
137 |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
138 // Determine whether a matrix (as a contiguous block) is sorted by rows. |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
139 bool is_sorted_rows (const T *data, |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
140 octave_idx_type rows, octave_idx_type cols); |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
141 |
|
8814
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
142 // Do a binary lookup in a sorted array. |
|
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
143 octave_idx_type lookup (const T *data, octave_idx_type nel, |
|
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
144 const T& value); |
|
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
145 |
|
9921
7c8392a034e6
fix & improve lookup API
Jaroslav Hajek <highegg@gmail.com>
parents:
9725
diff
changeset
|
146 // Ditto, but for an array. |
|
8814
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
147 void lookup (const T *data, octave_idx_type nel, |
|
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
148 const T* values, octave_idx_type nvalues, |
|
9921
7c8392a034e6
fix & improve lookup API
Jaroslav Hajek <highegg@gmail.com>
parents:
9725
diff
changeset
|
149 octave_idx_type *idx); |
|
8814
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
150 |
|
9921
7c8392a034e6
fix & improve lookup API
Jaroslav Hajek <highegg@gmail.com>
parents:
9725
diff
changeset
|
151 // A linear merge of two sorted tables. rev indicates the second table is |
|
7c8392a034e6
fix & improve lookup API
Jaroslav Hajek <highegg@gmail.com>
parents:
9725
diff
changeset
|
152 // in reverse order. |
|
7c8392a034e6
fix & improve lookup API
Jaroslav Hajek <highegg@gmail.com>
parents:
9725
diff
changeset
|
153 void lookup_sorted (const T *data, octave_idx_type nel, |
|
7c8392a034e6
fix & improve lookup API
Jaroslav Hajek <highegg@gmail.com>
parents:
9725
diff
changeset
|
154 const T* values, octave_idx_type nvalues, |
|
7c8392a034e6
fix & improve lookup API
Jaroslav Hajek <highegg@gmail.com>
parents:
9725
diff
changeset
|
155 octave_idx_type *idx, bool rev = false); |
|
9341
9fd5c56ce57a
extend lookup capabilities
Jaroslav Hajek <highegg@gmail.com>
parents:
8920
diff
changeset
|
156 |
| 9725 | 157 // Rearranges the array so that the elements with indices |
| 158 // lo..up-1 are in their correct place. | |
| 159 void nth_element (T *data, octave_idx_type nel, | |
| 160 octave_idx_type lo, octave_idx_type up = -1); | |
| 161 | |
| 8725 | 162 static bool ascending_compare (typename ref_param<T>::type, |
|
10312
cbc402e64d83
untabify liboctave header files
John W. Eaton <jwe@octave.org>
parents:
10158
diff
changeset
|
163 typename ref_param<T>::type); |
| 8725 | 164 |
| 165 static bool descending_compare (typename ref_param<T>::type, | |
|
10312
cbc402e64d83
untabify liboctave header files
John W. Eaton <jwe@octave.org>
parents:
10158
diff
changeset
|
166 typename ref_param<T>::type); |
| 4851 | 167 |
| 4998 | 168 private: |
| 169 | |
| 7234 | 170 // One MergeState exists on the stack per invocation of mergesort. |
| 171 // It's just a convenient way to pass state around among the helper | |
| 172 // functions. | |
| 173 // | |
| 174 // DGB: This isn't needed with mergesort in a class, but it doesn't | |
| 175 // slow things up, and it is likely to make my life easier for any | |
| 176 // potential backporting of changes in the Python code. | |
| 4851 | 177 |
| 178 struct s_slice | |
| 179 { | |
| 8700 | 180 octave_idx_type base, len; |
| 4851 | 181 }; |
| 182 | |
| 7234 | 183 struct MergeState |
| 4851 | 184 { |
|
8820
89b95972e178
fix previously introduced problem in octave_sort, improve design
Jaroslav Hajek <highegg@gmail.com>
parents:
8814
diff
changeset
|
185 MergeState (void) |
|
89b95972e178
fix previously introduced problem in octave_sort, improve design
Jaroslav Hajek <highegg@gmail.com>
parents:
8814
diff
changeset
|
186 : a (0), ia (0), alloced (0) |
|
89b95972e178
fix previously introduced problem in octave_sort, improve design
Jaroslav Hajek <highegg@gmail.com>
parents:
8814
diff
changeset
|
187 { reset (); } |
|
89b95972e178
fix previously introduced problem in octave_sort, improve design
Jaroslav Hajek <highegg@gmail.com>
parents:
8814
diff
changeset
|
188 |
|
89b95972e178
fix previously introduced problem in octave_sort, improve design
Jaroslav Hajek <highegg@gmail.com>
parents:
8814
diff
changeset
|
189 ~MergeState (void) |
|
89b95972e178
fix previously introduced problem in octave_sort, improve design
Jaroslav Hajek <highegg@gmail.com>
parents:
8814
diff
changeset
|
190 { delete [] a; delete [] ia; } |
|
89b95972e178
fix previously introduced problem in octave_sort, improve design
Jaroslav Hajek <highegg@gmail.com>
parents:
8814
diff
changeset
|
191 |
|
89b95972e178
fix previously introduced problem in octave_sort, improve design
Jaroslav Hajek <highegg@gmail.com>
parents:
8814
diff
changeset
|
192 void reset (void) |
|
89b95972e178
fix previously introduced problem in octave_sort, improve design
Jaroslav Hajek <highegg@gmail.com>
parents:
8814
diff
changeset
|
193 { min_gallop = MIN_GALLOP; n = 0; } |
|
89b95972e178
fix previously introduced problem in octave_sort, improve design
Jaroslav Hajek <highegg@gmail.com>
parents:
8814
diff
changeset
|
194 |
|
89b95972e178
fix previously introduced problem in octave_sort, improve design
Jaroslav Hajek <highegg@gmail.com>
parents:
8814
diff
changeset
|
195 void getmem (octave_idx_type need); |
|
89b95972e178
fix previously introduced problem in octave_sort, improve design
Jaroslav Hajek <highegg@gmail.com>
parents:
8814
diff
changeset
|
196 |
|
89b95972e178
fix previously introduced problem in octave_sort, improve design
Jaroslav Hajek <highegg@gmail.com>
parents:
8814
diff
changeset
|
197 void getmemi (octave_idx_type need); |
|
89b95972e178
fix previously introduced problem in octave_sort, improve design
Jaroslav Hajek <highegg@gmail.com>
parents:
8814
diff
changeset
|
198 |
| 7234 | 199 // This controls when we get *into* galloping mode. It's |
| 200 // initialized to MIN_GALLOP. merge_lo and merge_hi tend to nudge | |
| 201 // it higher for random data, and lower for highly structured | |
| 202 // data. | |
| 7433 | 203 octave_idx_type min_gallop; |
| 4851 | 204 |
| 7234 | 205 // 'a' is temp storage to help with merges. It contains room for |
| 206 // alloced entries. | |
| 207 T *a; // may point to temparray below | |
| 8700 | 208 octave_idx_type *ia; |
| 7433 | 209 octave_idx_type alloced; |
| 4851 | 210 |
| 7234 | 211 // A stack of n pending runs yet to be merged. Run #i starts at |
| 212 // address base[i] and extends for len[i] elements. It's always | |
| 213 // true (so long as the indices are in bounds) that | |
| 214 // | |
| 215 // pending[i].base + pending[i].len == pending[i+1].base | |
| 216 // | |
| 217 // so we could cut the storage for this, but it's a minor amount, | |
| 218 // and keeping all the info explicit simplifies the code. | |
| 7433 | 219 octave_idx_type n; |
| 4851 | 220 struct s_slice pending[MAX_MERGE_PENDING]; |
| 7234 | 221 }; |
| 4851 | 222 |
| 8725 | 223 compare_fcn_type compare; |
| 4851 | 224 |
|
8814
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
225 MergeState *ms; |
| 4851 | 226 |
| 8700 | 227 |
| 228 template <class Comp> | |
| 229 void binarysort (T *data, octave_idx_type nel, | |
| 230 octave_idx_type start, Comp comp); | |
| 231 | |
| 232 template <class Comp> | |
| 233 void binarysort (T *data, octave_idx_type *idx, octave_idx_type nel, | |
| 234 octave_idx_type start, Comp comp); | |
| 4851 | 235 |
| 8700 | 236 template <class Comp> |
| 237 octave_idx_type count_run (T *lo, octave_idx_type n, bool& descending, Comp comp); | |
| 4851 | 238 |
| 8700 | 239 template <class Comp> |
| 240 octave_idx_type gallop_left (T key, T *a, octave_idx_type n, octave_idx_type hint, | |
| 241 Comp comp); | |
| 4851 | 242 |
| 8700 | 243 template <class Comp> |
| 244 octave_idx_type gallop_right (T key, T *a, octave_idx_type n, octave_idx_type hint, | |
| 245 Comp comp); | |
| 4851 | 246 |
| 8700 | 247 template <class Comp> |
| 248 int merge_lo (T *pa, octave_idx_type na, | |
| 249 T *pb, octave_idx_type nb, | |
| 250 Comp comp); | |
| 4851 | 251 |
| 8700 | 252 template <class Comp> |
| 253 int merge_lo (T *pa, octave_idx_type *ipa, octave_idx_type na, | |
| 254 T *pb, octave_idx_type *ipb, octave_idx_type nb, | |
| 255 Comp comp); | |
| 256 | |
| 257 template <class Comp> | |
| 258 int merge_hi (T *pa, octave_idx_type na, | |
| 259 T *pb, octave_idx_type nb, | |
| 260 Comp comp); | |
| 4851 | 261 |
| 8700 | 262 template <class Comp> |
| 263 int merge_hi (T *pa, octave_idx_type *ipa, octave_idx_type na, | |
| 264 T *pb, octave_idx_type *ipb, octave_idx_type nb, | |
| 265 Comp comp); | |
| 266 | |
| 267 template <class Comp> | |
| 268 int merge_at (octave_idx_type i, T *data, | |
| 269 Comp comp); | |
| 4851 | 270 |
| 8700 | 271 template <class Comp> |
| 272 int merge_at (octave_idx_type i, T *data, octave_idx_type *idx, | |
| 273 Comp comp); | |
| 274 | |
| 275 template <class Comp> | |
| 276 int merge_collapse (T *data, Comp comp); | |
| 4851 | 277 |
| 8700 | 278 template <class Comp> |
| 279 int merge_collapse (T *data, octave_idx_type *idx, Comp comp); | |
| 280 | |
| 281 template <class Comp> | |
| 282 int merge_force_collapse (T *data, Comp comp); | |
| 283 | |
| 284 template <class Comp> | |
| 285 int merge_force_collapse (T *data, octave_idx_type *idx, Comp comp); | |
| 4851 | 286 |
| 7433 | 287 octave_idx_type merge_compute_minrun (octave_idx_type n); |
| 8700 | 288 |
| 289 template <class Comp> | |
| 290 void sort (T *data, octave_idx_type nel, Comp comp); | |
| 291 | |
| 292 template <class Comp> | |
| 293 void sort (T *data, octave_idx_type *idx, octave_idx_type nel, Comp comp); | |
| 294 | |
|
8721
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
295 template <class Comp> |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
296 bool is_sorted (const T *data, octave_idx_type nel, Comp comp); |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
297 |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
298 template <class Comp> |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
299 void sort_rows (const T *data, octave_idx_type *idx, |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
300 octave_idx_type rows, octave_idx_type cols, |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
301 Comp comp); |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
302 |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
303 template <class Comp> |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
304 bool is_sorted_rows (const T *data, octave_idx_type rows, |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
305 octave_idx_type cols, Comp comp); |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8700
diff
changeset
|
306 |
|
8814
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
307 template <class Comp> |
|
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
308 octave_idx_type lookup (const T *data, octave_idx_type nel, |
|
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
309 const T& value, Comp comp); |
|
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
310 |
|
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
311 template <class Comp> |
|
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
312 void lookup (const T *data, octave_idx_type nel, |
|
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
313 const T* values, octave_idx_type nvalues, |
|
9921
7c8392a034e6
fix & improve lookup API
Jaroslav Hajek <highegg@gmail.com>
parents:
9725
diff
changeset
|
314 octave_idx_type *idx, Comp comp); |
|
8814
de16ebeef93d
improve lookup, provide Array<T>::lookup
Jaroslav Hajek <highegg@gmail.com>
parents:
8725
diff
changeset
|
315 |
|
9341
9fd5c56ce57a
extend lookup capabilities
Jaroslav Hajek <highegg@gmail.com>
parents:
8920
diff
changeset
|
316 template <class Comp> |
|
9921
7c8392a034e6
fix & improve lookup API
Jaroslav Hajek <highegg@gmail.com>
parents:
9725
diff
changeset
|
317 void lookup_sorted (const T *data, octave_idx_type nel, |
|
7c8392a034e6
fix & improve lookup API
Jaroslav Hajek <highegg@gmail.com>
parents:
9725
diff
changeset
|
318 const T* values, octave_idx_type nvalues, |
|
7c8392a034e6
fix & improve lookup API
Jaroslav Hajek <highegg@gmail.com>
parents:
9725
diff
changeset
|
319 octave_idx_type *idx, bool rev, Comp comp); |
| 9725 | 320 |
| 321 template <class Comp> | |
| 322 void nth_element (T *data, octave_idx_type nel, | |
| 323 octave_idx_type lo, octave_idx_type up, | |
| 324 Comp comp); | |
| 4851 | 325 }; |
| 326 | |
| 7433 | 327 template <class T> |
| 328 class | |
| 329 vec_index | |
| 330 { | |
| 331 public: | |
| 332 T vec; | |
| 333 octave_idx_type indx; | |
| 334 }; | |
| 4851 | 335 #endif |