terminus-store 0.17.1

a triple store library
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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125

use super::*;
use std::sync::Arc;

use crate::structure::*;

#[derive(Clone)]
pub struct RollupLayer {
    internal: Arc<InternalLayer>,
    original: [u32; 5],
    original_parent: Option<[u32; 5]>, // TODO something with a light delta structure for answering delta queries?
}

impl RollupLayer {
    pub fn from_base_layer(
        layer: Arc<InternalLayer>,
        original: [u32; 5],
        original_parent: Option<[u32; 5]>,
    ) -> Self {
        Self {
            internal: layer,
            original,
            original_parent,
        }
    }

    pub fn from_child_layer(
        layer: Arc<InternalLayer>,
        original: [u32; 5],
        original_parent: [u32; 5],
    ) -> Self {
        Self {
            internal: layer,
            original,
            original_parent: Some(original_parent),
        }
    }
}

impl InternalLayerImpl for RollupLayer {
    fn name(&self) -> [u32; 5] {
        self.original
    }

    fn parent_name(&self) -> Option<[u32; 5]> {
        self.original_parent
    }

    fn immediate_parent(&self) -> Option<&InternalLayer> {
        self.internal.immediate_parent()
    }

    fn node_dictionary(&self) -> &PfcDict {
        self.internal.node_dictionary()
    }
    fn predicate_dictionary(&self) -> &PfcDict {
        self.internal.predicate_dictionary()
    }
    fn value_dictionary(&self) -> &PfcDict {
        self.internal.value_dictionary()
    }

    fn node_value_id_map(&self) -> &IdMap {
        self.internal.node_value_id_map()
    }

    fn predicate_id_map(&self) -> &IdMap {
        self.internal.predicate_id_map()
    }

    fn parent_node_value_count(&self) -> usize {
        self.internal.parent_node_value_count()
    }

    fn parent_predicate_count(&self) -> usize {
        self.internal.parent_predicate_count()
    }

    fn pos_s_p_adjacency_list(&self) -> &AdjacencyList {
        self.internal.pos_s_p_adjacency_list()
    }

    fn pos_sp_o_adjacency_list(&self) -> &AdjacencyList {
        self.internal.pos_sp_o_adjacency_list()
    }

    fn pos_o_ps_adjacency_list(&self) -> &AdjacencyList {
        self.internal.pos_o_ps_adjacency_list()
    }

    fn neg_s_p_adjacency_list(&self) -> Option<&AdjacencyList> {
        self.internal.neg_s_p_adjacency_list()
    }

    fn neg_sp_o_adjacency_list(&self) -> Option<&AdjacencyList> {
        self.internal.neg_sp_o_adjacency_list()
    }

    fn neg_o_ps_adjacency_list(&self) -> Option<&AdjacencyList> {
        self.internal.neg_o_ps_adjacency_list()
    }

    fn pos_predicate_wavelet_tree(&self) -> &WaveletTree {
        self.internal.pos_predicate_wavelet_tree()
    }

    fn neg_predicate_wavelet_tree(&self) -> Option<&WaveletTree> {
        self.internal.neg_predicate_wavelet_tree()
    }

    fn pos_subjects(&self) -> Option<&MonotonicLogArray> {
        self.internal.pos_subjects()
    }

    fn pos_objects(&self) -> Option<&MonotonicLogArray> {
        self.internal.pos_objects()
    }

    fn neg_subjects(&self) -> Option<&MonotonicLogArray> {
        self.internal.neg_subjects()
    }

    fn neg_objects(&self) -> Option<&MonotonicLogArray> {
        self.internal.neg_objects()
    }
}