sva-engine 0.7.17

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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84

// Concern: what a session's renders last typed, retyping only what changed since and its readers | Non-concern: lowering a node (typing/), memory (cache/) | IO: (Instances, Order) -> Typing

use std::collections::{BTreeMap, BTreeSet};

use crate::error::EngineError;
use crate::instantiate::{Instances, Resolution};
use crate::schedule::Order;
use crate::typing::Typing;

/// Renders made in turn: each types only what changed since the last, and what reads it.
#[derive(Default)]
pub struct Session {
    pub(super) own: Typed,
    /// The composition with every volatile parameter at its stand-in.
    pub(super) stand_in: Typed,
}

#[derive(Default)]
pub(crate) struct Typed {
    held: Option<Held>,
}

struct Held {
    rate: u32,
    typed: BTreeMap<String, Resolution>,
    typing: Typing,
}

impl Typed {
    /// On a refusal it holds what it held.
    pub(crate) fn typed(
        &mut self,
        instances: &Instances,
        order: &Order,
    ) -> Result<&Typing, EngineError> {
        let rate = instances.rate();
        let held = match self.held.take() {
            Some(held) if held.rate == rate => held,
            _ => Held {
                rate,
                typed: BTreeMap::new(),
                typing: Typing::default(),
            },
        };
        let held = self.held.insert(held);
        let now: BTreeMap<String, Resolution> = instances
            .paths()
            .filter_map(|path| Some((path.to_string(), instances.resolution(path)?)))
            .collect();
        let changed = now
            .iter()
            .filter(|(path, now)| held.typed.get(*path) != Some(now))
            .map(|(path, _)| path.clone());
        let region = upward(instances, changed.collect());
        let groups: Vec<Vec<String>> = order
            .groups
            .iter()
            .filter(|group| group.iter().any(|path| region.contains(path)))
            .cloned()
            .collect();
        if let Err(refused) = held.typing.lower(instances, &groups) {
            held.typing.abort();
            return Err(refused);
        }
        let gone = held.typed.keys().filter(|path| !now.contains_key(*path));
        held.typing.hide(gone.cloned().collect::<Vec<_>>());
        held.typing.commit(instances);
        held.typed = now;
        Ok(&held.typing)
    }
}

fn upward(instances: &Instances, changed: BTreeSet<String>) -> BTreeSet<String> {
    let mut region = changed;
    let mut open: Vec<String> = region.iter().cloned().collect();
    while let Some(at) = open.pop() {
        for reader in instances.readers(&at) {
            if region.insert(reader.to_string()) {
                open.push(reader.to_string());
            }
        }
    }
    region
}