sva-samples 0.7.0

Buffers, frames, the f64 machine, the collapse of a law onto a grid, and the measured observations over one
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

// Concern: the sample spans a lane's own windows leave it nonzero over | Non-concern: reading one (reading.rs), pricing them (plan.rs) | IO: (&Lane, rate, Extent) -> spans

use sva_formula::Lane;

use super::Extent;

/// Where every atom is windowed, the lane is zero outside their union.
pub(super) fn nonzero(lane: &Lane, extent: Extent, rate: u32) -> Vec<(usize, usize)> {
    let local = |n: i64| (n - extent.start) as usize;
    absolute(lane, extent, rate)
        .into_iter()
        .map(|(from, to)| (local(from), local(to)))
        .collect()
}

/// The same spans on the grid's own index.
pub(super) fn absolute(lane: &Lane, extent: Extent, rate: u32) -> Vec<(i64, i64)> {
    let Some(spans) = windows(lane, rate) else {
        return vec![(extent.start, extent.end)];
    };
    let within = |n: i64| n.clamp(extent.start, extent.end);
    spans
        .into_iter()
        .map(|(from, to)| (within(from), within(to)))
        .filter(|(from, to)| from < to)
        .collect()
}

pub(super) fn windows(lane: &Lane, rate: u32) -> Option<Vec<(i64, i64)>> {
    if !lane.is_finite_sum() || lane.atoms.iter().any(|a| a.ind.is_none()) {
        return None;
    }
    let edge = |secs: f64| {
        (secs * f64::from(rate))
            .ceil()
            .clamp(i64::MIN as f64, i64::MAX as f64) as i64
    };
    let mut spans: Vec<(i64, i64)> = lane
        .atoms
        .iter()
        .filter_map(|a| {
            let window = a.ind?;
            let (from, to) = (edge(window.l.value()), edge(window.r.value()));
            (from < to).then_some((from, to))
        })
        .collect();
    spans.sort_unstable();
    let mut merged: Vec<(i64, i64)> = Vec::with_capacity(spans.len());
    for (from, to) in spans {
        match merged.last_mut() {
            Some(held) if from <= held.1 => held.1 = held.1.max(to),
            _ => merged.push((from, to)),
        }
    }
    Some(merged)
}