kmp-domain 0.18.2

Domain model of the Kernel Memory Protocol: aggregates, value objects, repositories and projections, with no IO
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

use super::{EvidencePathCandidate, EvidencePathGroup, EvidencePathStatus};
use crate::{NodeRelationProjection, TraceSearchStop};

/// Native discovery and joint compatibility over one reader snapshot.
#[derive(Debug, Clone, PartialEq, Eq)]
pub struct EvidencePathResult {
    pub proof: Option<crate::TraceProofResult>,
    pub from: String,
    pub context_discovery: bool,
    pub relations: Vec<NodeRelationProjection>,
    pub candidates: Vec<EvidencePathCandidate>,
    pub groups: Vec<EvidencePathGroup>,
    pub missing_roles: Vec<String>,
    pub status: EvidencePathStatus,
    pub stop: TraceSearchStop,
    pub discovered_nodes: u32,
    pub scanned_edges: u32,
    pub work_states: u32,
    pub shared_states: u32,
    pub incompatible_states: u32,
    pub adjacency_pages: u32,
    pub coordinate_pages: u32,
    pub resolved_as_of: Option<String>,
    pub temporal_selection_resolved: bool,
    pub clock_unknown_edges: Vec<u32>,
}

impl EvidencePathResult {
    pub fn known_complete(&self) -> bool {
        !self.context_discovery
            && self.status != EvidencePathStatus::Partial
            && self
                .groups
                .iter()
                .any(|g| g.bindings.missing.is_empty() && !g.clock_unknown)
    }
    pub fn viable_candidates(&self) -> std::collections::BTreeSet<u32> {
        self.groups
            .iter()
            .flat_map(|g| g.candidate_indexes.iter().copied())
            .collect()
    }
}