pr4xis 0.29.1

Axiomatic Intelligence — an ontology + category-theory reasoning engine: every claim derived from explicit axioms, with a proof path back to them
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

use crate::logic::proof::Verdict;

use super::action::Action;

/// A single entry in the trace log — typed over the Action (#161).
///
/// Fields carry the typed situation and action directly (previously all
/// `String`); preconditions' check results are typed `Verdict`s
/// (previously `PreconditionResult` with String fields). No primitive
/// leaks.
#[derive(Debug)]
pub struct TraceEntry<A: Action> {
    pub step: usize,
    pub situation_before: A::Sit,
    pub action: A,
    pub precondition_verdicts: Vec<Verdict>,
    pub situation_after: Option<A::Sit>,
}

impl<A: Action> TraceEntry<A> {
    /// Did every precondition pass?
    pub fn preconditions_all_hold(&self) -> bool {
        self.precondition_verdicts.iter().all(|v| v.is_ok())
    }

    /// Did the action actually apply? (Preconditions passed AND apply
    /// produced a new situation.)
    pub fn applied(&self) -> bool {
        self.situation_after.is_some() && self.preconditions_all_hold()
    }
}

/// A trace of actions applied to situations — full history for debugging.
///
/// Typed over the Action (#161) — carries typed situations and actions,
/// not Strings.
#[derive(Debug)]
pub struct Trace<A: Action> {
    entries: Vec<TraceEntry<A>>,
}

impl<A: Action> Default for Trace<A> {
    fn default() -> Self {
        Self {
            entries: Vec::new(),
        }
    }
}

impl<A: Action> Trace<A> {
    pub fn new() -> Self {
        Self::default()
    }

    /// All trace entries as a slice.
    pub fn entries(&self) -> &[TraceEntry<A>] {
        &self.entries
    }

    pub fn record(&mut self, entry: TraceEntry<A>) {
        self.entries.push(entry);
    }

    /// Number of successful steps.
    pub fn successful_steps(&self) -> usize {
        self.entries.iter().filter(|e| e.applied()).count()
    }

    /// Number of failed steps (violations).
    pub fn violations(&self) -> usize {
        self.entries.iter().filter(|e| !e.applied()).count()
    }

    /// All violation entries.
    pub fn violation_entries(&self) -> Vec<&TraceEntry<A>> {
        self.entries.iter().filter(|e| !e.applied()).collect()
    }

    /// Last entry.
    pub fn last(&self) -> Option<&TraceEntry<A>> {
        self.entries.last()
    }
}