use crate::ohlcv::Candle;
use crate::traits::Indicator;
#[derive(Debug, Clone, Copy, PartialEq)]
pub struct FibonacciPivotsOutput {
pub pp: f64,
pub r1: f64,
pub r2: f64,
pub r3: f64,
pub s1: f64,
pub s2: f64,
pub s3: f64,
}
#[derive(Debug, Clone, Default)]
pub struct FibonacciPivots {
ready: bool,
}
impl FibonacciPivots {
pub const fn new() -> Self {
Self { ready: false }
}
}
const FIB1: f64 = 0.382;
const FIB2: f64 = 0.618;
const FIB3: f64 = 1.000;
impl Indicator for FibonacciPivots {
type Input = Candle;
type Output = FibonacciPivotsOutput;
fn update(&mut self, candle: Candle) -> Option<FibonacciPivotsOutput> {
let (h, l, c) = (candle.high, candle.low, candle.close);
let pp = (h + l + c) / 3.0;
let range = h - l;
let out = FibonacciPivotsOutput {
pp,
r1: pp + FIB1 * range,
r2: pp + FIB2 * range,
r3: pp + FIB3 * range,
s1: pp - FIB1 * range,
s2: pp - FIB2 * range,
s3: pp - FIB3 * range,
};
self.ready = true;
Some(out)
}
fn reset(&mut self) {
self.ready = false;
}
fn warmup_period(&self) -> usize {
1
}
fn is_ready(&self) -> bool {
self.ready
}
fn name(&self) -> &'static str {
"FibonacciPivots"
}
}
#[cfg(test)]
mod tests {
use super::*;
use crate::traits::BatchExt;
fn c(h: f64, l: f64, close: f64, ts: i64) -> Candle {
Candle::new(close, h, l, close, 1.0, ts).unwrap()
}
#[test]
fn formula_reference_values() {
let levels = FibonacciPivots::new()
.update(c(110.0, 90.0, 100.0, 0))
.unwrap();
assert!((levels.pp - 100.0).abs() < 1e-12);
assert!((levels.r1 - (100.0 + 0.382 * 20.0)).abs() < 1e-12);
assert!((levels.r2 - (100.0 + 0.618 * 20.0)).abs() < 1e-12);
assert!((levels.r3 - (100.0 + 20.0)).abs() < 1e-12);
assert!((levels.s1 - (100.0 - 0.382 * 20.0)).abs() < 1e-12);
assert!((levels.s2 - (100.0 - 0.618 * 20.0)).abs() < 1e-12);
assert!((levels.s3 - (100.0 - 20.0)).abs() < 1e-12);
}
#[test]
fn resistances_strictly_above_pp_supports_strictly_below() {
let levels = FibonacciPivots::new()
.update(c(120.0, 80.0, 110.0, 0))
.unwrap();
assert!(levels.r3 > levels.r2);
assert!(levels.r2 > levels.r1);
assert!(levels.r1 > levels.pp);
assert!(levels.pp > levels.s1);
assert!(levels.s1 > levels.s2);
assert!(levels.s2 > levels.s3);
}
#[test]
fn constant_series_collapses_levels() {
let levels = FibonacciPivots::new()
.update(c(50.0, 50.0, 50.0, 0))
.unwrap();
assert_eq!(levels.pp, 50.0);
assert_eq!(levels.r1, 50.0);
assert_eq!(levels.s3, 50.0);
}
#[test]
fn warmup_and_ready() {
let mut p = FibonacciPivots::new();
assert!(!p.is_ready());
assert_eq!(p.warmup_period(), 1);
p.update(c(11.0, 9.0, 10.0, 0));
assert!(p.is_ready());
}
#[test]
fn reset_clears_state() {
let mut p = FibonacciPivots::new();
p.update(c(11.0, 9.0, 10.0, 0));
p.reset();
assert!(!p.is_ready());
}
#[test]
fn batch_equals_streaming() {
let candles: Vec<Candle> = (0_i32..40)
.map(|i| {
c(
f64::from(i) + 2.0,
f64::from(i),
f64::from(i) + 1.0,
i.into(),
)
})
.collect();
let mut a = FibonacciPivots::new();
let mut b = FibonacciPivots::new();
assert_eq!(
a.batch(&candles),
candles.iter().map(|x| b.update(*x)).collect::<Vec<_>>()
);
}
#[test]
fn accessors_and_metadata() {
let p = FibonacciPivots::new();
assert_eq!(p.warmup_period(), 1);
assert_eq!(p.name(), "FibonacciPivots");
}
}