summaryrefslogtreecommitdiffstats
path: root/lib/midpoint.c
blob: c28cdffa97b7bcdb5f382ffac8a9f59ed73e3d2f (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
// Midpoint
//
// midpoint
//
// Midpoint over rolling window
//
// (highest_high + lowest_low) / 2
//
// Inputs:    1
// Outputs:   1
// Constants: 1


#include "ts.h"

typedef struct {
    uint_t k;
} ts_midpoint_params_t;

ts_parameter_t const ts_midpoint_p = { .n_inputs = 1, .n_outputs = 1, .n_constants = 1, .params_size = sizeof(ts_midpoint_params_t) };

uint_t ts_midpoint_offset( ts_constant_t const *c )
{
	( void )c;
	return ( c ? ((ts_midpoint_params_t *)c)->k - 1 : 0 );
}

int ts_midpoint(
	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_midpoint_p );
	if ( !c ) return -1;
	uint_t k = ((ts_midpoint_params_t *)c)->k;
	if (k == 0 || n < k) return -1;

	for( uint_t i = k - 1; i < n; ++i )
	{
		fp_t max_val = x[0][i];
		fp_t min_val = x[0][i];
		for( uint_t j = 1; j < k; ++j )
		{
			fp_t val = x[0][i - j];
			if( val > max_val ) max_val = val;
			if( val < min_val ) min_val = val;
		}
		y[0][i] = ( max_val + min_val ) / 2;
	}
	return 0;
}