lsp-max 26.7.3

Law-state LSP runtime: max LSP 3.18 coverage, process-mining conformance, receipt-chain admission
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

use serde::{Deserialize, Serialize};

#[derive(Debug, Clone, Serialize, Deserialize, PartialEq, Eq)]
pub enum ProbeResult {
    Pass,
    Fail,
    Missing,
}

#[derive(Debug, Clone, Serialize, Deserialize, PartialEq, Eq)]
pub struct Witness {
    pub kind: String,
    pub evidence: String,
}

#[derive(Debug, Clone, Serialize, Deserialize, PartialEq, Eq)]
pub struct RepairAction {
    pub id: String,
    pub title: String,
    pub next_lawful_step: Option<String>,
    pub command: Option<String>,
    pub code_action: Option<String>,
    pub virtual_doc_uri: Option<String>,
}

#[derive(Debug, Clone, Serialize, Deserialize, PartialEq, Eq)]
pub enum Severity {
    Info,
    Warning,
    Stop,
    Refuse,
}

#[derive(Debug, Clone, Serialize, Deserialize, PartialEq, Eq)]
pub struct AndonInvariant {
    pub id: String,
    pub statement: String,
    pub scope: String,

    pub true_probe: Option<String>,
    pub false_probe: Option<String>,
    pub counterfactual_probe: Option<String>,

    pub witness_rule: Option<String>,
    pub repair_rule: Option<RepairAction>,

    pub severity: Severity,
    pub blocks: bool,
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct TruthTableRow {
    pub invariant_id: String,
    pub true_case: ProbeResult,
    pub false_case: ProbeResult,
    pub counterfactual_case: ProbeResult,
    pub witness: Option<Witness>,
    pub repair: Option<RepairAction>,
    pub verdict: ProbeResult,
    pub admission_allowed: bool,
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct TruthTable {
    pub rows: Vec<TruthTableRow>,
}

pub struct InvariantRegistry {
    invariants: Vec<AndonInvariant>,
}

impl InvariantRegistry {
    pub fn new() -> Self {
        Self {
            invariants: Vec::new(),
        }
    }

    pub fn empty() -> Self {
        Self::new()
    }

    pub fn register(&mut self, invariant: AndonInvariant) {
        self.invariants.push(invariant);
    }

    pub fn get_all(&self) -> &[AndonInvariant] {
        &self.invariants
    }

    pub fn is_empty(&self) -> bool {
        self.invariants.is_empty()
    }
}