kmp-domain 0.18.3

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
44

use crate::{DomainError, GraphReadRevision, TraceSearchLimits};

/// Distinct nodes one batch may touch: the requested refs plus every
/// coordinate scope reached through them. Reaching it stops the batch with
/// `node_budget`; refs left unread are reported as omitted, never as missing.
const NODE_BATCH_NODE_BUDGET: u32 = 4096;

/// Already selected references whose headers and coordinates are needed together.
/// This read never loads canonical bodies or claims to assemble complete proof.
#[derive(Debug, Clone, PartialEq, Eq)]
pub struct MemoryNodesRequest {
    pub about: String,
    pub refs: Vec<String>,
    pub max_edges: u32,
    /// Optional identity from a preceding batch; adapters reject changed stores.
    pub expect_snapshot: Option<GraphReadRevision>,
}

impl MemoryNodesRequest {
    pub fn validate(&self) -> Result<(), DomainError> {
        if self.about.trim().is_empty()
            || self.refs.is_empty()
            || self.refs.len() > 64
            || self
                .refs
                .iter()
                .any(|r| r.trim().is_empty() || r.trim() != r)
            || !(1..=32768).contains(&self.max_edges)
        {
            return Err(DomainError::InvalidState(
                "node batch requires an about, 1..64 nonblank refs without surrounding whitespace and max_edges 1..32768".into(),
            ));
        }
        Ok(())
    }

    pub(super) fn limits(&self) -> TraceSearchLimits {
        TraceSearchLimits {
            nodes: NODE_BATCH_NODE_BUDGET,
            edges: self.max_edges,
            ..Default::default()
        }
    }
}