kmp-domain 0.18.1

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

use std::collections::BTreeSet;

use crate::DomainError;

/// Explicit history entries to select; scope, clocks and proof remain separate.
#[derive(Debug, Clone, PartialEq, Eq)]
pub struct TemporalEntrySelection {
    refs: BTreeSet<String>,
}

impl TemporalEntrySelection {
    pub fn new(refs: Vec<String>) -> Result<Self, DomainError> {
        if refs.is_empty() {
            return Err(DomainError::InvalidState(
                "temporal refs must be non-empty; omit refs to select all matching entries".into(),
            ));
        }
        if refs
            .iter()
            .any(|value| value.is_empty() || value.trim() != value)
        {
            return Err(DomainError::InvalidState(
                "temporal refs must contain non-blank references without surrounding whitespace"
                    .into(),
            ));
        }
        let count = refs.len();
        let refs = refs.into_iter().collect::<BTreeSet<_>>();
        if refs.len() != count {
            return Err(DomainError::InvalidState(
                "temporal refs must be unique".into(),
            ));
        }
        Ok(Self { refs })
    }

    pub fn admits(&self, reference: &str) -> bool {
        self.refs.contains(reference)
    }
}