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; version 2 of the License.
8 * This program is distributed in the hope that it will be useful, but
9 * WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
13 * You should have received a copy of the GNU General Public License along
14 * with this program; if not, write to the Free Software Foundation, Inc.,
15 * 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.
22 cc_timedata_min(struct cc_timedata *d, double min_time, double max_time)
31 for (i = 0; i < d->num; i++)
32 if (min_time <= d->data[i].time && d->data[i].time <= max_time)
33 if (!set || d->data[i].value < min) {
35 min = d->data[i].value;
42 cc_timedata_max(struct cc_timedata *d, double min_time, double max_time)
51 for (i = 0; i < d->num; i++)
52 if (min_time <= d->data[i].time && d->data[i].time <= max_time)
53 if (!set || d->data[i].value > max) {
55 max = d->data[i].value;
62 cc_perioddata_min(struct cc_perioddata *d, double min_time, double max_time)
71 start = (int) ceil((min_time - d->start) / d->step);
74 stop = (int) floor((max_time - d->start) / d->step);
81 for (i = start + 1; i <= stop; i++)
82 if (d->data[i] < min) {
90 cc_perioddata_max(struct cc_perioddata *d, double min_time, double max_time)
99 start = (int) ceil((min_time - d->start) / d->step);
102 stop = (int) floor((max_time - d->start) / d->step);
107 max = d->data[start];
109 for (i = start + 1; i <= stop; i++)
110 if (fabs(d->data[i]) > max) {
111 max = fabs(d->data[i]);