harmos-runtime 0.1.2

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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119

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

/* === Modules === */

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

/* === Imports === */

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

// Local Imports
use crate::{Error, Result};

/* === Constants === */

/* === Macros === */

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

/* === Structs === */

#[derive(Default)]
pub(super) struct Lanes {
    edges: Mutex<BTreeMap<(&'static str, &'static str), usize>>,
}

#[derive(Clone)]
pub(super) struct Admission {
    held: Arc<[&'static str]>,
    _claim: Arc<Claim>,
}

struct Claim {
    lanes: Weak<Lanes>,
    edges: Vec<(&'static str, &'static str)>,
}

/* === Enums === */

/* === Traits === */

/* === Implementations === */

impl Lanes {
    pub(super) fn admit(self: &Arc<Self>, ancestors: &[&'static str], lane: &'static str, bounded: bool) -> Result<Admission> {
        let dependencies = if bounded { ancestors.iter().map(|&parent| (parent, lane)).collect::<Vec<_>>() } else { Vec::new() };
        let mut edges = self.edges.lock().expect("operation lane graph is healthy");

        // Validate the whole claim before mutating counts. Checking the reverse
        // path also catches two independent roots calling each other's lane.
        for &(parent, child) in &dependencies {
            if reaches(&edges, child, parent) {
                return Err(Error::OperationLaneCycle { parent, child });
            }
        }
        for &edge in &dependencies {
            *edges.entry(edge).or_default() += 1;
        }
        drop(edges);

        let mut held = ancestors.to_vec();
        if bounded {
            held.push(lane);
        }
        Ok(Admission { held: held.into(), _claim: Arc::new(Claim { lanes: Arc::downgrade(self), edges: dependencies }) })
    }
}

impl Admission {
    pub(super) fn held(&self) -> &[&'static str] {
        &self.held
    }
}

impl Drop for Claim {
    fn drop(&mut self) {
        let Some(lanes) = self.lanes.upgrade() else {
            return;
        };
        let mut edges = lanes.edges.lock().expect("operation lane graph is healthy");
        for edge in &self.edges {
            let count = edges.get_mut(edge).expect("admitted dependency is retained");
            *count -= 1;
            if *count == 0 {
                edges.remove(edge);
            }
        }
    }
}

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

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

fn reaches(edges: &BTreeMap<(&'static str, &'static str), usize>, from: &'static str, to: &'static str) -> bool {
    let mut pending = vec![from];
    let mut visited = BTreeSet::new();
    while let Some(lane) = pending.pop() {
        if lane == to {
            return true;
        }
        if visited.insert(lane) {
            pending.extend(edges.keys().filter_map(|&(parent, child)| (parent == lane).then_some(child)));
        }
    }
    false
}

/* === Tests === */