tulip_rs 0.1.9

High-performance technical analysis library — 100+ indicators and 60+ candlestick patterns with SIMD acceleration
Documentation 
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
59
60

//use crate::common::{Inputs, Options, Outputs};
/*pub fn abs(data: &[f64], start_index: usize) -> Vec<f64> {
    data[start_index..].iter().map(|&x| x.abs()).collect()
}

pub fn acos(data: &[f64], start_index: usize) -> Vec<f64> {
    data[start_index..].iter().map(|&x| x.acos()).collect()
}*/

pub fn abs(value: f64) -> f64 {
    value.abs()
}

pub fn acos(value: f64) -> f64 {
    value.acos()
}

pub fn crossover(inputs: &[&[f64]; 2]) -> Vec<f64> {
    let mut result = Vec::new();
    if inputs[0].len() < 2 {
        return result;
    }

    let in1 = &inputs[0];
    let in2 = &inputs[1];

    for i in 1..in1.len() {
        if in1[i - 1] < in2[i - 1] && in1[i] > in2[i] {
            result.push(1.0);
        } else {
            result.push(0.0);
        }
    }

    result
}

pub fn crossany(inputs: &[&[f64]; 2]) -> Vec<f64> {
    let mut result = Vec::new();
    if inputs.len() < 2 || inputs[0].len() < 2 {
        return result;
    }

    let in1 = &inputs[0];
    let in2 = &inputs[1];

    for i in 1..in1.len() {
        if (in1[i - 1] < in2[i - 1] && in1[i] > in2[i]) || (in1[i - 1] > in2[i - 1] && in1[i] < in2[i]) {
            result.push(1.0);
        } else {
            result.push(0.0);
        }
    }

    result
}
pub fn sum(real: &[f64], period: usize) -> f64 {
    real[0..period].iter().sum::<f64>()
}