blob: d2ba15fc41b2bbb3936161ad1b9903cd49b50e2b (
plain)
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
|
// Minimum
//
// minimum - min
//
// Finds the minimum value in the past k data points
//
// Inputs: 1
// Outputs: 1
// Constants: 0
#include "ts.h"
typedef struct {
uint_t k;
} ts_minimum_params_t;
ts_parameter_t const ts_minimum_p = { .n_inputs = 1, .n_outputs = 1, .n_constants = 1, .params_size = sizeof(ts_minimum_params_t) };
uint_t ts_minimum_offset( ts_constant_t const *c )
{
( void )c;
return ( c ? ((ts_minimum_params_t *)c)->k - 1 : 0 );
}
int ts_minimum(
fp_t * const *y, uint_t y_n,
fp_t const * const *x, uint_t x_n,
uint_t n, ts_constant_t const *c
)
{
TS_PROLOGUE( ts_minimum_p );
if ( !c ) return -1;
uint_t k = ((ts_minimum_params_t *)c)->k;
if (k == 0 || n < k) return -1;
uint_t xi = k - 1;
uint_t xj = 0;
uint_t yi = k - 1;
for( ; xi < n; xi++, xj++, yi++ )
{
y[0][yi] = x[0][xj];
for( uint_t i = xj; i <= xi; i++ )
{
if( x[0][i] < y[0][yi] )
{
y[0][yi] = x[0][i];
}
}
}
return 0;
}
|