sva-engine 0.7.2

Renders a resolved graph into per-node buffers a query can be asked of
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

// Concern: which stored samples a window asks that no stored value holds yet, and laying them in | Non-concern: reading them off a store | IO: (Table, window) -> wants; (key, samples) -> ()

use std::sync::Arc;

use sva_formula::Hash;
use sva_samples::{Buffer, Extent};

use super::Table;
use super::value::Kind;
use crate::cache::Stored;

impl Table {
    /// One stretch per stored run that `window` asks and no value holds.
    pub(crate) fn wants(&self, window: Extent) -> Vec<(Arc<Stored>, Extent)> {
        let needs = self.demand(window);
        let mut out = Vec::new();
        for (value, need) in self.values.iter().zip(&needs) {
            let Kind::Stored(stored) = &value.kind else {
                continue;
            };
            let covers = value.covers();
            let lacks = need.hold.minus(&value.holding());
            for run in covers.iter() {
                let asked = lacks.intersect(run);
                if !asked.is_empty() {
                    out.push((Arc::clone(stored), asked.hull()));
                }
            }
        }
        out
    }

    pub(crate) fn took(&mut self, key: Hash, samples: Vec<Buffer>) {
        for value in &mut self.values {
            let Kind::Stored(stored) = &value.kind else {
                continue;
            };
            if stored.key != key {
                continue;
            }
            let lacks = value.covers();
            let lacks = lacks.minus(&value.holding());
            for part in &samples {
                for e in lacks.intersect(part.extent()).iter() {
                    value.hold(part.over(e, part.extent()));
                }
            }
        }
    }
}