2 * Copyright © 2009 Keith Packard <keithp@keithp.com>
4 * This program is free software; you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License as published by
6 * the Free Software Foundation; either version 2 of the License, or
7 * (at your option) any later version.
9 * This program is distributed in the hope that it will be useful, but
10 * WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * General Public License for more details.
14 * You should have received a copy of the GNU General Public License along
15 * with this program; if not, write to the Free Software Foundation, Inc.,
16 * 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.
23 cc_timedata_limits(struct cc_timedata *d, double min_time, double max_time, int *start, int *stop)
28 for (i = 0; i < d->num; i++) {
29 if (*start < 0 && min_time <= d->data[i].time)
31 if (d->data[i].time <= max_time)
37 cc_timedata_min(struct cc_timedata *d, double min_time, double max_time)
46 for (i = 0; i < d->num; i++)
47 if (min_time <= d->data[i].time && d->data[i].time <= max_time)
48 if (!set || d->data[i].value < min) {
50 min = d->data[i].value;
57 cc_timedata_min_mag(struct cc_timedata *d, double min_time, double max_time)
66 for (i = 0; i < d->num; i++)
67 if (min_time <= d->data[i].time && d->data[i].time <= max_time)
68 if (!set || fabs(d->data[i].value) < min) {
70 min = fabs(d->data[i].value);
77 cc_timedata_max(struct cc_timedata *d, double min_time, double max_time)
86 for (i = 0; i < d->num; i++)
87 if (min_time <= d->data[i].time && d->data[i].time <= max_time)
88 if (!set || d->data[i].value > max) {
90 max = d->data[i].value;
97 cc_timedata_max_mag(struct cc_timedata *d, double min_time, double max_time)
106 for (i = 0; i < d->num; i++)
107 if (min_time <= d->data[i].time && d->data[i].time <= max_time)
108 if (!set || fabs(d->data[i].value) > max) {
110 max = fabs(d->data[i].value);
117 cc_timedata_average(struct cc_timedata *td, double start_time, double stop_time)
126 prev_time = start_time;
127 for (i = 0; i < td->num; i++) {
128 if (start_time <= td->data[i].time && td->data[i].time <= stop_time) {
129 if (i < td->num - 1 && td->data[i+1].time < stop_time)
130 next_time = (td->data[i].time + td->data[i+1].time) / 2.0;
132 next_time = stop_time;
133 interval = next_time - prev_time;
134 sum += td->data[i].value * interval;
136 prev_time = next_time;
143 cc_perioddata_limits(struct cc_perioddata *d, double min_time, double max_time, int *start, int *stop)
145 double start_d, stop_d;
149 start_d = ceil((min_time - d->start) / d->step);
152 stop_d = floor((max_time - d->start) / d->step);
153 if (stop_d >= d->num)
155 if (stop_d < start_d)
157 *start = (int) start_d;
158 *stop = (int) stop_d;
163 cc_perioddata_min(struct cc_perioddata *d, double min_time, double max_time)
170 if (!cc_perioddata_limits(d, min_time, max_time, &start, &stop))
172 min = d->data[start];
174 for (i = start + 1; i <= stop; i++)
175 if (d->data[i] < min) {
183 cc_perioddata_min_mag(struct cc_perioddata *d, double min_time, double max_time)
190 if (!cc_perioddata_limits(d, min_time, max_time, &start, &stop))
192 min = d->data[start];
194 for (i = start + 1; i <= stop; i++)
195 if (fabs(d->data[i]) < min) {
196 min = fabs(d->data[i]);
203 cc_perioddata_max(struct cc_perioddata *d, double min_time, double max_time)
210 if (!cc_perioddata_limits(d, min_time, max_time, &start, &stop))
212 max = d->data[start];
214 for (i = start + 1; i <= stop; i++)
215 if (d->data[i] > max) {
223 cc_perioddata_max_mag(struct cc_perioddata *d, double min_time, double max_time)
230 if (!cc_perioddata_limits(d, min_time, max_time, &start, &stop))
232 max = d->data[start];
234 for (i = start + 1; i <= stop; i++)
235 if (fabs(d->data[i]) > max) {
236 max = fabs(d->data[i]);
243 cc_perioddata_average(struct cc_perioddata *d, double min_time, double max_time)
249 if (!cc_perioddata_limits(d, min_time, max_time, &start, &stop))
251 for (i = start; i <= stop; i++)
253 return sum / (stop - start + 1);
257 cc_perioddata_average_mag(struct cc_perioddata *d, double min_time, double max_time)
263 if (!cc_perioddata_limits(d, min_time, max_time, &start, &stop))
265 for (i = start; i <= stop; i++)
266 sum += fabs(d->data[i]);
267 return sum / (stop - start + 1);