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
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
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216

use super::*;

#[test]
fn graph_diff_roundtrips_when_adding_a_port_to_existing_node() {
    let mut from = Graph::default();
    let a = NodeId::new();
    insert_node(&mut from, a, "core.a");

    let out = PortId::from_u128(35);
    let mut to = from.clone();
    insert_port(&mut to, out, a, "out", PortDirection::Out);

    let tx = graph_diff(&from, &to);
    let add_index = tx
        .ops()
        .iter()
        .position(|op| matches!(op, GraphOp::AddPort { id, .. } if *id == out))
        .expect("diff must add the new port");
    let order_index = tx
        .ops()
        .iter()
        .position(|op| matches!(op, GraphOp::SetNodePorts { id, .. } if *id == a))
        .expect("diff must attach the new port to its owner order");
    assert!(
        add_index < order_index,
        "diff must add the port before attaching it to node.ports"
    );

    let mut patched = from.clone();
    apply_transaction(&mut patched, &tx).expect("apply diff");
    assert_eq!(
        serde_json::to_value(&patched).unwrap(),
        serde_json::to_value(&to).unwrap(),
        "diff must roundtrip"
    );

    let inverse = invert_transaction(&tx);
    apply_transaction(&mut patched, &inverse).expect("apply inverse");
    assert_eq!(
        serde_json::to_value(&patched).unwrap(),
        serde_json::to_value(&from).unwrap(),
        "diff inverse must restore the source graph"
    );
}

#[test]
fn graph_diff_inverse_roundtrips_when_adding_ports_and_edge() {
    let mut from = Graph::default();
    let a = NodeId::new();
    let b = NodeId::new();
    insert_node(&mut from, a, "core.a");
    insert_node(&mut from, b, "core.b");

    let out = PortId::from_u128(41);
    let inn = PortId::from_u128(42);
    let edge_id = EdgeId::from_u128(43);
    let mut to = from.clone();
    insert_port(&mut to, out, a, "out", PortDirection::Out);
    insert_port(&mut to, inn, b, "in", PortDirection::In);
    to.edges.insert(edge_id, make_edge(out, inn));

    let tx = graph_diff(&from, &to);
    let mut patched = from.clone();
    apply_transaction(&mut patched, &tx).expect("apply diff");
    assert_eq!(
        serde_json::to_value(&patched).unwrap(),
        serde_json::to_value(&to).unwrap(),
        "diff must roundtrip"
    );

    let inverse = invert_transaction(&tx);
    apply_transaction(&mut patched, &inverse).expect("apply inverse");
    assert_eq!(
        serde_json::to_value(&patched).unwrap(),
        serde_json::to_value(&from).unwrap(),
        "diff inverse must restore the source graph"
    );
}

#[test]
fn graph_diff_inverse_roundtrips_when_deleted_node_port_moves_to_existing_node() {
    let mut from = Graph::default();
    let a = NodeId::new();
    let b = NodeId::new();
    insert_node(&mut from, a, "core.a");
    insert_node(&mut from, b, "core.b");

    let moved = PortId::from_u128(44);
    insert_port(&mut from, moved, a, "moved", PortDirection::Out);

    let mut to = from.clone();
    to.nodes.remove(&a);
    insert_port(&mut to, moved, b, "moved", PortDirection::Out);

    let tx = graph_diff(&from, &to);
    let mut patched = from.clone();
    apply_transaction(&mut patched, &tx).expect("apply diff");
    assert_eq!(
        serde_json::to_value(&patched).unwrap(),
        serde_json::to_value(&to).unwrap(),
        "diff must roundtrip"
    );

    let inverse = invert_transaction(&tx);
    apply_transaction(&mut patched, &inverse).expect("apply inverse");
    assert_eq!(
        serde_json::to_value(&patched).unwrap(),
        serde_json::to_value(&from).unwrap(),
        "diff inverse must restore the source graph"
    );
}

