summaryrefslogtreecommitdiffstats
path: root/test/cmf.c
blob: 66b4c3f37420064f5df2fc7546de8cc693fd9b3c (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
#include <stddef.h>
#include "ts.h"

bool ts_test_cmf( void )
{
    uint_t k = TS_TEST_K;

    fp_t const o[] = { 10, 11, 12, 11, 12, 10, 11, 13, 12, 14 };
    fp_t const h[] = { 12, 13, 14, 12, 14, 11, 12, 15, 14, 16 };
    fp_t const l[] = { 8,  9,  10,  9,  10,  9,  10,  11,  10,  12 };
    fp_t const c[] = { 11, 12, 10, 11, 11, 10, 12, 14, 13, 15 };
    fp_t const v[] = { 100, 200, 300, 400, 500, 300, 200, 400, 300, 500 };

    fp_t const * const x[] = { o, h, l, c, v };

    fp_t mf_vals[10] = { 0 };
    for( uint_t i = 0; i < 10; ++i )
    {
        fp_t hl = h[i] - l[i];
        mf_vals[i] = hl != 0 ? ( ( c[i] - l[i] ) - ( h[i] - c[i] ) ) / hl * v[i] : 0;
    }

    fp_t e[6] = { 0 };
    for( uint_t i = k - 1; i < 10; ++i )
    {
        fp_t sum_mf = 0;
        fp_t sum_v = 0;
        for( uint_t j = 0; j < k; ++j )
        {
            uint_t idx = i - k + 1 + j;
            sum_mf += mf_vals[idx];
            sum_v += v[idx];
        }
        e[i - k + 1] = sum_v != 0 ? sum_mf / sum_v : 0;
    }
    fp_t const * const e_arr[1] = { e };

    uint_t c_val = k;

    return ts_test(ts_cmf, ts_cmf_offset, x, e_arr, 10, (ts_constant_t *)&c_val, &ts_cmf_p);
}