|
3
|
1 /* |
|
|
2 |
|
1882
|
3 Copyright (C) 1996 John W. Eaton |
|
3
|
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 |
|
|
9 Free Software Foundation; either version 2, or (at your option) any |
|
|
10 later version. |
|
|
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 |
|
|
18 along with Octave; see the file COPYING. If not, write to the Free |
|
1315
|
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
|
3
|
20 |
|
|
21 */ |
|
|
22 |
|
1296
|
23 #if defined (__GNUG__) |
|
|
24 #pragma implementation |
|
|
25 #endif |
|
|
26 |
|
238
|
27 #ifdef HAVE_CONFIG_H |
|
1192
|
28 #include <config.h> |
|
3
|
29 #endif |
|
|
30 |
|
1546
|
31 #include <cfloat> |
|
1367
|
32 #include <climits> |
|
1546
|
33 #include <cmath> |
|
1367
|
34 |
|
238
|
35 #include <iostream.h> |
|
3
|
36 |
|
|
37 #include "Range.h" |
|
645
|
38 #include "dMatrix.h" |
|
2383
|
39 #include "lo-mappers.h" |
|
|
40 #include "lo-utils.h" |
|
|
41 |
|
|
42 bool |
|
|
43 Range::all_elements_are_ints (void) const |
|
|
44 { |
|
|
45 // If the base and increment are ints, the final value in the range |
|
|
46 // will also be an integer, even if the limit is not. |
|
|
47 |
|
|
48 return (! (xisnan (rng_base) || xisnan (rng_inc)) |
|
|
49 && (double) NINT (rng_base) == rng_base |
|
|
50 && (double) NINT (rng_inc) == rng_inc); |
|
|
51 } |
|
645
|
52 |
|
|
53 Matrix |
|
|
54 Range::matrix_value (void) const |
|
|
55 { |
|
|
56 Matrix retval; |
|
|
57 |
|
|
58 if (rng_nelem > 0) |
|
|
59 { |
|
|
60 retval.resize (1, rng_nelem); |
|
|
61 double b = rng_base; |
|
|
62 double increment = rng_inc; |
|
|
63 for (int i = 0; i < rng_nelem; i++) |
|
|
64 retval.elem (0, i) = b + i * increment; |
|
|
65 } |
|
|
66 |
|
|
67 return retval; |
|
|
68 } |
|
3
|
69 |
|
208
|
70 // NOTE: max and min only return useful values if nelem > 0. |
|
|
71 |
|
|
72 double |
|
|
73 Range::min (void) const |
|
|
74 { |
|
|
75 double retval = 0.0; |
|
|
76 if (rng_nelem > 0) |
|
|
77 { |
|
|
78 if (rng_inc > 0) |
|
|
79 retval = rng_base; |
|
|
80 else |
|
|
81 retval = rng_base + (rng_nelem - 1) * rng_inc; |
|
|
82 } |
|
|
83 return retval; |
|
|
84 } |
|
|
85 |
|
|
86 double |
|
|
87 Range::max (void) const |
|
|
88 { |
|
|
89 double retval = 0.0; |
|
|
90 if (rng_nelem > 0) |
|
|
91 { |
|
|
92 if (rng_inc > 0) |
|
|
93 retval = rng_base + (rng_nelem - 1) * rng_inc; |
|
|
94 else |
|
|
95 retval = rng_base; |
|
|
96 } |
|
|
97 return retval; |
|
|
98 } |
|
|
99 |
|
|
100 void |
|
|
101 Range::sort (void) |
|
|
102 { |
|
|
103 if (rng_base > rng_limit && rng_inc < 0.0) |
|
|
104 { |
|
|
105 double tmp = rng_base; |
|
|
106 rng_base = min (); |
|
|
107 rng_limit = tmp; |
|
|
108 rng_inc = -rng_inc; |
|
|
109 } |
|
|
110 } |
|
|
111 |
|
3
|
112 void |
|
|
113 Range::print_range (void) |
|
|
114 { |
|
208
|
115 cerr << "Range: rng_base = " << rng_base |
|
|
116 << " rng_limit " << rng_limit |
|
|
117 << " rng_inc " << rng_inc |
|
|
118 << " rng_nelem " << rng_nelem << "\n"; |
|
3
|
119 } |
|
|
120 |
|
|
121 ostream& |
|
|
122 operator << (ostream& os, const Range& a) |
|
|
123 { |
|
|
124 double b = a.base (); |
|
|
125 double increment = a.inc (); |
|
|
126 int num_elem = a.nelem (); |
|
|
127 |
|
|
128 for (int i = 0; i < num_elem; i++) |
|
|
129 os << b + i * increment << " "; |
|
|
130 |
|
|
131 os << "\n"; |
|
|
132 |
|
|
133 return os; |
|
|
134 } |
|
|
135 |
|
|
136 istream& |
|
|
137 operator >> (istream& is, Range& a) |
|
|
138 { |
|
208
|
139 is >> a.rng_base; |
|
3
|
140 if (is) |
|
|
141 { |
|
208
|
142 is >> a.rng_limit; |
|
3
|
143 if (is) |
|
|
144 { |
|
208
|
145 is >> a.rng_inc; |
|
|
146 a.rng_nelem = a.nelem_internal (); |
|
3
|
147 } |
|
|
148 } |
|
|
149 |
|
|
150 return is; |
|
|
151 } |
|
|
152 |
|
1546
|
153 // C See Knuth, Art Of Computer Programming, Vol. 1, Problem 1.2.4-5. |
|
|
154 // C |
|
|
155 // C===Tolerant FLOOR function. |
|
|
156 // C |
|
|
157 // C X - is given as a Double Precision argument to be operated on. |
|
|
158 // C It is assumed that X is represented with M mantissa bits. |
|
|
159 // C CT - is given as a Comparison Tolerance such that |
|
|
160 // C 0.LT.CT.LE.3-SQRT(5)/2. If the relative difference between |
|
|
161 // C X and A whole number is less than CT, then TFLOOR is |
|
|
162 // C returned as this whole number. By treating the |
|
|
163 // C floating-point numbers as a finite ordered set note that |
|
|
164 // C the heuristic EPS=2.**(-(M-1)) and CT=3*EPS causes |
|
|
165 // C arguments of TFLOOR/TCEIL to be treated as whole numbers |
|
|
166 // C if they are exactly whole numbers or are immediately |
|
|
167 // C adjacent to whole number representations. Since EPS, the |
|
|
168 // C "distance" between floating-point numbers on the unit |
|
|
169 // C interval, and M, the number of bits in X'S mantissa, exist |
|
|
170 // C on every floating-point computer, TFLOOR/TCEIL are |
|
|
171 // C consistently definable on every floating-point computer. |
|
|
172 // C |
|
|
173 // C For more information see the following references: |
|
|
174 // C (1) P. E. Hagerty, "More On Fuzzy Floor And Ceiling," APL QUOTE |
|
|
175 // C QUAD 8(4):20-24, June 1978. Note that TFLOOR=FL5. |
|
|
176 // C (2) L. M. Breed, "Definitions For Fuzzy Floor And Ceiling", APL |
|
|
177 // C QUOTE QUAD 8(3):16-23, March 1978. This paper cites FL1 through |
|
|
178 // C FL5, the history of five years of evolutionary development of |
|
|
179 // C FL5 - the seven lines of code below - by open collaboration |
|
|
180 // C and corroboration of the mathematical-computing community. |
|
|
181 // C |
|
|
182 // C Penn State University Center for Academic Computing |
|
|
183 // C H. D. Knoble - August, 1978. |
|
|
184 |
|
|
185 static inline double |
|
|
186 tfloor (double x, double ct) |
|
|
187 { |
|
|
188 // C---------FLOOR(X) is the largest integer algebraically less than |
|
|
189 // C or equal to X; that is, the unfuzzy FLOOR function. |
|
|
190 |
|
|
191 // DINT (X) = X - DMOD (X, 1.0); |
|
|
192 // FLOOR (X) = DINT (X) - DMOD (2.0 + DSIGN (1.0, X), 3.0); |
|
|
193 |
|
|
194 // C---------Hagerty's FL5 function follows... |
|
|
195 |
|
|
196 double q = 1.0; |
|
|
197 |
|
|
198 if (x < 0.0) |
|
|
199 q = 1.0 - ct; |
|
|
200 |
|
|
201 double rmax = q / (2.0 - ct); |
|
|
202 |
|
|
203 double t1 = 1.0 + floor (x); |
|
|
204 t1 = (ct / q) * (t1 < 0.0 ? -t1 : t1); |
|
|
205 t1 = rmax < t1 ? rmax : t1; |
|
|
206 t1 = ct > t1 ? ct : t1; |
|
|
207 t1 = floor (x + t1); |
|
|
208 |
|
1555
|
209 if (x <= 0.0 || (t1 - x) < rmax) |
|
1546
|
210 return t1; |
|
|
211 else |
|
|
212 return t1 - 1.0; |
|
|
213 } |
|
|
214 |
|
|
215 static inline double |
|
|
216 tceil (double x, double ct) |
|
|
217 { |
|
|
218 return -tfloor (-x, ct); |
|
|
219 } |
|
|
220 |
|
|
221 static inline double |
|
|
222 round (double x, double ct) |
|
|
223 { |
|
|
224 return tfloor (x+0.5, ct); |
|
|
225 } |
|
|
226 |
|
1360
|
227 int |
|
|
228 Range::nelem_internal (void) const |
|
|
229 { |
|
1546
|
230 double ct = 3.0 * DBL_EPSILON; |
|
3
|
231 |
|
1555
|
232 double tmp = tfloor ((rng_limit - rng_base + rng_inc) / rng_inc, ct); |
|
3
|
233 |
|
1546
|
234 int n_intervals = (int) (tmp > 0.0 ? tmp : 0); |
|
398
|
235 |
|
1546
|
236 return (n_intervals >= INT_MAX - 1) ? -1 : n_intervals; |
|
3
|
237 } |
|
|
238 |
|
|
239 /* |
|
|
240 ;;; Local Variables: *** |
|
|
241 ;;; mode: C++ *** |
|
|
242 ;;; End: *** |
|
|
243 */ |
