Mercurial > octave-nkf
annotate liboctave/Range.cc @ 10158:4c0cdbe0acca
remove Emacs local-variable settings from liboctave source files
| author | John W. Eaton <jwe@octave.org> |
|---|---|
| date | Wed, 20 Jan 2010 19:04:35 -0500 |
| parents | 672e1b49e01e |
| children | 07ebe522dac2 |
| rev | line source |
|---|---|
| 3 | 1 /* |
| 2 | |
| 7017 | 3 Copyright (C) 1993, 1994, 1995, 1996, 1997, 2000, 2001, 2002, 2004, |
| 8920 | 4 2005, 2007, 2008, 2009 John W. Eaton |
| 3 | 5 |
| 6 This file is part of Octave. | |
| 7 | |
| 8 Octave is free software; you can redistribute it and/or modify it | |
| 9 under the terms of the GNU General Public License as published by the | |
| 7016 | 10 Free Software Foundation; either version 3 of the License, or (at your |
| 11 option) any later version. | |
| 3 | 12 |
| 13 Octave is distributed in the hope that it will be useful, but WITHOUT | |
| 14 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| 15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
| 16 for more details. | |
| 17 | |
| 18 You should have received a copy of the GNU General Public License | |
| 7016 | 19 along with Octave; see the file COPYING. If not, see |
| 20 <http://www.gnu.org/licenses/>. | |
| 3 | 21 |
| 22 */ | |
| 23 | |
| 238 | 24 #ifdef HAVE_CONFIG_H |
| 1192 | 25 #include <config.h> |
| 3 | 26 #endif |
| 27 | |
| 1546 | 28 #include <cfloat> |
| 1367 | 29 |
| 3503 | 30 #include <iostream> |
| 6490 | 31 #include <limits> |
| 3 | 32 |
| 33 #include "Range.h" | |
| 7458 | 34 #include "lo-error.h" |
| 2383 | 35 #include "lo-mappers.h" |
| 7231 | 36 #include "lo-math.h" |
| 2383 | 37 #include "lo-utils.h" |
| 38 | |
| 8971 | 39 Range::Range (double b, double i, octave_idx_type n) |
| 40 : rng_base (b), rng_limit (b + n * i), rng_inc (i), | |
| 41 rng_nelem (n), cache () | |
| 42 { | |
| 43 if (! xfinite (b) || ! xfinite (i)) | |
| 44 rng_nelem = -2; | |
| 45 } | |
| 46 | |
| 2383 | 47 bool |
| 48 Range::all_elements_are_ints (void) const | |
| 49 { | |
| 50 // If the base and increment are ints, the final value in the range | |
| 6457 | 51 // will also be an integer, even if the limit is not. If there is one |
| 52 // or fewer elements only the base needs to be an integer | |
| 2383 | 53 |
| 54 return (! (xisnan (rng_base) || xisnan (rng_inc)) | |
| 6457 | 55 && (NINTbig (rng_base) == rng_base || rng_nelem < 1) |
| 56 && (NINTbig (rng_inc) == rng_inc || rng_nelem <= 1)); | |
| 2383 | 57 } |
| 645 | 58 |
| 59 Matrix | |
| 60 Range::matrix_value (void) const | |
| 61 { | |
| 8971 | 62 if (rng_nelem > 0 && cache.nelem () == 0) |
| 645 | 63 { |
| 4810 | 64 cache.resize (1, rng_nelem); |
| 645 | 65 double b = rng_base; |
| 66 double increment = rng_inc; | |
| 5275 | 67 for (octave_idx_type i = 0; i < rng_nelem; i++) |
| 4810 | 68 cache(i) = b + i * increment; |
| 4791 | 69 |
| 70 // On some machines (x86 with extended precision floating point | |
| 71 // arithmetic, for example) it is possible that we can overshoot | |
| 72 // the limit by approximately the machine precision even though | |
| 73 // we were very careful in our calculation of the number of | |
| 74 // elements. | |
| 75 | |
| 4810 | 76 if ((rng_inc > 0 && cache(rng_nelem-1) > rng_limit) |
| 77 || (rng_inc < 0 && cache(rng_nelem-1) < rng_limit)) | |
| 78 cache(rng_nelem-1) = rng_limit; | |
| 645 | 79 } |
| 80 | |
| 4810 | 81 return cache; |
| 645 | 82 } |
| 3 | 83 |
|
9986
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
84 double |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
85 Range::checkelem (octave_idx_type i) const |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
86 { |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
87 if (i < 0 || i >= rng_nelem) |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
88 (*current_liboctave_error_handler) ("Range::elem (%d): range error", i); |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
89 |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
90 return rng_base + rng_inc * i; |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
91 } |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
92 |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
93 struct _rangeidx_helper |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
94 { |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
95 double *array, base, inc; |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
96 _rangeidx_helper (double *a, double b, double i) |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
97 : array (a), base (b), inc (i) { } |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
98 void operator () (octave_idx_type i) |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
99 { *array++ = base + i * inc; } |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
100 }; |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
101 |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
102 Array<double> |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
103 Range::index (const idx_vector& i) const |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
104 { |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
105 Array<double> retval; |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
106 |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
107 octave_idx_type n = rng_nelem; |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
108 |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
109 if (i.is_colon ()) |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
110 { |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
111 retval = matrix_value ().reshape (dim_vector (rng_nelem, 1)); |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
112 } |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
113 else if (i.extent (n) != n) |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
114 { |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
115 (*current_liboctave_error_handler) |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
116 ("A(I): Index exceeds matrix dimension."); |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
117 } |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
118 else |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
119 { |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
120 dim_vector rd = i.orig_dimensions (); |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
121 octave_idx_type il = i.length (n); |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
122 |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
123 // taken from Array.cc. |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
124 |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
125 if (n != 1 && rd.is_vector ()) |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
126 rd = dim_vector (1, il); |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
127 |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
128 retval.clear (rd); |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
129 |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
130 i.loop (n, _rangeidx_helper (retval.fortran_vec (), rng_base, rng_inc)); |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
131 } |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
132 |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
133 return retval; |
|
672e1b49e01e
optimize indexing of ranges by single subscripts
Jaroslav Hajek <highegg@gmail.com>
parents:
8971
diff
changeset
|
134 } |
| 4810 | 135 |
| 208 | 136 // NOTE: max and min only return useful values if nelem > 0. |
| 137 | |
| 138 double | |
| 139 Range::min (void) const | |
| 140 { | |
| 141 double retval = 0.0; | |
| 142 if (rng_nelem > 0) | |
| 143 { | |
| 144 if (rng_inc > 0) | |
| 145 retval = rng_base; | |
| 146 else | |
| 4791 | 147 { |
| 148 retval = rng_base + (rng_nelem - 1) * rng_inc; | |
| 149 | |
| 150 // See the note in the matrix_value method above. | |
| 151 | |
| 152 if (retval < rng_limit) | |
| 153 retval = rng_limit; | |
| 154 } | |
| 155 | |
| 208 | 156 } |
| 157 return retval; | |
| 158 } | |
| 159 | |
| 160 double | |
| 161 Range::max (void) const | |
| 162 { | |
| 163 double retval = 0.0; | |
| 164 if (rng_nelem > 0) | |
| 165 { | |
| 166 if (rng_inc > 0) | |
| 4791 | 167 { |
| 168 retval = rng_base + (rng_nelem - 1) * rng_inc; | |
| 169 | |
| 170 // See the note in the matrix_value method above. | |
| 171 | |
| 172 if (retval > rng_limit) | |
| 173 retval = rng_limit; | |
| 174 } | |
| 208 | 175 else |
| 176 retval = rng_base; | |
| 177 } | |
| 178 return retval; | |
| 179 } | |
| 180 | |
| 181 void | |
| 7458 | 182 Range::sort_internal (bool ascending) |
| 208 | 183 { |
| 7458 | 184 if (ascending && rng_base > rng_limit && rng_inc < 0.0) |
| 208 | 185 { |
| 186 double tmp = rng_base; | |
| 187 rng_base = min (); | |
| 188 rng_limit = tmp; | |
| 189 rng_inc = -rng_inc; | |
| 4811 | 190 clear_cache (); |
| 208 | 191 } |
| 8565 | 192 else if (! ascending && rng_base < rng_limit && rng_inc > 0.0) |
| 7458 | 193 { |
| 194 double tmp = rng_limit; | |
| 195 rng_limit = min (); | |
| 196 rng_base = tmp; | |
| 197 rng_inc = -rng_inc; | |
| 198 clear_cache (); | |
| 199 } | |
| 200 } | |
| 201 | |
| 202 void | |
| 203 Range::sort_internal (Array<octave_idx_type>& sidx, bool ascending) | |
| 204 { | |
| 205 octave_idx_type nel = nelem (); | |
| 206 | |
| 207 sidx.resize (dim_vector (1, nel)); | |
| 208 | |
| 209 octave_idx_type *psidx = sidx.fortran_vec (); | |
| 210 | |
| 211 bool reverse = false; | |
| 212 | |
| 213 if (ascending && rng_base > rng_limit && rng_inc < 0.0) | |
| 214 { | |
| 215 double tmp = rng_base; | |
| 216 rng_base = min (); | |
| 217 rng_limit = tmp; | |
| 218 rng_inc = -rng_inc; | |
| 219 clear_cache (); | |
| 220 reverse = true; | |
| 221 } | |
| 222 else if (! ascending && rng_base < rng_limit && rng_inc > 0.0) | |
| 223 { | |
| 224 double tmp = rng_limit; | |
| 225 rng_limit = min (); | |
| 226 rng_base = tmp; | |
| 227 rng_inc = -rng_inc; | |
| 228 clear_cache (); | |
| 229 reverse = true; | |
| 230 } | |
| 231 | |
| 232 octave_idx_type tmp = reverse ? nel - 1 : 0; | |
| 7467 | 233 octave_idx_type stp = reverse ? -1 : 1; |
| 7458 | 234 |
| 7467 | 235 for (octave_idx_type i = 0; i < nel; i++, tmp += stp) |
| 7458 | 236 psidx[i] = tmp; |
| 237 | |
| 238 } | |
| 239 | |
|
7620
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7467
diff
changeset
|
240 Matrix |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7467
diff
changeset
|
241 Range::diag (octave_idx_type k) const |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7467
diff
changeset
|
242 { |
| 8971 | 243 return matrix_value ().diag (k); |
|
7620
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7467
diff
changeset
|
244 } |
|
36594d5bbe13
Move diag function into the octave_value class
David Bateman <dbateman@free.fr>
parents:
7467
diff
changeset
|
245 |
| 7458 | 246 Range |
| 247 Range::sort (octave_idx_type dim, sortmode mode) const | |
| 248 { | |
| 249 Range retval = *this; | |
| 250 | |
| 251 if (dim == 1) | |
| 252 { | |
|
7463
2467639bd8c0
eliminate UNDEFINED sort mode
John W. Eaton <jwe@octave.org>
parents:
7458
diff
changeset
|
253 if (mode == ASCENDING) |
|
2467639bd8c0
eliminate UNDEFINED sort mode
John W. Eaton <jwe@octave.org>
parents:
7458
diff
changeset
|
254 retval.sort_internal (true); |
|
2467639bd8c0
eliminate UNDEFINED sort mode
John W. Eaton <jwe@octave.org>
parents:
7458
diff
changeset
|
255 else if (mode == DESCENDING) |
|
2467639bd8c0
eliminate UNDEFINED sort mode
John W. Eaton <jwe@octave.org>
parents:
7458
diff
changeset
|
256 retval.sort_internal (false); |
| 7458 | 257 } |
| 258 else if (dim != 0) | |
| 259 (*current_liboctave_error_handler) ("Range::sort: invalid dimension"); | |
| 260 | |
| 261 return retval; | |
| 262 } | |
| 263 | |
| 264 Range | |
| 265 Range::sort (Array<octave_idx_type>& sidx, octave_idx_type dim, | |
| 266 sortmode mode) const | |
| 267 { | |
| 268 Range retval = *this; | |
| 269 | |
| 270 if (dim == 1) | |
| 271 { | |
|
7463
2467639bd8c0
eliminate UNDEFINED sort mode
John W. Eaton <jwe@octave.org>
parents:
7458
diff
changeset
|
272 if (mode == ASCENDING) |
| 7458 | 273 retval.sort_internal (sidx, true); |
|
7463
2467639bd8c0
eliminate UNDEFINED sort mode
John W. Eaton <jwe@octave.org>
parents:
7458
diff
changeset
|
274 else if (mode == DESCENDING) |
|
2467639bd8c0
eliminate UNDEFINED sort mode
John W. Eaton <jwe@octave.org>
parents:
7458
diff
changeset
|
275 retval.sort_internal (sidx, false); |
| 7458 | 276 } |
| 277 else if (dim != 0) | |
| 278 (*current_liboctave_error_handler) ("Range::sort: invalid dimension"); | |
| 279 | |
| 280 return retval; | |
| 208 | 281 } |
| 282 | |
|
8721
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8589
diff
changeset
|
283 sortmode |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8589
diff
changeset
|
284 Range::is_sorted (sortmode mode) const |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8589
diff
changeset
|
285 { |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8589
diff
changeset
|
286 if (rng_nelem > 1 && rng_inc < 0) |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8589
diff
changeset
|
287 mode = (mode == ASCENDING) ? UNSORTED : DESCENDING; |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8589
diff
changeset
|
288 else if (rng_nelem > 1 && rng_inc > 0) |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8589
diff
changeset
|
289 mode = (mode == DESCENDING) ? UNSORTED : ASCENDING; |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8589
diff
changeset
|
290 else |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8589
diff
changeset
|
291 mode = mode ? mode : ASCENDING; |
|
8742
d2b06871afac
add missing return statement
Jaroslav Hajek <highegg@gmail.com>
parents:
8721
diff
changeset
|
292 |
|
d2b06871afac
add missing return statement
Jaroslav Hajek <highegg@gmail.com>
parents:
8721
diff
changeset
|
293 return mode; |
|
8721
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8589
diff
changeset
|
294 } |
|
e9cb742df9eb
imported patch sort3.diff
Jaroslav Hajek <highegg@gmail.com>
parents:
8589
diff
changeset
|
295 |
| 3504 | 296 std::ostream& |
| 297 operator << (std::ostream& os, const Range& a) | |
| 3 | 298 { |
| 299 double b = a.base (); | |
| 300 double increment = a.inc (); | |
| 5275 | 301 octave_idx_type num_elem = a.nelem (); |
| 3 | 302 |
| 5275 | 303 for (octave_idx_type i = 0; i < num_elem-1; i++) |
| 3 | 304 os << b + i * increment << " "; |
| 305 | |
| 4791 | 306 // Prevent overshoot. See comment in the matrix_value method |
| 307 // above. | |
| 308 | |
| 309 os << (increment > 0 ? a.max () : a.min ()) << "\n"; | |
| 3 | 310 |
| 311 return os; | |
| 312 } | |
| 313 | |
| 3504 | 314 std::istream& |
| 315 operator >> (std::istream& is, Range& a) | |
| 3 | 316 { |
| 208 | 317 is >> a.rng_base; |
| 3 | 318 if (is) |
| 319 { | |
| 208 | 320 is >> a.rng_limit; |
| 3 | 321 if (is) |
| 322 { | |
| 208 | 323 is >> a.rng_inc; |
| 324 a.rng_nelem = a.nelem_internal (); | |
| 3 | 325 } |
| 326 } | |
| 327 | |
| 328 return is; | |
| 329 } | |
| 330 | |
| 2599 | 331 Range |
| 332 operator - (const Range& r) | |
| 333 { | |
|
8589
0131fa223dbc
make length invariant in range-scalar ops
Jaroslav Hajek <highegg@gmail.com>
parents:
8565
diff
changeset
|
334 return Range (-r.base (), -r.inc (), r.nelem ()); |
| 2599 | 335 } |
| 336 | |
|
8553
c7ff200e45f5
optimize range-scalar ops
Jaroslav Hajek <highegg@gmail.com>
parents:
7620
diff
changeset
|
337 Range operator + (double x, const Range& r) |
|
c7ff200e45f5
optimize range-scalar ops
Jaroslav Hajek <highegg@gmail.com>
parents:
7620
diff
changeset
|
338 { |
| 8971 | 339 Range result (x + r.base (), r.inc (), r.nelem ()); |
| 340 if (result.rng_nelem < 0) | |
| 341 result.cache = x + r.matrix_value (); | |
| 342 | |
| 343 return result; | |
|
8553
c7ff200e45f5
optimize range-scalar ops
Jaroslav Hajek <highegg@gmail.com>
parents:
7620
diff
changeset
|
344 } |
|
c7ff200e45f5
optimize range-scalar ops
Jaroslav Hajek <highegg@gmail.com>
parents:
7620
diff
changeset
|
345 |
|
c7ff200e45f5
optimize range-scalar ops
Jaroslav Hajek <highegg@gmail.com>
parents:
7620
diff
changeset
|
346 Range operator + (const Range& r, double x) |
|
c7ff200e45f5
optimize range-scalar ops
Jaroslav Hajek <highegg@gmail.com>
parents:
7620
diff
changeset
|
347 { |
| 8971 | 348 Range result (r.base () + x, r.inc (), r.nelem ()); |
| 349 if (result.rng_nelem < 0) | |
| 350 result.cache = r.matrix_value () + x; | |
| 351 | |
| 352 return result; | |
|
8553
c7ff200e45f5
optimize range-scalar ops
Jaroslav Hajek <highegg@gmail.com>
parents:
7620
diff
changeset
|
353 } |
|
c7ff200e45f5
optimize range-scalar ops
Jaroslav Hajek <highegg@gmail.com>
parents:
7620
diff
changeset
|
354 |
|
c7ff200e45f5
optimize range-scalar ops
Jaroslav Hajek <highegg@gmail.com>
parents:
7620
diff
changeset
|
355 Range operator - (double x, const Range& r) |
|
c7ff200e45f5
optimize range-scalar ops
Jaroslav Hajek <highegg@gmail.com>
parents:
7620
diff
changeset
|
356 { |
| 8971 | 357 Range result (x - r.base (), -r.inc (), r.nelem ()); |
| 358 if (result.rng_nelem < 0) | |
| 359 result.cache = x - r.matrix_value (); | |
| 360 | |
| 361 return result; | |
|
8553
c7ff200e45f5
optimize range-scalar ops
Jaroslav Hajek <highegg@gmail.com>
parents:
7620
diff
changeset
|
362 } |
|
c7ff200e45f5
optimize range-scalar ops
Jaroslav Hajek <highegg@gmail.com>
parents:
7620
diff
changeset
|
363 |
|
c7ff200e45f5
optimize range-scalar ops
Jaroslav Hajek <highegg@gmail.com>
parents:
7620
diff
changeset
|
364 Range operator - (const Range& r, double x) |
|
c7ff200e45f5
optimize range-scalar ops
Jaroslav Hajek <highegg@gmail.com>
parents:
7620
diff
changeset
|
365 { |
| 8971 | 366 Range result (r.base () - x, r.inc (), r.nelem ()); |
| 367 if (result.rng_nelem < 0) | |
| 368 result.cache = r.matrix_value () - x; | |
| 369 | |
| 370 return result; | |
|
8553
c7ff200e45f5
optimize range-scalar ops
Jaroslav Hajek <highegg@gmail.com>
parents:
7620
diff
changeset
|
371 } |
|
c7ff200e45f5
optimize range-scalar ops
Jaroslav Hajek <highegg@gmail.com>
parents:
7620
diff
changeset
|
372 |
|
c7ff200e45f5
optimize range-scalar ops
Jaroslav Hajek <highegg@gmail.com>
parents:
7620
diff
changeset
|
373 Range operator * (double x, const Range& r) |
|
c7ff200e45f5
optimize range-scalar ops
Jaroslav Hajek <highegg@gmail.com>
parents:
7620
diff
changeset
|
374 { |
| 8971 | 375 Range result (x * r.base (), x * r.inc (), r.nelem ()); |
| 376 if (result.rng_nelem < 0) | |
| 377 result.cache = x * r.matrix_value (); | |
| 378 | |
| 379 return result; | |
|
8553
c7ff200e45f5
optimize range-scalar ops
Jaroslav Hajek <highegg@gmail.com>
parents:
7620
diff
changeset
|
380 } |
|
c7ff200e45f5
optimize range-scalar ops
Jaroslav Hajek <highegg@gmail.com>
parents:
7620
diff
changeset
|
381 |
|
c7ff200e45f5
optimize range-scalar ops
Jaroslav Hajek <highegg@gmail.com>
parents:
7620
diff
changeset
|
382 Range operator * (const Range& r, double x) |
|
c7ff200e45f5
optimize range-scalar ops
Jaroslav Hajek <highegg@gmail.com>
parents:
7620
diff
changeset
|
383 { |
| 8971 | 384 Range result (r.base () * x, r.inc () * x, r.nelem ()); |
| 385 if (result.rng_nelem < 0) | |
| 386 result.cache = r.matrix_value () * x; | |
| 387 | |
| 388 return result; | |
|
8553
c7ff200e45f5
optimize range-scalar ops
Jaroslav Hajek <highegg@gmail.com>
parents:
7620
diff
changeset
|
389 } |
|
c7ff200e45f5
optimize range-scalar ops
Jaroslav Hajek <highegg@gmail.com>
parents:
7620
diff
changeset
|
390 |
|
c7ff200e45f5
optimize range-scalar ops
Jaroslav Hajek <highegg@gmail.com>
parents:
7620
diff
changeset
|
391 |
| 1546 | 392 // C See Knuth, Art Of Computer Programming, Vol. 1, Problem 1.2.4-5. |
| 393 // C | |
| 394 // C===Tolerant FLOOR function. | |
| 395 // C | |
| 396 // C X - is given as a Double Precision argument to be operated on. | |
| 397 // C It is assumed that X is represented with M mantissa bits. | |
| 398 // C CT - is given as a Comparison Tolerance such that | |
| 399 // C 0.LT.CT.LE.3-SQRT(5)/2. If the relative difference between | |
| 400 // C X and A whole number is less than CT, then TFLOOR is | |
| 401 // C returned as this whole number. By treating the | |
| 402 // C floating-point numbers as a finite ordered set note that | |
| 403 // C the heuristic EPS=2.**(-(M-1)) and CT=3*EPS causes | |
| 404 // C arguments of TFLOOR/TCEIL to be treated as whole numbers | |
| 405 // C if they are exactly whole numbers or are immediately | |
| 406 // C adjacent to whole number representations. Since EPS, the | |
| 407 // C "distance" between floating-point numbers on the unit | |
| 408 // C interval, and M, the number of bits in X'S mantissa, exist | |
| 409 // C on every floating-point computer, TFLOOR/TCEIL are | |
| 410 // C consistently definable on every floating-point computer. | |
| 411 // C | |
| 412 // C For more information see the following references: | |
| 413 // C (1) P. E. Hagerty, "More On Fuzzy Floor And Ceiling," APL QUOTE | |
| 414 // C QUAD 8(4):20-24, June 1978. Note that TFLOOR=FL5. | |
| 415 // C (2) L. M. Breed, "Definitions For Fuzzy Floor And Ceiling", APL | |
| 416 // C QUOTE QUAD 8(3):16-23, March 1978. This paper cites FL1 through | |
| 417 // C FL5, the history of five years of evolutionary development of | |
| 418 // C FL5 - the seven lines of code below - by open collaboration | |
| 419 // C and corroboration of the mathematical-computing community. | |
| 420 // C | |
| 421 // C Penn State University Center for Academic Computing | |
| 422 // C H. D. Knoble - August, 1978. | |
| 423 | |
| 424 static inline double | |
| 425 tfloor (double x, double ct) | |
| 426 { | |
| 427 // C---------FLOOR(X) is the largest integer algebraically less than | |
| 428 // C or equal to X; that is, the unfuzzy FLOOR function. | |
| 429 | |
| 430 // DINT (X) = X - DMOD (X, 1.0); | |
| 431 // FLOOR (X) = DINT (X) - DMOD (2.0 + DSIGN (1.0, X), 3.0); | |
| 432 | |
| 433 // C---------Hagerty's FL5 function follows... | |
| 434 | |
| 435 double q = 1.0; | |
| 436 | |
| 437 if (x < 0.0) | |
| 438 q = 1.0 - ct; | |
| 439 | |
| 440 double rmax = q / (2.0 - ct); | |
| 441 | |
| 442 double t1 = 1.0 + floor (x); | |
| 443 t1 = (ct / q) * (t1 < 0.0 ? -t1 : t1); | |
| 444 t1 = rmax < t1 ? rmax : t1; | |
| 445 t1 = ct > t1 ? ct : t1; | |
| 446 t1 = floor (x + t1); | |
| 447 | |
| 1555 | 448 if (x <= 0.0 || (t1 - x) < rmax) |
| 1546 | 449 return t1; |
| 450 else | |
| 451 return t1 - 1.0; | |
| 452 } | |
| 453 | |
| 454 static inline double | |
| 455 tceil (double x, double ct) | |
| 456 { | |
| 457 return -tfloor (-x, ct); | |
| 458 } | |
| 459 | |
| 3753 | 460 static inline bool |
| 461 teq (double u, double v, double ct = 3.0 * DBL_EPSILON) | |
| 462 { | |
| 463 double tu = fabs (u); | |
| 464 double tv = fabs (v); | |
| 465 | |
| 466 return fabs (u - v) < ((tu > tv ? tu : tv) * ct); | |
| 467 } | |
| 468 | |
| 5275 | 469 octave_idx_type |
| 1360 | 470 Range::nelem_internal (void) const |
| 471 { | |
| 5275 | 472 octave_idx_type retval = -1; |
| 3 | 473 |
| 3858 | 474 if (rng_inc == 0 |
| 475 || (rng_limit > rng_base && rng_inc < 0) | |
| 476 || (rng_limit < rng_base && rng_inc > 0)) | |
| 477 { | |
| 478 retval = 0; | |
| 479 } | |
| 480 else | |
| 481 { | |
| 482 double ct = 3.0 * DBL_EPSILON; | |
| 3 | 483 |
| 3858 | 484 double tmp = tfloor ((rng_limit - rng_base + rng_inc) / rng_inc, ct); |
| 485 | |
| 5275 | 486 octave_idx_type n_elt = (tmp > 0.0 ? static_cast<octave_idx_type> (tmp) : 0); |
| 398 | 487 |
| 3858 | 488 // If the final element that we would compute for the range is |
| 489 // equal to the limit of the range, or is an adjacent floating | |
| 490 // point number, accept it. Otherwise, try a range with one | |
| 491 // fewer element. If that fails, try again with one more | |
| 492 // element. | |
| 493 // | |
| 494 // I'm not sure this is very good, but it seems to work better than | |
| 495 // just using tfloor as above. For example, without it, the | |
| 496 // expression 1.8:0.05:1.9 fails to produce the expected result of | |
| 497 // [1.8, 1.85, 1.9]. | |
| 3753 | 498 |
| 3858 | 499 if (! teq (rng_base + (n_elt - 1) * rng_inc, rng_limit)) |
| 500 { | |
| 501 if (teq (rng_base + (n_elt - 2) * rng_inc, rng_limit)) | |
| 502 n_elt--; | |
| 503 else if (teq (rng_base + n_elt * rng_inc, rng_limit)) | |
| 504 n_elt++; | |
| 505 } | |
| 506 | |
| 6490 | 507 retval = (n_elt >= std::numeric_limits<octave_idx_type>::max () - 1) ? -1 : n_elt; |
| 3753 | 508 } |
| 509 | |
| 3858 | 510 return retval; |
| 3 | 511 } |