blob: fc8a8417bd3d6cba210be05eccea23ac0ede12d9 (
plain) (
blame)
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
|
/*
* 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"
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_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;
}
|
