harmos-runtime 0.1.6

Harmos runtime: managed state, undo, recovery, background work and typed streams.
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
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102

/* ***
 *
 * Harmos
 *
 * SPDX-License-Identifier: Apache-2.0
 *
 * ***
 */

/* === Modules === */

/* === Re-Exports === */

/* === Imports === */

// Standard Library Imports
use std::collections::{BTreeMap, BTreeSet};
// Third Party Imports

// Local Imports
use super::{Error, PluginDefinition, PluginGraph};

/* === Constants === */

/* === Macros === */

/* === Type Aliases === */

/* === Structs === */

#[derive(Clone, Debug, PartialEq, Eq)]
pub(super) struct ReloadImpact {
    stopping: Vec<PluginDefinition>,
    starting: Vec<PluginDefinition>,
}

/* === Enums === */

/* === Traits === */

/* === Implementations === */

impl PluginGraph {
    pub(super) fn reload(&self, next: Self, changed: impl IntoIterator<Item = String>) -> Result<ReloadImpact, Error> {
        let before = by_id(self);
        let after = by_id(&next);
        let mut affected = BTreeSet::new();

        for id in changed {
            if !before.contains_key(id.as_str()) && !after.contains_key(id.as_str()) {
                return Err(Error::Unknown { id });
            }
            affected.insert(id);
        }

        for id in before.keys().chain(after.keys()) {
            if before.get(id) != after.get(id) {
                affected.insert((*id).to_owned());
            }
        }

        loop {
            let previous = affected.len();
            for graph in [self, &next] {
                graph.topology.extend_dependents(&mut affected);
            }
            if affected.len() == previous {
                break;
            }
        }

        let stopping = self.ordered().iter().rev().filter(|artifact| affected.contains(&artifact.id)).cloned().collect();
        let starting = next.ordered().iter().filter(|artifact| affected.contains(&artifact.id)).cloned().collect();

        Ok(ReloadImpact { stopping, starting })
    }
}

impl ReloadImpact {
    pub(super) fn select(&mut self, selected: &BTreeSet<String>) {
        self.stopping.retain(|definition| selected.contains(&definition.id));
        self.starting.retain(|definition| selected.contains(&definition.id));
    }

    pub fn stopping(&self) -> &[PluginDefinition] {
        &self.stopping
    }

    pub fn starting(&self) -> &[PluginDefinition] {
        &self.starting
    }
}

/* === Public Functions === */

/* === Private Functions === */

fn by_id(plan: &PluginGraph) -> BTreeMap<&str, &PluginDefinition> {
    plan.ordered().iter().map(|artifact| (artifact.id.as_str(), artifact)).collect()
}

/* === Tests === */