1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
|
#include <cmath>
#include "mmath.h"
// QwtMath - a set of mathematical routines
//
// qwtGetMin -- Find the smallest value in an array
// qwtGetMax -- Find the largest value in an array
// qwtTwistArray -- invert the order of an array
// qwtFloor125 -- Find the largest value fitting in a 1-2-5 pattern
// qwtCeil125 -- Find the smallest value fitting in a 1-2-5 pattern
// qwtChkMono -- Check for monotony
// qwtLinSpace -- construct an array of equally spaced values
// qwtLogSpace -- construct an array of logarithmically equally spaced values
// qwtMax -- Return the largest of two values
// qwtMin -- Return the smallest of two values
// qwtAbs -- return the absolute value
// qwtSign -- Return the sign of a number
// qwtSqr -- Return the square of a number
// qwtCopyArray -- Copy an array into another
// qwtShiftArray -- Shift an array
// qwtSwap -- Swap two values
// qwtSort (1) -- Sort two values
// qwtSort (2) -- Sort two values
// qwtInt -- Return nearest integer
// qwtLim -- Limit a values
//------------------------------------------------------------
//.F qwtGetMin
// Find the smallest value in an array
//
//.u Syntax
//.f double qwtGetMin(double *array, int size)
//
//.u Parameters
//.p double *array, int size
//
//------------------------------------------------------------
double qwtGetMin(double *array, int size)
{
double rv;
int i;
if (size > 0)
{
rv = array[0];
for (i=1; i< size; i++)
rv = qwtMin(rv, array[i]);
return rv;
}
else
return 0.0;
}
//------------------------------------------------------------
//
//.F qwtGetMax
// Find the largest value in an array
//
//.u Syntax
//.f double qwtGetMax(double *array, int size)
//
//.u Parameters
//.p double *array, int size
//
//------------------------------------------------------------
double qwtGetMax(double *array, int size)
{
double rv;
int i;
if (size > 0)
{
rv = array[0];
for (i=1; i< size; i++)
rv = qwtMax(rv, array[i]);
return rv;
}
else
return 0.0;
}
//------------------------------------------------------------
//
//.F qwtCeil125
// Find the smallest value out of {1,2,5}*10^n with an integer number n
// which is greater than or equal to x
//
//.u Syntax
//.f double qwtCeil125(double x)
//
//.u Parameters
//.p double x
//
//------------------------------------------------------------
double qwtCeil125( double x)
{
double lx, rv;
double p10, fr;
double sign = ( x > 0) ? 1.0 : -1.0;
if (x == 0.0) return 0.0;
lx = log10(fabs(x));
p10 = floor(lx);
fr = pow(10.0,lx - p10);
if (fr <=1.0)
fr = 1.0;
else if (fr <= 2.0)
fr = 2.0;
else if (fr <= 5.0)
fr = 5.0;
else
fr = 10.0;
rv = fr * pow(10.0,p10);
return sign * rv;
}
//------------------------------------------------------------
//
//.F qwtFloor125
// Find the largest value out of {1,2,5}*10^n with an integer number n
// which is smaller than or equal to x
//
//.u Syntax
//.f double qwtFloor125(double x)
//
//.u Parameters
//.p double x
//
//------------------------------------------------------------
double qwtFloor125( double x)
{
double lx, rv;
double p10, fr;
double sign = ( x > 0) ? 1.0 : -1.0;
if (x == 0.0) return 0.0;
lx = log10(fabs(x));
p10 = floor(lx);
fr = pow(10.0,lx - p10);
if (fr >= 10.0)
fr = 10.0;
else if (fr >= 5.0)
fr = 5.0;
else if (fr >= 2.0)
fr = 2.0;
else
fr = 1.0;
rv = fr * pow(10.0,p10);
return sign * rv;
}
//------------------------------------------------------------
//
//.F qwtChkMono
// Checks if an array is a strictly monotonic sequence
//
//.u Syntax
//.f int qwtChkMono(double *array, int size)
//
//.u Parameters
//.p double *array -- pointer to a double array
// int size -- size of the array
//
//.u Return Value
//.t 0 -- sequence is not strictly monotonic
// 1 -- sequence is strictly monotonically increasing
// -1 -- sequence is strictly monotonically decreasing
//
//------------------------------------------------------------
int qwtChkMono(double *array, int size)
{
int rv, i;
if (size < 2) return 0;
rv = qwtSign(array[1] - array[0]);
for (i=1;i<size-1;i++)
{
if ( qwtSign(array[i+1] - array[i]) != rv )
{
rv = 0;
break;
}
}
return rv;
}
//------------------------------------------------------------
//
//.F qwtTwistArray
// Invert the order of array elements
//
//.u Syntax
//.f void qwtTwistArray(double *array, int size)
//
//.u Parameters
//.p double *array, int size
//
//------------------------------------------------------------
void qwtTwistArray(double *array, int size)
{
int itmp;
int i, s2;
double dtmp;
s2 = size / 2;
for (i=0; i < s2; i++)
{
itmp = size - 1 - i;
dtmp = array[i];
array[i] = array[itmp];
array[itmp] = dtmp;
}
}
//------------------------------------------------------------
//
//.F qwtLinSpace
// Create an array of equally spaced values
//
//.u Syntax
//.f void qwtLinSpace(double *array, int size, double xmin, double xmax)
//
//.u Parameters
//.p double *array -- where to put the values
// int size -- size of the array
// double xmin -- value associated with index 0
// double xmax -- value associated with index (size-1)
//
//------------------------------------------------------------
void qwtLinSpace(double *array, int size, double xmin, double xmax)
{
int i, imax;
imax = size -1;
double step;
if (size > 0)
{
array[0] = xmin;
array[imax] = xmax;
step = (xmax - xmin) / double(imax);
for (i=1;i<imax;i++)
array[i] = xmin + double(i) * step;
}
}
//------------------------------------------------------------
//
//.F qwtLogSpace
// Create an array of logarithmically equally spaced values
//
//.u Syntax
//.f void qwtLogSpace(double *array, int size, double xmin, double xmax)
//
//.u Parameters
//.p double *array -- where to put the values
// int size -- size of the array
// double xmin -- value associated with index 0
// double xmax -- value associated with index (size-1)
//------------------------------------------------------------
void qwtLogSpace(double *array, int size, double xmin, double xmax)
{
int i, imax;
double lxmin,lxmax;
double lstep;
imax = size -1;
if ((xmin <= 0.0) || (xmax <= 0.0) || (size <= 0))
return;
array[0] = xmin;
array[imax] = xmax;
lxmin = log(xmin);
lxmax = log(xmax);
lstep = (lxmax - lxmin) / double(imax);
for (i=1; i<imax;i++)
array[i] = exp(lxmin + double(i) * lstep);
}
|
