shacl_validation 0.2.12

RDF data shapes implementation in Rust
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

use rudof_rdf::rdf_core::{Rdf, term::Object};

use crate::{focus_nodes::FocusNodes, value_nodes::ValueNodes};

/// Abstraction over the possible itaration strategies when validating
pub trait IterationStrategy<S: Rdf> {
    type Item;

    fn iterate<'a>(
        &'a self,
        value_nodes: &'a ValueNodes<S>,
    ) -> Box<dyn Iterator<Item = (&'a S::Term, &'a Self::Item)> + 'a>;

    fn to_value(&self, item: &Self::Item) -> Option<S::Term>;

    fn to_object(&self, item: &Self::Item) -> Option<Object> {
        match self.to_value(item) {
            None => None,
            Some(value) => S::term_as_object(&value).ok(),
        }
    }
}

pub struct FocusNodeIteration;

impl<S: Rdf> IterationStrategy<S> for FocusNodeIteration {
    type Item = FocusNodes<S>;

    fn iterate<'a>(
        &'a self,
        value_nodes: &'a ValueNodes<S>,
    ) -> Box<dyn Iterator<Item = (&'a S::Term, &'a Self::Item)> + 'a> {
        Box::new(value_nodes.iter())
    }

    fn to_value(&self, _item: &Self::Item) -> Option<S::Term> {
        None
    }
}

pub struct ValueNodeIteration;

impl<S: Rdf> IterationStrategy<S> for ValueNodeIteration {
    type Item = S::Term;

    fn iterate<'a>(
        &'a self,
        value_nodes: &'a ValueNodes<S>,
    ) -> Box<dyn Iterator<Item = (&'a S::Term, &'a Self::Item)> + 'a> {
        Box::new(
            value_nodes.iter().flat_map(|(focus_node, value_nodes)| {
                value_nodes.iter().map(move |value_node| (focus_node, value_node))
            }),
        )
    }

    fn to_value(&self, item: &Self::Item) -> Option<<S as Rdf>::Term> {
        Some(item.clone())
    }
}