jellyflow-core 0.2.0

Headless graph model, IDs, type descriptors, and interaction policy primitives 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

use super::GraphDiffPlanner;
use crate::core::{Edge, EdgeId};
use crate::ops::{EdgeEndpoints, GraphMutationPlanner, GraphOp};

impl<'a> GraphDiffPlanner<'a> {
    pub(super) fn diff_edges(&mut self) {
        let from = self.from;
        let to = self.to;

        for (id, edge_to) in &to.edges {
            if let Some(edge_from) = from.edges.get(id) {
                if self.removed_edges_by_cascade.contains(id) {
                    // Prior node/port ops already removed the original edge. Restore the target
                    // edge shape instead of patching a missing intermediate edge with setters.
                    if !self.restored_edges_by_cascade.contains(id) {
                        self.push_op(GraphOp::AddEdge {
                            id: *id,
                            edge: edge_to.clone(),
                        });
                        self.restored_edges_by_cascade.insert(*id);
                    }
                    continue;
                }
                self.diff_existing_edge(*id, edge_from, edge_to);
            } else {
                self.push_op(GraphOp::AddEdge {
                    id: *id,
                    edge: edge_to.clone(),
                });
            }
        }

        self.diff_removed_edges();
    }

    fn diff_existing_edge(&mut self, id: EdgeId, edge_from: &Edge, edge_to: &Edge) {
        self.diff_edge_kind(id, edge_from, edge_to);
        self.diff_edge_endpoints(id, edge_from, edge_to);
        self.diff_edge_policy_fields(id, edge_from, edge_to);
    }

    fn diff_edge_kind(&mut self, id: EdgeId, edge_from: &Edge, edge_to: &Edge) {
        if edge_from.kind != edge_to.kind {
            self.push_op(GraphOp::SetEdgeKind {
                id,
                from: edge_from.kind,
                to: edge_to.kind,
            });
        }
    }

    fn diff_edge_endpoints(&mut self, id: EdgeId, edge_from: &Edge, edge_to: &Edge) {
        let from = EdgeEndpoints::from_edge(edge_from);
        let to = EdgeEndpoints::from_edge(edge_to);
        if from != to {
            self.push_op(GraphOp::SetEdgeEndpoints { id, from, to });
        }
    }

    fn diff_edge_policy_fields(&mut self, id: EdgeId, edge_from: &Edge, edge_to: &Edge) {
        if edge_from.selectable != edge_to.selectable {
            self.push_op(GraphOp::SetEdgeSelectable {
                id,
                from: edge_from.selectable,
                to: edge_to.selectable,
            });
        }
        if edge_from.focusable != edge_to.focusable {
            self.push_op(GraphOp::SetEdgeFocusable {
                id,
                from: edge_from.focusable,
                to: edge_to.focusable,
            });
        }
        if edge_from.hidden != edge_to.hidden {
            self.push_op(GraphOp::SetEdgeHidden {
                id,
                from: edge_from.hidden,
                to: edge_to.hidden,
            });
        }
        if edge_from.interaction_width != edge_to.interaction_width {
            self.push_op(GraphOp::SetEdgeInteractionWidth {
                id,
                from: edge_from.interaction_width,
                to: edge_to.interaction_width,
            });
        }
        if edge_from.deletable != edge_to.deletable {
            self.push_op(GraphOp::SetEdgeDeletable {
                id,
                from: edge_from.deletable,
                to: edge_to.deletable,
            });
        }
        if edge_from.reconnectable != edge_to.reconnectable {
            self.push_op(GraphOp::SetEdgeReconnectable {
                id,
                from: edge_from.reconnectable,
                to: edge_to.reconnectable,
            });
        }
    }

    fn diff_removed_edges(&mut self) {
        let from = self.from;
        let to = self.to;

        for (id, edge_from) in &from.edges {
            if to.edges.contains_key(id) || self.removed_edges_by_cascade.contains(id) {
                continue;
            }

            if let Ok(op) = GraphMutationPlanner::new(from).remove_edge_op(*id) {
                let op = self.with_target_removed_bindings(op);
                if let GraphOp::RemoveEdge { bindings, .. } = &op {
                    self.removed_bindings_by_cascade
                        .extend(bindings.iter().map(|(id, _)| *id));
                }
                self.push_op(op);
            } else {
                self.push_op(GraphOp::RemoveEdge {
                    id: *id,
                    edge: edge_from.clone(),
                    bindings: Vec::new(),
                });
            }
        }
    }
}