jellyflow-runtime 0.2.0

Headless store, rules, schema, profile, and change pipeline for Jellyflow.
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
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
165

use super::super::{HandleConnection, NodeGraphLookups};
use jellyflow_core::core::Graph;
use jellyflow_core::core::{Edge, EdgeId, EdgeKind, EdgeReconnectable};
use jellyflow_core::ops::EdgeEndpoints;

impl NodeGraphLookups {
    pub(super) fn apply_add_edge(&mut self, graph: &Graph, id: EdgeId) -> bool {
        let Some(edge) = graph.edges.get(&id) else {
            return false;
        };
        self.insert_edge_lookup_from_parts(
            graph,
            id,
            edge.kind,
            EdgeEndpoints::from_edge(edge),
            edge.reconnectable,
        )
    }

    pub(super) fn apply_remove_edge(&mut self, id: EdgeId) -> bool {
        self.remove_edge_from_lookups(id);
        true
    }

    pub(super) fn remove_edge_from_lookups(&mut self, edge_id: EdgeId) {
        if let Some(conn) = self.connection_from_edge_lookup(edge_id) {
            self.remove_edge_connection(conn);
        } else {
            self.slow_remove_edge_from_connection_lookup(edge_id);
        }
        self.edge_lookup.remove(&edge_id);
    }

    pub(super) fn remove_edges_from_lookups(&mut self, edges: &[(EdgeId, Edge)]) {
        for (edge_id, _edge) in edges {
            self.remove_edge_from_lookups(*edge_id);
        }
    }

    pub(super) fn apply_set_edge_kind(
        &mut self,
        graph: &Graph,
        id: EdgeId,
        kind: EdgeKind,
    ) -> bool {
        if let Some(e) = self.edge_lookup.get_mut(&id) {
            e.kind = kind;
        } else {
            let Some(edge) = graph.edges.get(&id) else {
                return false;
            };
            return self.recover_edge_lookup_from_graph(graph, id, kind, edge.reconnectable);
        }
        if let Some(conn) = self.connection_from_edge_lookup(id) {
            self.add_edge_connection(conn);
        }
        true
    }

    pub(super) fn apply_set_edge_reconnectable(
        &mut self,
        graph: &Graph,
        id: EdgeId,
        reconnectable: Option<EdgeReconnectable>,
    ) -> bool {
        if let Some(e) = self.edge_lookup.get_mut(&id) {
            e.reconnectable = reconnectable;
            if let Some(conn) = self.connection_from_edge_lookup(id) {
                self.add_edge_connection(conn);
            }
            return true;
        }
        let Some(edge) = graph.edges.get(&id) else {
            return false;
        };
        self.recover_edge_lookup_from_graph(graph, id, edge.kind, reconnectable)
    }

    fn recover_edge_lookup_from_graph(
        &mut self,
        graph: &Graph,
        id: EdgeId,
        kind: EdgeKind,
        reconnectable: Option<EdgeReconnectable>,
    ) -> bool {
        let Some(edge) = graph.edges.get(&id) else {
            return false;
        };
        self.insert_edge_lookup_from_parts(
            graph,
            id,
            kind,
            EdgeEndpoints::from_edge(edge),
            reconnectable,
        )
    }

    pub(super) fn apply_set_edge_endpoints(
        &mut self,
        graph: &Graph,
        id: EdgeId,
        _from: EdgeEndpoints,
        to: EdgeEndpoints,
    ) -> bool {
        if let Some(prev) = self.edge_lookup.get(&id).copied() {
            self.remove_edge_connection(HandleConnection::from_edge_lookup(id, prev));
        } else {
            self.slow_remove_edge_from_connection_lookup(id);
        }

        let Some(kind) = self.edge_kind_for_endpoint_update(graph, id) else {
            return false;
        };

        self.insert_edge_lookup_from_parts(
            graph,
            id,
            kind,
            to,
            self.edge_reconnectable_for_endpoint_update(graph, id),
        )
    }

    fn insert_edge_lookup_from_parts(
        &mut self,
        graph: &Graph,
        id: EdgeId,
        kind: EdgeKind,
        endpoints: EdgeEndpoints,
        reconnectable: Option<EdgeReconnectable>,
    ) -> bool {
        let Some((entry, conn)) =
            Self::edge_lookup_entry_from_graph(graph, id, kind, endpoints, reconnectable)
        else {
            return false;
        };
        self.edge_lookup.insert(id, entry);
        self.add_edge_connection(conn);
        true
    }

    fn edge_kind_for_endpoint_update(&self, graph: &Graph, id: EdgeId) -> Option<EdgeKind> {
        graph
            .edges
            .get(&id)
            .map(|edge| edge.kind)
            .or_else(|| self.edge_lookup.get(&id).map(|entry| entry.kind))
    }

    fn edge_reconnectable_for_endpoint_update(
        &self,
        graph: &Graph,
        id: EdgeId,
    ) -> Option<EdgeReconnectable> {
        graph
            .edges
            .get(&id)
            .and_then(|edge| edge.reconnectable)
            .or_else(|| {
                self.edge_lookup
                    .get(&id)
                    .and_then(|entry| entry.reconnectable)
            })
    }
}