#[test]
fn graph_diff_inverse_roundtrips_when_port_moves_between_existing_nodes() {
    let mut from = Graph::default();
    let a = NodeId::new();
    let b = NodeId::new();
    insert_node(&mut from, a, "core.a");
    insert_node(&mut from, b, "core.b");

    let moved = PortId::from_u128(45);
    insert_port(&mut from, moved, a, "moved", PortDirection::Out);

    let mut to = from.clone();
    to.ports
        .insert(moved, make_port(b, "moved", PortDirection::Out));
    to.nodes.get_mut(&a).unwrap().ports.clear();
    to.nodes.get_mut(&b).unwrap().ports.push(moved);

    let tx = graph_diff(&from, &to);
    let mut patched = from.clone();
    apply_transaction(&mut patched, &tx).expect("apply diff");
    assert_eq!(
        serde_json::to_value(&patched).unwrap(),
        serde_json::to_value(&to).unwrap(),
        "diff must roundtrip"
    );

    let inverse = invert_transaction(&tx);
    apply_transaction(&mut patched, &inverse).expect("apply inverse");
    assert_eq!(
        serde_json::to_value(&patched).unwrap(),
        serde_json::to_value(&from).unwrap(),
        "diff inverse must restore the source graph"
    );
}

#[test]
fn graph_diff_inverse_roundtrips_when_node_port_membership_is_replaced() {
    let mut from = Graph::default();
    let a = NodeId::new();
    insert_node(&mut from, a, "core.a");

    let old = PortId::from_u128(36);
    let kept = PortId::from_u128(37);
    let new = PortId::from_u128(38);
    insert_port(&mut from, old, a, "old", PortDirection::Out);
    insert_port(&mut from, kept, a, "kept", PortDirection::Out);

    let mut to = from.clone();
    to.ports.remove(&old);
    to.ports
        .insert(new, make_port(a, "new", PortDirection::Out));
    to.nodes.get_mut(&a).unwrap().ports = vec![kept, new];

    let tx = graph_diff(&from, &to);
    let mut patched = from.clone();
    apply_transaction(&mut patched, &tx).expect("apply diff");
    assert_eq!(
        serde_json::to_value(&patched).unwrap(),
        serde_json::to_value(&to).unwrap(),
        "diff must roundtrip"
    );

    let inverse = invert_transaction(&tx);
    apply_transaction(&mut patched, &inverse).expect("apply inverse");
    assert_eq!(
        serde_json::to_value(&patched).unwrap(),
        serde_json::to_value(&from).unwrap(),
        "diff inverse must restore the source graph"
    );
}

#[test]
fn graph_diff_inverse_roundtrips_when_structural_port_replacement_adds_sibling_port() {
    let mut from = Graph::default();
    let a = NodeId::new();
    insert_node(&mut from, a, "core.a");

    let replaced = PortId::from_u128(39);
    let added = PortId::from_u128(40);
    insert_port(&mut from, replaced, a, "old", PortDirection::Out);

    let mut to = from.clone();
    to.ports.get_mut(&replaced).unwrap().key = PortKey::new("renamed");
    to.ports
        .insert(added, make_port(a, "added", PortDirection::Out));
    to.nodes.get_mut(&a).unwrap().ports = vec![replaced, added];

    let tx = graph_diff(&from, &to);
    let mut patched = from.clone();
    apply_transaction(&mut patched, &tx).expect("apply diff");
    assert_eq!(
        serde_json::to_value(&patched).unwrap(),
        serde_json::to_value(&to).unwrap(),
        "diff must roundtrip"
    );

    let inverse = invert_transaction(&tx);
    apply_transaction(&mut patched, &inverse).expect("apply inverse");
    assert_eq!(
        serde_json::to_value(&patched).unwrap(),
        serde_json::to_value(&from).unwrap(),
        "diff inverse must restore the source graph"
    );
}