shifty-algebra 0.2.3

Core SHACL formalism IR: path algebra, shape grammar, selectors, schema, and reference semantics
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

//! RDF term aliases and node-kind sets (doc 00 §1).
//!
//! We reuse `oxrdf`'s term types rather than reinvent them: `NamedNode` (IRIs),
//! `BlankNode`, `Literal`, and the `Term` sum. In the formalism's vocabulary,
//! nodes `N = IRI ∪ Blank`, values `V = Literal`, and predicates `P = K = IRI`.

pub use oxrdf::{BlankNode, Literal, NamedNode, Term};
use serde::{Deserialize, Serialize};

/// The set of RDF node kinds a term may have, for `sh:nodeKind`
/// (gap-analysis **K1** — the paper drops node-kind because it hides node
/// identity). The six W3C node-kind values are the non-empty combinations
/// exposed as associated constants.
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash, Serialize, Deserialize)]
pub struct NodeKindSet {
    pub iri: bool,
    pub blank: bool,
    pub literal: bool,
}

impl NodeKindSet {
    pub const IRI: Self = Self {
        iri: true,
        blank: false,
        literal: false,
    };
    pub const BLANK_NODE: Self = Self {
        iri: false,
        blank: true,
        literal: false,
    };
    pub const LITERAL: Self = Self {
        iri: false,
        blank: false,
        literal: true,
    };
    pub const BLANK_NODE_OR_IRI: Self = Self {
        iri: true,
        blank: true,
        literal: false,
    };
    pub const BLANK_NODE_OR_LITERAL: Self = Self {
        iri: false,
        blank: true,
        literal: true,
    };
    pub const IRI_OR_LITERAL: Self = Self {
        iri: true,
        blank: false,
        literal: true,
    };

    /// Does `term` have one of the kinds in this set?
    pub fn matches(&self, term: &Term) -> bool {
        match term {
            Term::NamedNode(_) => self.iri,
            Term::BlankNode(_) => self.blank,
            Term::Literal(_) => self.literal,
        }
    }

    pub fn complement(self) -> NodeKindSet {
        NodeKindSet {
            iri: !self.iri,
            blank: !self.blank,
            literal: !self.literal,
        }
    }

    pub fn is_empty(self) -> bool {
        !self.iri && !self.blank && !self.literal
    }
}