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
|
/*
* Copyright © 2009 Keith Packard <keithp@keithp.com>
*
* 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; version 2 of the License.
*
* 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.,
* 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.
*/
#include "cc.h"
#include <math.h>
void
cc_timedata_limits(struct cc_timedata *d, double min_time, double max_time, int *start, int *stop)
{
int i;
*start = -1;
for (i = 0; i < d->num; i++) {
if (*start < 0 && min_time <= d->data[i].time)
*start = i;
if (d->data[i].time <= max_time)
*stop = i;
}
}
int
cc_timedata_min(struct cc_timedata *d, double min_time, double max_time)
{
int i;
int set = 0;
int min_i = -1;
double min;
if (d->num == 0)
return -1;
for (i = 0; i < d->num; i++)
if (min_time <= d->data[i].time && d->data[i].time <= max_time)
if (!set || d->data[i].value < min) {
min_i = i;
min = d->data[i].value;
set = 1;
}
return min_i;
}
int
cc_timedata_min_mag(struct cc_timedata *d, double min_time, double max_time)
{
int i;
int set = 0;
int min_i = -1;
double min;
if (d->num == 0)
return -1;
for (i = 0; i < d->num; i++)
if (min_time <= d->data[i].time && d->data[i].time <= max_time)
if (!set || fabs(d->data[i].value) < min) {
min_i = i;
min = fabs(d->data[i].value);
set = 1;
}
return min_i;
}
int
cc_timedata_max(struct cc_timedata *d, double min_time, double max_time)
{
int i;
double max;
int max_i = -1;
int set = 0;
if (d->num == 0)
return -1;
for (i = 0; i < d->num; i++)
if (min_time <= d->data[i].time && d->data[i].time <= max_time)
if (!set || d->data[i].value > max) {
max_i = i;
max = d->data[i].value;
set = 1;
}
return max_i;
}
int
cc_timedata_max_mag(struct cc_timedata *d, double min_time, double max_time)
{
int i;
double max;
int max_i = -1;
int set = 0;
if (d->num == 0)
return -1;
for (i = 0; i < d->num; i++)
if (min_time <= d->data[i].time && d->data[i].time <= max_time)
if (!set || fabs(d->data[i].value) > max) {
max_i = i;
max = fabs(d->data[i].value);
set = 1;
}
return max_i;
}
double
cc_timedata_average(struct cc_timedata *td, double start_time, double stop_time)
{
int i;
double prev_time;
double next_time;
double interval;
double sum = 0.0;
double period = 0.0;
prev_time = start_time;
for (i = 0; i < td->num; i++) {
if (start_time <= td->data[i].time && td->data[i].time <= stop_time) {
if (i < td->num - 1 && td->data[i+1].time < stop_time)
next_time = (td->data[i].time + td->data[i+1].time) / 2.0;
else
next_time = stop_time;
interval = next_time - prev_time;
sum += td->data[i].value * interval;
period += interval;
prev_time = next_time;
}
}
return sum / period;
}
int
cc_perioddata_limits(struct cc_perioddata *d, double min_time, double max_time, int *start, int *stop)
{
double start_d, stop_d;
if (d->num == 0)
return 0;
start_d = ceil((min_time - d->start) / d->step);
if (start_d < 0)
start_d = 0;
stop_d = floor((max_time - d->start) / d->step);
if (stop_d >= d->num)
stop_d = d->num - 1;
if (stop_d < start_d)
return 0;
*start = (int) start_d;
*stop = (int) stop_d;
return 1;
}
int
cc_perioddata_min(struct cc_perioddata *d, double min_time, double max_time)
{
int i;
double min;
int min_i;
int start, stop;
if (!cc_perioddata_limits(d, min_time, max_time, &start, &stop))
return -1;
min = d->data[start];
min_i = start;
for (i = start + 1; i <= stop; i++)
if (d->data[i] < min) {
min = d->data[i];
min_i = i;
}
return min_i;
}
int
cc_perioddata_min_mag(struct cc_perioddata *d, double min_time, double max_time)
{
int start, stop;
int i;
double min;
int min_i;
if (!cc_perioddata_limits(d, min_time, max_time, &start, &stop))
return -1;
min = d->data[start];
min_i = start;
for (i = start + 1; i <= stop; i++)
if (fabs(d->data[i]) < min) {
min = fabs(d->data[i]);
min_i = i;
}
return min_i;
}
int
cc_perioddata_max(struct cc_perioddata *d, double min_time, double max_time)
{
int start, stop;
int i;
double max;
int max_i;
if (!cc_perioddata_limits(d, min_time, max_time, &start, &stop))
return -1;
max = d->data[start];
max_i = start;
for (i = start + 1; i <= stop; i++)
if (d->data[i] > max) {
max = d->data[i];
max_i = i;
}
return max_i;
}
int
cc_perioddata_max_mag(struct cc_perioddata *d, double min_time, double max_time)
{
int start, stop;
int i;
double max;
int max_i;
if (!cc_perioddata_limits(d, min_time, max_time, &start, &stop))
return -1;
max = d->data[start];
max_i = start;
for (i = start + 1; i <= stop; i++)
if (fabs(d->data[i]) > max) {
max = fabs(d->data[i]);
max_i = i;
}
return max_i;
}
double
cc_perioddata_average(struct cc_perioddata *d, double min_time, double max_time)
{
int start, stop;
int i;
double sum = 0.0;
if (!cc_perioddata_limits(d, min_time, max_time, &start, &stop))
return 0.0;
for (i = start; i <= stop; i++)
sum += d->data[i];
return sum / (stop - start + 1);
}
double
cc_perioddata_average_mag(struct cc_perioddata *d, double min_time, double max_time)
{
int start, stop;
int i;
double sum = 0.0;
if (!cc_perioddata_limits(d, min_time, max_time, &start, &stop))
return 0.0;
for (i = start; i <= stop; i++)
sum += fabs(d->data[i]);
return sum / (stop - start + 1);
}
|
