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
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164

// SPDX-License-Identifier: MIT
// Copyright (c) "2023" . Marvin Hansen <marvin.hansen@gmail.com> All rights reserved.

use super::*;

impl<'l, D, S, T, ST> ContextuableGraph<'l, D, S, T, ST> for Context<'l, D, S, T, ST>
    where
        D: Datable,
        S: Spatial,
        T: Temporal,
        ST: SpaceTemporal,
{
    /// Ads a new Contextoid to the context.
    /// You can add the same contextoid multiple times,
    /// but each one will return a new and unique node index.
    fn add_node(
        &mut self,
        value: Contextoid<D, S, T, ST>,
    )
        -> usize
    {
        self.graph.add_node(value)
    }

    /// Returns only true if the context contains the contextoid with the given index.
    fn contains_node(
        &self,
        index: usize,
    )
        -> bool
    {
        self.graph.contains_node(index)
    }

    /// Returns a reference to the contextoid with the given index.
    /// If the context does not contain the contextoid, it will return None.
    fn get_node(
        &self,
        index: usize,
    )
        -> Option<&Contextoid<D, S, T, ST>>
    {
        self.graph.get_node(index)
    }

    /// Removes a contextoid from the context.
    /// Returns ContextIndexError if the index is not found
    fn remove_node(
        &mut self,
        index: usize,
    )
        -> Result<(), ContextIndexError>
    {
        if !self.contains_node(index) {
            return Err(ContextIndexError(format!("index {} not found", index)));
        };

        if self.graph.remove_node(index).is_err() {
            return Err(ContextIndexError(format!("index {} not found", index)));
        };

        Ok(())
    }

    /// Adds a new weighted edge between two nodes.
    /// Returns either Ok after success, or ContextIndexError if
    /// any of the nodes are not in the context.
    fn add_edge(
        &mut self,
        a: usize,
        b: usize,
        weight: RelationKind,
    )
        -> Result<(), ContextIndexError>
    {
        if !self.contains_node(a) {
            return Err(ContextIndexError(format!("index a {} not found", a)));
        };

        if !self.contains_node(b) {
            return Err(ContextIndexError(format!("index b {} not found", b)));
        };

        if self.graph.add_edge_with_weight(a, b, weight as u64).is_err() {
            return Err(ContextIndexError(format!("Failed to add edge for index a {} and b {}", a, b)));
        }

        Ok(())
    }

    /// Returns only true if the context contains the edge between the two nodes.
    /// If the context does not contain the edge or any of the nodes it will return false.
    /// You may want to call contains_node first to ascertain that the nodes are in the context.
    fn contains_edge(
        &self,
        a: usize,
        b: usize,
    )
        -> bool
    {
        self.graph.contains_edge(a, b)
    }

    /// Removes an edge between two nodes.
    /// Returns either Ok after success, or ContextIndexError if
    /// any of the nodes are not in the context.
    fn remove_edge(
        &mut self,
        a: usize,
        b: usize,
    )
        -> Result<(), ContextIndexError>
    {
        if !self.contains_node(a) {
            return Err(ContextIndexError("index a not found".into()));
        };

        if !self.contains_node(b) {
            return Err(ContextIndexError("index b not found".into()));
        };

        if self.graph.remove_edge(a, b).is_err() {
            return Err(ContextIndexError(format!("Failed to remove edge for index a {} and b {}", a, b)));
        }

        Ok(())
    }

    /// Returns the number of nodes in the context. Alias for node_count().
    fn size(
        &self
    )
        -> usize
    {
        self.graph.size()
    }

    /// Returns true if the context contains no nodes.
    fn is_empty(
        &self
    )
        -> bool
    {
        self.graph.is_empty()
    }

    /// Returns the number of nodes in the context.
    fn node_count(
        &self
    )
        -> usize
    {
        self.graph.number_nodes()
    }

    /// Returns the number of edges in the context.
    fn edge_count(
        &self
    )
        -> usize
    {
        self.graph.number_edges()
    }
}