brk_computer 0.3.0-beta.8

A Bitcoin dataset computer built on top of brk_indexer
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

use brk_traversable::Traversable;
use brk_types::Version;
use vecdb::UnaryTransform;

use crate::internal::{
    BpsType, LazyPercentPerBlock, LazyPercentRollingWindows, PercentCumulativeRolling,
};

/// Fully lazy variant of `PercentCumulativeRolling` — no stored vecs.
///
/// Mirrors the flat shape of `PercentCumulativeRolling`: cumulative and
/// rolling window fields are both flattened to the same tree level, so
/// consumers see `{ bps, percent, ratio, _24h, _1w, _1m, _1y }`.
#[derive(Clone, Traversable)]
pub struct LazyPercentCumulativeRolling<B: BpsType> {
    #[traversable(flatten)]
    pub cumulative: LazyPercentPerBlock<B>,
    #[traversable(flatten)]
    pub rolling: LazyPercentRollingWindows<B>,
}

impl<B: BpsType> LazyPercentCumulativeRolling<B> {
    /// Derive from a stored `PercentCumulativeRolling` source via a
    /// BPS-to-BPS unary transform applied to both cumulative and rolling.
    pub(crate) fn from_source<F: UnaryTransform<B, B>>(
        name: &str,
        version: Version,
        source: &PercentCumulativeRolling<B>,
    ) -> Self {
        let cumulative = LazyPercentPerBlock::from_percent::<F>(name, version, &source.cumulative);
        let rolling = LazyPercentRollingWindows::from_rolling::<F>(name, version, &source.rolling);
        Self {
            cumulative,
            rolling,
        }
    }
}