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
|
/* statistics/minmax_source.c
*
* Copyright (C) 1996, 1997, 1998, 1999, 2000 Jim Davies, Brian Gough
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or (at
* your option) any later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
BASE
FUNCTION (gsl_stats,max) (const BASE data[], const size_t stride,
const size_t n)
{
/* finds the largest member of a dataset */
BASE max = data[0 * stride];
size_t i;
for (i = 0; i < n; i++)
{
BASE xi = data[i * stride];
if (xi > max)
max = xi;
#ifdef FP
if (isnan (xi))
return xi;
#endif
}
return max;
}
BASE
FUNCTION (gsl_stats,min) (const BASE data[], const size_t stride,
const size_t n)
{
/* finds the smallest member of a dataset */
BASE min = data[0 * stride];
size_t i;
for (i = 0; i < n; i++)
{
BASE xi = data[i * stride];
if (xi < min)
min = xi;
#ifdef FP
if (isnan (xi))
return xi;
#endif
}
return min;
}
void
FUNCTION (gsl_stats,minmax) (BASE * min_out, BASE * max_out,
const BASE data[], const size_t stride,
const size_t n)
{
/* finds the smallest and largest members of a dataset */
BASE min = data[0 * stride];
BASE max = data[0 * stride];
size_t i;
for (i = 0; i < n; i++)
{
BASE xi = data[i * stride];
if (xi < min)
min = xi;
if (xi > max)
max = xi;
#ifdef FP
if (isnan (xi))
{
min = xi;
max = xi;
break;
}
#endif
}
*min_out = min;
*max_out = max;
}
size_t
FUNCTION (gsl_stats,max_index) (const BASE data[], const size_t stride,
const size_t n)
{
/* finds the index of the largest member of a dataset */
/* if there is more than one largest value then we choose the first */
BASE max = data[0 * stride];
size_t i, max_index = 0;
for (i = 0; i < n; i++)
{
BASE xi = data[i * stride];
if (xi > max)
{
max = xi;
max_index = i;
}
#ifdef FP
if (isnan (xi))
{
return i;
}
#endif
}
return max_index;
}
size_t
FUNCTION (gsl_stats,min_index) (const BASE data[], const size_t stride,
const size_t n)
{
/* finds the index of the smallest member of a dataset */
/* if there is more than one largest value then we choose the first */
BASE min = data[0 * stride];
size_t i, min_index = 0;
for (i = 0; i < n; i++)
{
BASE xi = data[i * stride];
if (xi < min)
{
min = xi;
min_index = i;
}
#ifdef FP
if (isnan (xi))
{
return i;
}
#endif
}
return min_index;
}
void
FUNCTION (gsl_stats,minmax_index) (size_t * min_index_out,
size_t * max_index_out, const BASE data[],
const size_t stride, const size_t n)
{
/* finds the smallest and largest members of a dataset */
BASE min = data[0 * stride];
BASE max = data[0 * stride];
size_t i, min_index = 0, max_index = 0;
for (i = 0; i < n; i++)
{
BASE xi = data[i * stride];
if (xi < min)
{
min = xi;
min_index = i;
}
if (xi > max)
{
max = xi;
max_index = i;
}
#ifdef FP
if (isnan (xi))
{
min_index = i;
max_index = i;
break;
}
#endif
}
*min_index_out = min_index;
*max_index_out = max_index;
}
|
