jellyflow-core 0.1.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

use crate::core::{NodeId, Port, PortId};
use crate::ops::{GraphOp, GraphTransaction};

use super::GraphMutationPlanner;
use crate::ops::mutation::collect::{
    bindings_for_port_removal, incident_edges_for_port, remove_edge_ops_for_port,
};
use crate::ops::mutation::{GraphMutationError, PortInsert};

impl GraphMutationPlanner<'_> {
    pub fn add_port_tx(
        &self,
        id: PortId,
        port: Port,
        insert: PortInsert,
        label: impl Into<String>,
    ) -> Result<GraphTransaction, GraphMutationError> {
        Ok(GraphTransaction::new()
            .with_label(label)
            .with_ops(self.add_port_ops(id, port, insert)?))
    }

    pub fn add_port_ops(
        &self,
        id: PortId,
        port: Port,
        insert: PortInsert,
    ) -> Result<Vec<GraphOp>, GraphMutationError> {
        let node_id = port.node;
        if self.graph.ports.contains_key(&id) {
            return Err(GraphMutationError::PortAlreadyExists(id));
        }
        let node = self
            .graph
            .nodes
            .get(&node_id)
            .ok_or(GraphMutationError::MissingNode(node_id))?;
        if node.ports.contains(&id) {
            return Err(GraphMutationError::DuplicateNodePort {
                node: node_id,
                port: id,
            });
        }

        let order = NodePortOrderEdit::insert(node_id, &node.ports, id, insert)?;

        Ok(vec![
            GraphOp::AddPort { id, port },
            GraphOp::SetNodePorts {
                id: node_id,
                from: order.from,
                to: order.to,
            },
        ])
    }

    pub fn remove_port_op(&self, id: PortId) -> Result<GraphOp, GraphMutationError> {
        let port = self
            .graph
            .ports
            .get(&id)
            .cloned()
            .ok_or(GraphMutationError::MissingPort(id))?;

        let edges = incident_edges_for_port(self.graph, id);
        Ok(GraphOp::RemovePort {
            id,
            port,
            bindings: bindings_for_port_removal(self.graph, id, &edges),
            edges,
        })
    }

    pub fn remove_port_ops(&self, id: PortId) -> Result<Vec<GraphOp>, GraphMutationError> {
        let remove_op = self.remove_port_op(id)?;
        let mut ops = Vec::new();

        if let GraphOp::RemovePort { port, .. } = &remove_op
            && let Some(node) = self.graph.nodes.get(&port.node)
        {
            let order = NodePortOrderEdit::remove(&node.ports, id);
            if order.from != order.to {
                ops.push(GraphOp::SetNodePorts {
                    id: port.node,
                    from: order.from,
                    to: order.to,
                });
            }
        }

        ops.push(remove_op);
        Ok(ops)
    }

    pub fn disconnect_port_ops(&self, id: PortId) -> Result<Vec<GraphOp>, GraphMutationError> {
        self.graph
            .ports
            .get(&id)
            .ok_or(GraphMutationError::MissingPort(id))?;

        Ok(remove_edge_ops_for_port(self.graph, id))
    }

    pub fn remove_port_tx(
        &self,
        id: PortId,
        label: impl Into<String>,
    ) -> Result<GraphTransaction, GraphMutationError> {
        Ok(GraphTransaction::new()
            .with_label(label)
            .with_ops(self.remove_port_ops(id)?))
    }
}

struct NodePortOrderEdit {
    from: Vec<PortId>,
    to: Vec<PortId>,
}

impl NodePortOrderEdit {
    fn insert(
        node: NodeId,
        existing: &[PortId],
        inserted: PortId,
        insert: PortInsert,
    ) -> Result<Self, GraphMutationError> {
        let from = existing.to_vec();
        let mut to = from.clone();
        match insert {
            PortInsert::Append => to.push(inserted),
            PortInsert::At(index) => {
                if index > to.len() {
                    return Err(GraphMutationError::PortInsertOutOfBounds {
                        node,
                        index,
                        len: to.len(),
                    });
                }
                to.insert(index, inserted);
            }
        }

        Ok(Self { from, to })
    }

    fn remove(existing: &[PortId], removed: PortId) -> Self {
        let from = existing.to_vec();
        let mut to = from.clone();
        to.retain(|id| *id != removed);

        Self { from, to }
    }
}