@pega/cosmos-react-build 2.0.0-dev.20.0 → 2.0.0-dev.21.0

package/lib/components/FlowModeller/Renderer/Utils/Graph.d.ts

@@ -0,0 +1,51 @@
+export interface ConnectorProps<T = unknown> {
+    id: string;
+    fromNodeId: string;
+    toNodeId: string;
+    label?: string;
+    data?: T;
+}
+export interface Node<T = unknown> {
+    id: string;
+    data?: T;
+}
+export interface GraphData<T extends Node, U extends ConnectorProps> {
+    nodes: T[];
+    connectors: U[];
+}
+export declare class DirectedGraph<T extends Node = Node, U extends ConnectorProps = ConnectorProps, D1 = unknown, // Can be any here.. because nodeData is optional and each node may need to carry its own Data type.
+D2 = unknown> {
+    private nodes;
+    private connectors;
+    private nodeData;
+    private connectorData;
+    private inConnectors;
+    private prevNodesCount;
+    private outConnectors;
+    private nextNodesCount;
+    private nodeCount;
+    private connectorsCount;
+    constructor(graphData?: GraphData<T, U>);
+    getGraphData(): GraphData<T, U>;
+    getNodeCount(): number;
+    getNodes(): T[];
+    addNode(node: T, data?: D1): DirectedGraph;
+    getNode(nodeId: string): T;
+    hasNode(nodeId: string): boolean;
+    deleteNode(nodeId: string, ignoreConnectors?: boolean): DirectedGraph<T, U>;
+    getPrevNodes(nodeId: string): T[];
+    getNextNodes(nodeId: string): T[];
+    getPrevNodesCount(nodeId: string): number;
+    getNextNodesCount(nodeId: string): number;
+    isLeaf(nodeId: string): boolean;
+    getConnectorsCount(): number;
+    getConnectors(): U[];
+    addConnector(connector: U, data?: D2): DirectedGraph<T, U>;
+    hasConnector(id: string): boolean;
+    getConnector(id: string): U;
+    removeConnector(id: string): DirectedGraph<T, U>;
+    getInConnectors(toNodeId: string, fromNodeId?: string): ConnectorProps[];
+    getOutConnectors(fromNodeId: string, toNodeId?: string): ConnectorProps[];
+    getAllNodeConnectors(nodeId: string): ConnectorProps<unknown>[] | undefined;
+}
+//# sourceMappingURL=Graph.d.ts.map

package/lib/components/FlowModeller/Renderer/Utils/Graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Graph.d.ts","sourceRoot":"","sources":["../../../../../src/components/FlowModeller/Renderer/Utils/Graph.ts"],"names":[],"mappings":"AAAA,MAAM,WAAW,cAAc,CAAC,CAAC,GAAG,OAAO;IACzC,EAAE,EAAE,MAAM,CAAC;IACX,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,IAAI,CAAC,EAAE,CAAC,CAAC;CACV;AAED,MAAM,WAAW,IAAI,CAAC,CAAC,GAAG,OAAO;IAC/B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,CAAC,EAAE,CAAC,CAAC;CACV;AAED,MAAM,WAAW,SAAS,CAAC,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,cAAc;IACjE,KAAK,EAAE,CAAC,EAAE,CAAC;IACX,UAAU,EAAE,CAAC,EAAE,CAAC;CACjB;AAED,qBAAa,aAAa,CACxB,CAAC,SAAS,IAAI,GAAG,IAAI,EACrB,CAAC,SAAS,cAAc,GAAG,cAAc,EACzC,EAAE,GAAG,OAAO,EAAE,oGAAoG;AAClH,EAAE,GAAG,OAAO;IAEZ,OAAO,CAAC,KAAK,CAAyB;IACtC,OAAO,CAAC,UAAU,CAAyB;IAG3C,OAAO,CAAC,QAAQ,CAAoC;IACpD,OAAO,CAAC,aAAa,CAAoC;IAEzD,OAAO,CAAC,YAAY,CAAyC;IAC7D,OAAO,CAAC,cAAc,CAA8C;IAEpE,OAAO,CAAC,aAAa,CAAyC;IAC9D,OAAO,CAAC,cAAc,CAA8C;IAEpE,OAAO,CAAC,SAAS,CAAK;IACtB,OAAO,CAAC,eAAe,CAAK;gBAEhB,SAAS,GAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAiC;IAOtE,YAAY,IAAI,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC;IAO/B,YAAY,IAAI,MAAM;IAItB,QAAQ;IAIR,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,GAAG,aAAa;IAoB1C,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,CAAC;IAI1B,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO;IAIhC,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,gBAAgB,UAAQ,GAAG,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC;IAyBzE,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,CAAC,EAAE;IAMjC,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,CAAC,EAAE;IAMjC,iBAAiB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM;IAOzC,iBAAiB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM;IAOzC,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO;IAK/B,kBAAkB,IAAI,MAAM;IAI5B,aAAa;IAIb,YAAY,CAAC,SAAS,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,GAAG,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC;IAgD1D,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAIjC,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,CAAC;IAI3B,eAAe,CAAC,EAAE,EAAE,MAAM,GAAG,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC;IA+BhD,eAAe,CAAC,QAAQ,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG,cAAc,EAAE;IAkBxE,gBAAgB,CAAC,UAAU,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,MAAM,GAAG,cAAc,EAAE;IAkBzE,oBAAoB,CAAC,MAAM,EAAE,MAAM;CAOpC"}

package/lib/components/FlowModeller/Renderer/Utils/Graph.js

@@ -0,0 +1,247 @@
+export class DirectedGraph {
+    constructor(graphData = { nodes: [], connectors: [] }) {
+        Object.defineProperty(this, "nodes", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: {}
+        });
+        Object.defineProperty(this, "connectors", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: {}
+        });
+        // additional way to maintain related data - for cases where Graph is used for indirect purposes
+        Object.defineProperty(this, "nodeData", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: {}
+        });
+        Object.defineProperty(this, "connectorData", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: {}
+        });
+        Object.defineProperty(this, "inConnectors", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: {}
+        }); // we are maintaining connector reference instead of id, to avoid iterations later on.
+        Object.defineProperty(this, "prevNodesCount", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: {}
+        });
+        Object.defineProperty(this, "outConnectors", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: {}
+        }); // we are maintaining connector reference instead of id, to avoid iterations later on
+        Object.defineProperty(this, "nextNodesCount", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: {}
+        });
+        Object.defineProperty(this, "nodeCount", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: 0
+        });
+        Object.defineProperty(this, "connectorsCount", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: 0
+        });
+        // Not necessary to clone, as this class never modifies any nodes
+        graphData.nodes.forEach(item => this.addNode(item));
+        // copy/clone, connectors properties 'fromNodeId' and 'toNodeId' values may get modified by this class
+        graphData.connectors.forEach(item => this.addConnector(JSON.parse(JSON.stringify(item))));
+    }
+    getGraphData() {
+        return {
+            nodes: this.getNodes(),
+            connectors: this.getConnectors()
+        };
+    }
+    getNodeCount() {
+        return this.nodeCount;
+    }
+    getNodes() {
+        return Object.values(this.nodes);
+    }
+    addNode(node, data) {
+        if (this.nodes[node.id] !== undefined) {
+            this.nodes[node.id] = node;
+            this.nodeData[node.id] = data;
+        }
+        else {
+            this.nodes[node.id] = node;
+            this.nodeData[node.id] = data;
+            this.inConnectors[node.id] = {};
+            this.prevNodesCount[node.id] = {};
+            this.outConnectors[node.id] = {};
+            this.nextNodesCount[node.id] = {};
+            this.nodeCount += 1;
+        }
+        return this;
+    }
+    getNode(nodeId) {
+        return this.nodes[nodeId];
+    }
+    hasNode(nodeId) {
+        return this.nodes[nodeId] !== undefined;
+    }
+    deleteNode(nodeId, ignoreConnectors = false) {
+        if (this.hasNode(nodeId)) {
+            delete this.nodes[nodeId];
+            delete this.nodeData[nodeId];
+            if (ignoreConnectors !== true) {
+                const removeConnector = (id) => this.removeConnector(id);
+                // IMP NOTE its the responsibility of the callee to make sure that the connectors are cleanly reassigned, or else all attached connectors will be deleted
+                Object.keys(this.inConnectors[nodeId]).forEach(removeConnector);
+                delete this.inConnectors[nodeId];
+                delete this.prevNodesCount[nodeId];
+                Object.keys(this.outConnectors[nodeId]).forEach(removeConnector);
+                delete this.outConnectors[nodeId];
+                delete this.nextNodesCount[nodeId];
+            }
+            this.nodeCount += 1;
+        }
+        return this;
+    }
+    getPrevNodes(nodeId) {
+        return this.prevNodesCount[nodeId]
+            ? Object.keys(this.prevNodesCount[nodeId]).map(id => this.getNode(id))
+            : [];
+    }
+    getNextNodes(nodeId) {
+        return this.nextNodesCount[nodeId]
+            ? Object.keys(this.nextNodesCount[nodeId]).map(id => this.getNode(id))
+            : [];
+    }
+    getPrevNodesCount(nodeId) {
+        return (this.prevNodesCount[nodeId] ? Object.values(this.prevNodesCount[nodeId]) : []).reduce((prev, current) => prev + current, 0);
+    }
+    getNextNodesCount(nodeId) {
+        return (this.nextNodesCount[nodeId] ? Object.values(this.nextNodesCount[nodeId]) : []).reduce((prev, current) => prev + current, 0);
+    }
+    isLeaf(nodeId) {
+        return this.getNextNodes(nodeId).length === 0;
+    }
+    // -- Connectors
+    getConnectorsCount() {
+        return this.connectorsCount;
+    }
+    getConnectors() {
+        return Object.values(this.connectors);
+    }
+    addConnector(connector, data) {
+        if (this.connectors[connector.id] !== undefined) {
+            // update the map
+            this.connectors[connector.id] = connector;
+            this.connectorData[connector.id] = data;
+            return this;
+        }
+        const id = connector.id;
+        const fromNodeId = connector.fromNodeId;
+        const toNodeId = connector.toNodeId;
+        // check if nodes with given ids exist
+        if (this.nodes[fromNodeId] === undefined || this.nodes[toNodeId] === undefined) {
+            throw new Error(`One or more nodes does not exist, cannot add connector ${fromNodeId}-${toNodeId}`);
+        }
+        // add it to the map
+        this.connectors[id] = connector;
+        this.connectorData[id] = data;
+        // update prev nodes count
+        if (this.prevNodesCount[toNodeId][fromNodeId]) {
+            this.prevNodesCount[toNodeId][fromNodeId] += 1;
+        }
+        else {
+            this.prevNodesCount[toNodeId][fromNodeId] = 1;
+        }
+        // update next nodes count
+        if (this.nextNodesCount[fromNodeId][toNodeId]) {
+            this.nextNodesCount[fromNodeId][toNodeId] += 1;
+        }
+        else {
+            this.nextNodesCount[fromNodeId][toNodeId] = 1;
+        }
+        // update in and out connectors for both the nodes
+        this.inConnectors[toNodeId][id] = connector;
+        this.outConnectors[fromNodeId][id] = connector;
+        // increment total connectors count
+        this.connectorsCount += 1;
+        return this;
+    }
+    hasConnector(id) {
+        return this.connectors[id] !== undefined;
+    }
+    getConnector(id) {
+        return this.connectors[id];
+    }
+    removeConnector(id) {
+        const connector = this.connectors[id];
+        if (connector !== undefined) {
+            const fromNodeId = connector.fromNodeId;
+            const toNodeId = connector.toNodeId;
+            delete this.connectors[id];
+            delete this.connectorData[id];
+            // update prev nodes count
+            this.prevNodesCount[toNodeId][fromNodeId] -= 1;
+            if (this.prevNodesCount[toNodeId][fromNodeId] === 0) {
+                delete this.prevNodesCount[toNodeId][fromNodeId];
+            }
+            // update next nodes count
+            this.nextNodesCount[fromNodeId][toNodeId] -= 1;
+            if (this.nextNodesCount[fromNodeId][toNodeId] === 0) {
+                delete this.nextNodesCount[fromNodeId][toNodeId];
+            }
+            delete this.inConnectors[toNodeId][id];
+            delete this.outConnectors[fromNodeId][id];
+            this.connectorsCount -= 1;
+        }
+        return this;
+    }
+    getInConnectors(toNodeId, fromNodeId) {
+        const allInConnectors = this.inConnectors[toNodeId];
+        if (allInConnectors) {
+            const connectorValues = Object.values(allInConnectors);
+            if (fromNodeId === undefined) {
+                return connectorValues;
+            }
+            return connectorValues.filter(connector => {
+                return connector.fromNodeId === fromNodeId;
+            });
+        }
+        return [];
+    }
+    getOutConnectors(fromNodeId, toNodeId) {
+        const allOutConnectors = this.outConnectors[fromNodeId];
+        if (allOutConnectors) {
+            const connectorValues = Object.values(allOutConnectors);
+            if (toNodeId === undefined) {
+                return connectorValues;
+            }
+            return connectorValues.filter(connector => {
+                return connector.toNodeId === toNodeId;
+            });
+        }
+        return [];
+    }
+    getAllNodeConnectors(nodeId) {
+        const inConnectors = this.getInConnectors(nodeId);
+        if (inConnectors) {
+            return inConnectors.concat(this.getOutConnectors(nodeId));
+        }
+    }
+}
+//# sourceMappingURL=Graph.js.map

package/lib/components/FlowModeller/Renderer/Utils/Graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Graph.js","sourceRoot":"","sources":["../../../../../src/components/FlowModeller/Renderer/Utils/Graph.ts"],"names":[],"mappings":"AAkBA,MAAM,OAAO,aAAa;IAsBxB,YAAY,YAA6B,EAAE,KAAK,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE;QAhBtE;;;;mBAAmC,EAAE;WAAC;QACtC;;;;mBAAwC,EAAE;WAAC;QAE3C,gGAAgG;QAChG;;;;mBAAiD,EAAE;WAAC;QACpD;;;;mBAAsD,EAAE;WAAC;QAEzD;;;;mBAA0D,EAAE;WAAC,CAAC,sFAAsF;QACpJ;;;;mBAAiE,EAAE;WAAC;QAEpE;;;;mBAA2D,EAAE;WAAC,CAAC,qFAAqF;QACpJ;;;;mBAAiE,EAAE;WAAC;QAEpE;;;;mBAAoB,CAAC;WAAC;QACtB;;;;mBAA0B,CAAC;WAAC;QAG1B,iEAAiE;QACjE,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;QACpD,sGAAsG;QACtG,SAAS,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5F,CAAC;IAED,YAAY;QACV,OAAO;YACL,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE;YACtB,UAAU,EAAE,IAAI,CAAC,aAAa,EAAE;SACjC,CAAC;IACJ,CAAC;IAED,YAAY;QACV,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED,QAAQ;QACN,OAAO,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC;IAED,OAAO,CAAC,IAAO,EAAE,IAAS;QACxB,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,SAAS,EAAE;YACrC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;YAC3B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;SAC/B;aAAM;YACL,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;YAC3B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;YAE9B,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;YAChC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;YAElC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;YACjC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;YAElC,IAAI,CAAC,SAAS,IAAI,CAAC,CAAC;SACrB;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,CAAC,MAAc;QACpB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAC5B,CAAC;IAED,OAAO,CAAC,MAAc;QACpB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,SAAS,CAAC;IAC1C,CAAC;IAED,UAAU,CAAC,MAAc,EAAE,gBAAgB,GAAG,KAAK;QACjD,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;YACxB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAC1B,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YAE7B,IAAI,gBAAgB,KAAK,IAAI,EAAE;gBAC7B,MAAM,eAAe,GAAG,CAAC,EAAU,EAAE,EAAE,CAAC,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;gBAEjE,yJAAyJ;gBAEzJ,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC;gBAChE,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;gBACjC,OAAO,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;gBAEnC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC;gBACjE,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;gBAClC,OAAO,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;aACpC;YAED,IAAI,CAAC,SAAS,IAAI,CAAC,CAAC;SACrB;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED,YAAY,CAAC,MAAc;QACzB,OAAO,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC;YAChC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YACtE,CAAC,CAAC,EAAE,CAAC;IACT,CAAC;IAED,YAAY,CAAC,MAAc;QACzB,OAAO,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC;YAChC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YACtE,CAAC,CAAC,EAAE,CAAC;IACT,CAAC;IAED,iBAAiB,CAAC,MAAc;QAC9B,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAC3F,CAAC,IAAI,EAAE,OAAO,EAAE,EAAE,CAAC,IAAI,GAAG,OAAO,EACjC,CAAC,CACF,CAAC;IACJ,CAAC;IAED,iBAAiB,CAAC,MAAc;QAC9B,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAC3F,CAAC,IAAI,EAAE,OAAO,EAAE,EAAE,CAAC,IAAI,GAAG,OAAO,EACjC,CAAC,CACF,CAAC;IACJ,CAAC;IAED,MAAM,CAAC,MAAc;QACnB,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC;IAChD,CAAC;IAED,gBAAgB;IAChB,kBAAkB;QAChB,OAAO,IAAI,CAAC,eAAe,CAAC;IAC9B,CAAC;IAED,aAAa;QACX,OAAO,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACxC,CAAC;IAED,YAAY,CAAC,SAAY,EAAE,IAAS;QAClC,IAAI,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC,KAAK,SAAS,EAAE;YAC/C,iBAAiB;YACjB,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC;YAC1C,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;YAExC,OAAO,IAAI,CAAC;SACb;QAED,MAAM,EAAE,GAAG,SAAS,CAAC,EAAE,CAAC;QACxB,MAAM,UAAU,GAAG,SAAS,CAAC,UAAU,CAAC;QACxC,MAAM,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC;QAEpC,sCAAsC;QACtC,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,SAAS,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,SAAS,EAAE;YAC9E,MAAM,IAAI,KAAK,CACb,0DAA0D,UAAU,IAAI,QAAQ,EAAE,CACnF,CAAC;SACH;QAED,oBAAoB;QACpB,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC;QAChC,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;QAE9B,0BAA0B;QAC1B,IAAI,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,UAAU,CAAC,EAAE;YAC7C,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;SAChD;aAAM;YACL,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;SAC/C;QAED,0BAA0B;QAC1B,IAAI,IAAI,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,EAAE;YAC7C,IAAI,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;SAChD;aAAM;YACL,IAAI,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;SAC/C;QAED,kDAAkD;QAClD,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC;QAC5C,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC;QAE/C,mCAAmC;QACnC,IAAI,CAAC,eAAe,IAAI,CAAC,CAAC;QAE1B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,YAAY,CAAC,EAAU;QACrB,OAAO,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,KAAK,SAAS,CAAC;IAC3C,CAAC;IAED,YAAY,CAAC,EAAU;QACrB,OAAO,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;IAC7B,CAAC;IAED,eAAe,CAAC,EAAU;QACxB,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QAEtC,IAAI,SAAS,KAAK,SAAS,EAAE;YAC3B,MAAM,UAAU,GAAG,SAAS,CAAC,UAAU,CAAC;YACxC,MAAM,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC;YAEpC,OAAO,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;YAC3B,OAAO,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;YAE9B,0BAA0B;YAC1B,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YAC/C,IAAI,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE;gBACnD,OAAO,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,UAAU,CAAC,CAAC;aAClD;YAED,0BAA0B;YAC1B,IAAI,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC/C,IAAI,IAAI,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;gBACnD,OAAO,IAAI,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,CAAC;aAClD;YAED,OAAO,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC;YACvC,OAAO,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC;YAE1C,IAAI,CAAC,eAAe,IAAI,CAAC,CAAC;SAC3B;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED,eAAe,CAAC,QAAgB,EAAE,UAAmB;QACnD,MAAM,eAAe,GAAG,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QAEpD,IAAI,eAAe,EAAE;YACnB,MAAM,eAAe,GAAG,MAAM,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC;YAEvD,IAAI,UAAU,KAAK,SAAS,EAAE;gBAC5B,OAAO,eAAe,CAAC;aACxB;YAED,OAAO,eAAe,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE;gBACxC,OAAO,SAAS,CAAC,UAAU,KAAK,UAAU,CAAC;YAC7C,CAAC,CAAC,CAAC;SACJ;QAED,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,gBAAgB,CAAC,UAAkB,EAAE,QAAiB;QACpD,MAAM,gBAAgB,GAAG,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;QAExD,IAAI,gBAAgB,EAAE;YACpB,MAAM,eAAe,GAAG,MAAM,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC;YAExD,IAAI,QAAQ,KAAK,SAAS,EAAE;gBAC1B,OAAO,eAAe,CAAC;aACxB;YAED,OAAO,eAAe,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE;gBACxC,OAAO,SAAS,CAAC,QAAQ,KAAK,QAAQ,CAAC;YACzC,CAAC,CAAC,CAAC;SACJ;QAED,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,oBAAoB,CAAC,MAAc;QACjC,MAAM,YAAY,GAAG,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;QAElD,IAAI,YAAY,EAAE;YAChB,OAAO,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC;SAC3D;IACH,CAAC;CACF","sourcesContent":["export interface ConnectorProps<T = unknown> {\n  id: string;\n  fromNodeId: string;\n  toNodeId: string;\n  label?: string;\n  data?: T;\n}\n\nexport interface Node<T = unknown> {\n  id: string;\n  data?: T;\n}\n\nexport interface GraphData<T extends Node, U extends ConnectorProps> {\n  nodes: T[];\n  connectors: U[];\n}\n\nexport class DirectedGraph<\n  T extends Node = Node,\n  U extends ConnectorProps = ConnectorProps,\n  D1 = unknown, // Can be any here.. because nodeData is optional and each node may need to carry its own Data type.\n  D2 = unknown // Can be any here.. because connectorData is optional and each connector may need to carry its own Data type.\n> {\n  private nodes: Record<string, T> = {};\n  private connectors: Record<string, U> = {};\n\n  // additional way to maintain related data - for cases where Graph is used for indirect purposes\n  private nodeData: Record<string, D1 | unknown> = {};\n  private connectorData: Record<string, D2 | unknown> = {};\n\n  private inConnectors: Record<string, Record<string, U>> = {}; // we are maintaining connector reference instead of id, to avoid iterations later on.\n  private prevNodesCount: Record<string, Record<string, number>> = {};\n\n  private outConnectors: Record<string, Record<string, U>> = {}; // we are maintaining connector reference instead of id, to avoid iterations later on\n  private nextNodesCount: Record<string, Record<string, number>> = {};\n\n  private nodeCount = 0;\n  private connectorsCount = 0;\n\n  constructor(graphData: GraphData<T, U> = { nodes: [], connectors: [] }) {\n    // Not necessary to clone, as this class never modifies any nodes\n    graphData.nodes.forEach(item => this.addNode(item));\n    // copy/clone, connectors properties 'fromNodeId' and 'toNodeId' values may get modified by this class\n    graphData.connectors.forEach(item => this.addConnector(JSON.parse(JSON.stringify(item))));\n  }\n\n  getGraphData(): GraphData<T, U> {\n    return {\n      nodes: this.getNodes(),\n      connectors: this.getConnectors()\n    };\n  }\n\n  getNodeCount(): number {\n    return this.nodeCount;\n  }\n\n  getNodes() {\n    return Object.values(this.nodes);\n  }\n\n  addNode(node: T, data?: D1): DirectedGraph {\n    if (this.nodes[node.id] !== undefined) {\n      this.nodes[node.id] = node;\n      this.nodeData[node.id] = data;\n    } else {\n      this.nodes[node.id] = node;\n      this.nodeData[node.id] = data;\n\n      this.inConnectors[node.id] = {};\n      this.prevNodesCount[node.id] = {};\n\n      this.outConnectors[node.id] = {};\n      this.nextNodesCount[node.id] = {};\n\n      this.nodeCount += 1;\n    }\n\n    return this;\n  }\n\n  getNode(nodeId: string): T {\n    return this.nodes[nodeId];\n  }\n\n  hasNode(nodeId: string): boolean {\n    return this.nodes[nodeId] !== undefined;\n  }\n\n  deleteNode(nodeId: string, ignoreConnectors = false): DirectedGraph<T, U> {\n    if (this.hasNode(nodeId)) {\n      delete this.nodes[nodeId];\n      delete this.nodeData[nodeId];\n\n      if (ignoreConnectors !== true) {\n        const removeConnector = (id: string) => this.removeConnector(id);\n\n        // IMP NOTE its the responsibility of the callee to make sure that the connectors are cleanly reassigned, or else all attached connectors will be deleted\n\n        Object.keys(this.inConnectors[nodeId]).forEach(removeConnector);\n        delete this.inConnectors[nodeId];\n        delete this.prevNodesCount[nodeId];\n\n        Object.keys(this.outConnectors[nodeId]).forEach(removeConnector);\n        delete this.outConnectors[nodeId];\n        delete this.nextNodesCount[nodeId];\n      }\n\n      this.nodeCount += 1;\n    }\n\n    return this;\n  }\n\n  getPrevNodes(nodeId: string): T[] {\n    return this.prevNodesCount[nodeId]\n      ? Object.keys(this.prevNodesCount[nodeId]).map(id => this.getNode(id))\n      : [];\n  }\n\n  getNextNodes(nodeId: string): T[] {\n    return this.nextNodesCount[nodeId]\n      ? Object.keys(this.nextNodesCount[nodeId]).map(id => this.getNode(id))\n      : [];\n  }\n\n  getPrevNodesCount(nodeId: string): number {\n    return (this.prevNodesCount[nodeId] ? Object.values(this.prevNodesCount[nodeId]) : []).reduce(\n      (prev, current) => prev + current,\n      0\n    );\n  }\n\n  getNextNodesCount(nodeId: string): number {\n    return (this.nextNodesCount[nodeId] ? Object.values(this.nextNodesCount[nodeId]) : []).reduce(\n      (prev, current) => prev + current,\n      0\n    );\n  }\n\n  isLeaf(nodeId: string): boolean {\n    return this.getNextNodes(nodeId).length === 0;\n  }\n\n  // -- Connectors\n  getConnectorsCount(): number {\n    return this.connectorsCount;\n  }\n\n  getConnectors() {\n    return Object.values(this.connectors);\n  }\n\n  addConnector(connector: U, data?: D2): DirectedGraph<T, U> {\n    if (this.connectors[connector.id] !== undefined) {\n      // update the map\n      this.connectors[connector.id] = connector;\n      this.connectorData[connector.id] = data;\n\n      return this;\n    }\n\n    const id = connector.id;\n    const fromNodeId = connector.fromNodeId;\n    const toNodeId = connector.toNodeId;\n\n    // check if nodes with given ids exist\n    if (this.nodes[fromNodeId] === undefined || this.nodes[toNodeId] === undefined) {\n      throw new Error(\n        `One or more nodes does not exist, cannot add connector ${fromNodeId}-${toNodeId}`\n      );\n    }\n\n    // add it to the map\n    this.connectors[id] = connector;\n    this.connectorData[id] = data;\n\n    // update prev nodes count\n    if (this.prevNodesCount[toNodeId][fromNodeId]) {\n      this.prevNodesCount[toNodeId][fromNodeId] += 1;\n    } else {\n      this.prevNodesCount[toNodeId][fromNodeId] = 1;\n    }\n\n    // update next nodes count\n    if (this.nextNodesCount[fromNodeId][toNodeId]) {\n      this.nextNodesCount[fromNodeId][toNodeId] += 1;\n    } else {\n      this.nextNodesCount[fromNodeId][toNodeId] = 1;\n    }\n\n    // update in and out connectors for both the nodes\n    this.inConnectors[toNodeId][id] = connector;\n    this.outConnectors[fromNodeId][id] = connector;\n\n    // increment total connectors count\n    this.connectorsCount += 1;\n\n    return this;\n  }\n\n  hasConnector(id: string): boolean {\n    return this.connectors[id] !== undefined;\n  }\n\n  getConnector(id: string): U {\n    return this.connectors[id];\n  }\n\n  removeConnector(id: string): DirectedGraph<T, U> {\n    const connector = this.connectors[id];\n\n    if (connector !== undefined) {\n      const fromNodeId = connector.fromNodeId;\n      const toNodeId = connector.toNodeId;\n\n      delete this.connectors[id];\n      delete this.connectorData[id];\n\n      // update prev nodes count\n      this.prevNodesCount[toNodeId][fromNodeId] -= 1;\n      if (this.prevNodesCount[toNodeId][fromNodeId] === 0) {\n        delete this.prevNodesCount[toNodeId][fromNodeId];\n      }\n\n      // update next nodes count\n      this.nextNodesCount[fromNodeId][toNodeId] -= 1;\n      if (this.nextNodesCount[fromNodeId][toNodeId] === 0) {\n        delete this.nextNodesCount[fromNodeId][toNodeId];\n      }\n\n      delete this.inConnectors[toNodeId][id];\n      delete this.outConnectors[fromNodeId][id];\n\n      this.connectorsCount -= 1;\n    }\n\n    return this;\n  }\n\n  getInConnectors(toNodeId: string, fromNodeId?: string): ConnectorProps[] {\n    const allInConnectors = this.inConnectors[toNodeId];\n\n    if (allInConnectors) {\n      const connectorValues = Object.values(allInConnectors);\n\n      if (fromNodeId === undefined) {\n        return connectorValues;\n      }\n\n      return connectorValues.filter(connector => {\n        return connector.fromNodeId === fromNodeId;\n      });\n    }\n\n    return [];\n  }\n\n  getOutConnectors(fromNodeId: string, toNodeId?: string): ConnectorProps[] {\n    const allOutConnectors = this.outConnectors[fromNodeId];\n\n    if (allOutConnectors) {\n      const connectorValues = Object.values(allOutConnectors);\n\n      if (toNodeId === undefined) {\n        return connectorValues;\n      }\n\n      return connectorValues.filter(connector => {\n        return connector.toNodeId === toNodeId;\n      });\n    }\n\n    return [];\n  }\n\n  getAllNodeConnectors(nodeId: string) {\n    const inConnectors = this.getInConnectors(nodeId);\n\n    if (inConnectors) {\n      return inConnectors.concat(this.getOutConnectors(nodeId));\n    }\n  }\n}\n"]}

package/lib/components/FlowModeller/Renderer/Utils/GraphLayout.d.ts

@@ -0,0 +1,35 @@
+import { ConnectorProps, GraphData, Node } from './Graph';
+export interface PlottedGraphNode<T = any> extends Node<T> {
+    dimensions: {
+        width: number;
+        height: number;
+    };
+    position: {
+        x: number;
+        y: number;
+    };
+}
+export interface PlottedGraphConnector<T = any> extends ConnectorProps<T> {
+    points: {
+        x: number;
+        y: number;
+    }[];
+    labelLayout?: {
+        value: any;
+        width: number;
+        height: number;
+        x: number;
+        y: number;
+    };
+}
+export declare enum GraphLayoutDirection {
+    LeftToRight = "LR",
+    TopToBottom = "TB"
+}
+export default class GraphLayout {
+    static plot<T extends GraphData<PlottedGraphNode, PlottedGraphConnector>>(graphData: T, direction?: GraphLayoutDirection): {
+        width: number;
+        height: number;
+    };
+}
+//# sourceMappingURL=GraphLayout.d.ts.map

package/lib/components/FlowModeller/Renderer/Utils/GraphLayout.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphLayout.d.ts","sourceRoot":"","sources":["../../../../../src/components/FlowModeller/Renderer/Utils/GraphLayout.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,cAAc,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAE1D,MAAM,WAAW,gBAAgB,CAAC,CAAC,GAAG,GAAG,CAAE,SAAQ,IAAI,CAAC,CAAC,CAAC;IACxD,UAAU,EAAE;QACV,KAAK,EAAE,MAAM,CAAC;QACd,MAAM,EAAE,MAAM,CAAC;KAChB,CAAC;IACF,QAAQ,EAAE;QACR,CAAC,EAAE,MAAM,CAAC;QACV,CAAC,EAAE,MAAM,CAAC;KACX,CAAC;CACH;AAED,MAAM,WAAW,qBAAqB,CAAC,CAAC,GAAG,GAAG,CAAE,SAAQ,cAAc,CAAC,CAAC,CAAC;IACvE,MAAM,EAAE;QAAE,CAAC,EAAE,MAAM,CAAC;QAAC,CAAC,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IACnC,WAAW,CAAC,EAAE;QACZ,KAAK,EAAE,GAAG,CAAC;QACX,KAAK,EAAE,MAAM,CAAC;QACd,MAAM,EAAE,MAAM,CAAC;QACf,CAAC,EAAE,MAAM,CAAC;QACV,CAAC,EAAE,MAAM,CAAC;KACX,CAAC;CACH;AAED,oBAAY,oBAAoB;IAC9B,WAAW,OAAO;IAClB,WAAW,OAAO;CACnB;AAKD,MAAM,CAAC,OAAO,OAAO,WAAW;IAE9B,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,SAAS,CAAC,gBAAgB,EAAE,qBAAqB,CAAC,EACtE,SAAS,EAAE,CAAC,EACZ,SAAS,GAAE,oBAAuD;;;;CA8GrE"}

package/lib/components/FlowModeller/Renderer/Utils/GraphLayout.js

@@ -0,0 +1,104 @@
+import dagre from 'dagre';
+export var GraphLayoutDirection;
+(function (GraphLayoutDirection) {
+    GraphLayoutDirection["LeftToRight"] = "LR";
+    GraphLayoutDirection["TopToBottom"] = "TB";
+})(GraphLayoutDirection || (GraphLayoutDirection = {}));
+const DEFAULT_GRAPH_WIDTH = 2000;
+const DEFAULT_GRAPH_HEIGHT = 2000;
+export default class GraphLayout {
+    // Using Dagre layouting
+    static plot(graphData, direction = GraphLayoutDirection.TopToBottom) {
+        const dagreGraph = new dagre.graphlib.Graph();
+        dagreGraph.setDefaultEdgeLabel(() => ({}));
+        const defaultNodeWidth = 280;
+        const defaultNodeHeight = 112;
+        dagreGraph.setGraph({
+            rankdir: direction,
+            ranksep: 10,
+            edgesep: defaultNodeWidth / 2,
+            nodesep: 40,
+            // cspell:disable-next
+            marginx: 200,
+            // cspell:disable-next
+            marginy: 50
+        });
+        graphData.nodes.forEach(node => {
+            dagreGraph.setNode(node.id, {
+                width: node.dimensions.width ? node.dimensions.width : defaultNodeWidth,
+                height: node.dimensions.height ? node.dimensions.height : defaultNodeHeight
+            });
+        });
+        graphData.connectors.forEach(con => {
+            dagreGraph.setEdge(con.fromNodeId, con.toNodeId, {
+                weight: 1,
+                minlen: 1,
+                label: con.data?.label,
+                width: 200,
+                height: 60,
+                // cspell:disable-next
+                lablepos: 'c',
+                labeloffset: 0
+            });
+        });
+        dagre.layout(dagreGraph, {});
+        graphData.nodes.forEach(el => {
+            const node = dagreGraph.node(el.id);
+            el.position.x = node.x - el.dimensions.width / 2;
+            el.position.y = node.y - el.dimensions.height / 2;
+        });
+        graphData.connectors.forEach(con => {
+            const edge = dagreGraph.edge(con.fromNodeId, con.toNodeId);
+            con.labelLayout = {
+                value: edge.label,
+                x: edge.x,
+                y: edge.y - 10,
+                width: edge.width,
+                height: edge.height
+            };
+            const lastIndex = edge.points.length - 1;
+            let firstPoint = edge.points[0];
+            const secondPoint = edge.points[1];
+            let lastPoint = edge.points[lastIndex];
+            const secondLastPoint = edge.points[lastIndex - 1];
+            const fromNode = dagreGraph.node(con.fromNodeId);
+            const toNode = dagreGraph.node(con.toNodeId);
+            firstPoint =
+                firstPoint.x !== secondPoint.x
+                    ? {
+                        ...edge.points[0],
+                        x: fromNode.x,
+                        y: edge.points[1].y
+                    }
+                    : firstPoint;
+            lastPoint =
+                lastPoint.x !== secondLastPoint.x
+                    ? {
+                        ...edge.points[lastIndex],
+                        x: toNode.x,
+                        y: edge.points[lastIndex - 1].y
+                    }
+                    : lastPoint;
+            con.points = [
+                { x: fromNode.x, y: fromNode.y + fromNode.height / 2 },
+                firstPoint,
+                ...edge.points.slice(1, lastIndex),
+                lastPoint,
+                { x: toNode.x, y: toNode.y }
+            ];
+        });
+        const width = dagreGraph.graph().width;
+        const height = dagreGraph.graph().height;
+        if (width !== undefined && height !== undefined) {
+            return {
+                width: Number.isFinite(width) ? width : DEFAULT_GRAPH_WIDTH,
+                height: Number.isFinite(height) ? height : DEFAULT_GRAPH_HEIGHT
+            };
+        }
+        return {
+            width: DEFAULT_GRAPH_WIDTH,
+            height: DEFAULT_GRAPH_HEIGHT
+        };
+    }
+}
+//# sourceMappingURL=GraphLayout.js.map

package/lib/components/FlowModeller/Renderer/Utils/GraphLayout.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphLayout.js","sourceRoot":"","sources":["../../../../../src/components/FlowModeller/Renderer/Utils/GraphLayout.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,MAAM,OAAO,CAAC;AA0B1B,MAAM,CAAN,IAAY,oBAGX;AAHD,WAAY,oBAAoB;IAC9B,0CAAkB,CAAA;IAClB,0CAAkB,CAAA;AACpB,CAAC,EAHW,oBAAoB,KAApB,oBAAoB,QAG/B;AAED,MAAM,mBAAmB,GAAG,IAAI,CAAC;AACjC,MAAM,oBAAoB,GAAG,IAAI,CAAC;AAElC,MAAM,CAAC,OAAO,OAAO,WAAW;IAC9B,wBAAwB;IACxB,MAAM,CAAC,IAAI,CACT,SAAY,EACZ,YAAkC,oBAAoB,CAAC,WAAW;QAElE,MAAM,UAAU,GAAG,IAAI,KAAK,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;QAE9C,UAAU,CAAC,mBAAmB,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAE3C,MAAM,gBAAgB,GAAG,GAAG,CAAC;QAC7B,MAAM,iBAAiB,GAAG,GAAG,CAAC;QAE9B,UAAU,CAAC,QAAQ,CAAC;YAClB,OAAO,EAAE,SAAS;YAClB,OAAO,EAAE,EAAE;YACX,OAAO,EAAE,gBAAgB,GAAG,CAAC;YAC7B,OAAO,EAAE,EAAE;YACX,sBAAsB;YACtB,OAAO,EAAE,GAAG;YACZ,sBAAsB;YACtB,OAAO,EAAE,EAAE;SACZ,CAAC,CAAC;QAEH,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YAC7B,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE;gBAC1B,KAAK,EAAE,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,gBAAgB;gBACvE,MAAM,EAAE,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,iBAAiB;aAC5E,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,SAAS,CAAC,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;YACjC,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,QAAQ,EAAE;gBAC/C,MAAM,EAAE,CAAC;gBACT,MAAM,EAAE,CAAC;gBACT,KAAK,EAAE,GAAG,CAAC,IAAI,EAAE,KAAK;gBACtB,KAAK,EAAE,GAAG;gBACV,MAAM,EAAE,EAAE;gBACV,sBAAsB;gBACtB,QAAQ,EAAE,GAAG;gBACb,WAAW,EAAE,CAAC;aACf,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,KAAK,CAAC,MAAM,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;QAE7B,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;YAC3B,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACpC,EAAE,CAAC,QAAQ,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,UAAU,CAAC,KAAK,GAAG,CAAC,CAAC;YACjD,EAAE,CAAC,QAAQ,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;QACpD,CAAC,CAAC,CAAC;QAEH,SAAS,CAAC,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;YACjC,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC;YAE3D,GAAG,CAAC,WAAW,GAAG;gBAChB,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,CAAC,EAAE,IAAI,CAAC,CAAC;gBACT,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE;gBACd,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,MAAM,EAAE,IAAI,CAAC,MAAM;aACpB,CAAC;YAEF,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;YACzC,IAAI,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAChC,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACnC,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YACvC,MAAM,eAAe,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;YAEnD,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YACjD,MAAM,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAE7C,UAAU;gBACR,UAAU,CAAC,CAAC,KAAK,WAAW,CAAC,CAAC;oBAC5B,CAAC,CAAC;wBACE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;wBACjB,CAAC,EAAE,QAAQ,CAAC,CAAC;wBACb,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;qBACpB;oBACH,CAAC,CAAC,UAAU,CAAC;YAEjB,SAAS;gBACP,SAAS,CAAC,CAAC,KAAK,eAAe,CAAC,CAAC;oBAC/B,CAAC,CAAC;wBACE,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC;wBACzB,CAAC,EAAE,MAAM,CAAC,CAAC;wBACX,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC;qBAChC;oBACH,CAAC,CAAC,SAAS,CAAC;YAEhB,GAAG,CAAC,MAAM,GAAG;gBACX,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;gBACtD,UAAU;gBACV,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC;gBAClC,SAAS;gBACT,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE;aAC7B,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC;QACvC,MAAM,MAAM,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC;QAEzC,IAAI,KAAK,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,EAAE;YAC/C,OAAO;gBACL,KAAK,EAAE,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,mBAAmB;gBAC3D,MAAM,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,oBAAoB;aAChE,CAAC;SACH;QAED,OAAO;YACL,KAAK,EAAE,mBAAmB;YAC1B,MAAM,EAAE,oBAAoB;SAC7B,CAAC;IACJ,CAAC;CACF","sourcesContent":["import dagre from 'dagre';\n\nimport { ConnectorProps, GraphData, Node } from './Graph';\n\nexport interface PlottedGraphNode<T = any> extends Node<T> {\n  dimensions: {\n    width: number;\n    height: number;\n  };\n  position: {\n    x: number;\n    y: number;\n  };\n}\n\nexport interface PlottedGraphConnector<T = any> extends ConnectorProps<T> {\n  points: { x: number; y: number }[];\n  labelLayout?: {\n    value: any;\n    width: number;\n    height: number;\n    x: number;\n    y: number;\n  };\n}\n\nexport enum GraphLayoutDirection {\n  LeftToRight = 'LR',\n  TopToBottom = 'TB'\n}\n\nconst DEFAULT_GRAPH_WIDTH = 2000;\nconst DEFAULT_GRAPH_HEIGHT = 2000;\n\nexport default class GraphLayout {\n  // Using Dagre layouting\n  static plot<T extends GraphData<PlottedGraphNode, PlottedGraphConnector>>(\n    graphData: T,\n    direction: GraphLayoutDirection = GraphLayoutDirection.TopToBottom\n  ) {\n    const dagreGraph = new dagre.graphlib.Graph();\n\n    dagreGraph.setDefaultEdgeLabel(() => ({}));\n\n    const defaultNodeWidth = 280;\n    const defaultNodeHeight = 112;\n\n    dagreGraph.setGraph({\n      rankdir: direction,\n      ranksep: 10,\n      edgesep: defaultNodeWidth / 2,\n      nodesep: 40,\n      // cspell:disable-next\n      marginx: 200,\n      // cspell:disable-next\n      marginy: 50\n    });\n\n    graphData.nodes.forEach(node => {\n      dagreGraph.setNode(node.id, {\n        width: node.dimensions.width ? node.dimensions.width : defaultNodeWidth,\n        height: node.dimensions.height ? node.dimensions.height : defaultNodeHeight\n      });\n    });\n\n    graphData.connectors.forEach(con => {\n      dagreGraph.setEdge(con.fromNodeId, con.toNodeId, {\n        weight: 1,\n        minlen: 1,\n        label: con.data?.label,\n        width: 200,\n        height: 60,\n        // cspell:disable-next\n        lablepos: 'c',\n        labeloffset: 0\n      });\n    });\n\n    dagre.layout(dagreGraph, {});\n\n    graphData.nodes.forEach(el => {\n      const node = dagreGraph.node(el.id);\n      el.position.x = node.x - el.dimensions.width / 2;\n      el.position.y = node.y - el.dimensions.height / 2;\n    });\n\n    graphData.connectors.forEach(con => {\n      const edge = dagreGraph.edge(con.fromNodeId, con.toNodeId);\n\n      con.labelLayout = {\n        value: edge.label,\n        x: edge.x,\n        y: edge.y - 10,\n        width: edge.width,\n        height: edge.height\n      };\n\n      const lastIndex = edge.points.length - 1;\n      let firstPoint = edge.points[0];\n      const secondPoint = edge.points[1];\n      let lastPoint = edge.points[lastIndex];\n      const secondLastPoint = edge.points[lastIndex - 1];\n\n      const fromNode = dagreGraph.node(con.fromNodeId);\n      const toNode = dagreGraph.node(con.toNodeId);\n\n      firstPoint =\n        firstPoint.x !== secondPoint.x\n          ? {\n              ...edge.points[0],\n              x: fromNode.x,\n              y: edge.points[1].y\n            }\n          : firstPoint;\n\n      lastPoint =\n        lastPoint.x !== secondLastPoint.x\n          ? {\n              ...edge.points[lastIndex],\n              x: toNode.x,\n              y: edge.points[lastIndex - 1].y\n            }\n          : lastPoint;\n\n      con.points = [\n        { x: fromNode.x, y: fromNode.y + fromNode.height / 2 },\n        firstPoint,\n        ...edge.points.slice(1, lastIndex),\n        lastPoint,\n        { x: toNode.x, y: toNode.y }\n      ];\n    });\n\n    const width = dagreGraph.graph().width;\n    const height = dagreGraph.graph().height;\n\n    if (width !== undefined && height !== undefined) {\n      return {\n        width: Number.isFinite(width) ? width : DEFAULT_GRAPH_WIDTH,\n        height: Number.isFinite(height) ? height : DEFAULT_GRAPH_HEIGHT\n      };\n    }\n\n    return {\n      width: DEFAULT_GRAPH_WIDTH,\n      height: DEFAULT_GRAPH_HEIGHT\n    };\n  }\n}\n"]}

package/lib/components/FlowModeller/helper.d.ts

@@ -0,0 +1,22 @@
+import { GraphData, ConnectorProps } from './Renderer/Utils/Graph';
+import { AddNodeHandlerParams } from './Renderer/Renderer.types';
+import { NodeProps, NodeType } from './Node/Node.types';
+interface NodeDataType {
+    nodes: NodeProps[];
+    connectors: ConnectorProps[];
+}
+export interface AddHelperParams {
+    nodeType: NodeType;
+    graphData: GraphData<NodeProps, ConnectorProps>;
+    metaData: AddNodeHandlerParams;
+    connectorsCount?: number;
+    getNewNode?: () => NodeProps;
+    getNewConnector?: (fromNodeId: string, toNodeId: string) => ConnectorProps;
+}
+declare const helpers: {
+    deleteNode(graphData: NodeDataType, nodeId: string): GraphData<NodeProps, ConnectorProps<unknown>> | null;
+    deleteConnector: (graphData: NodeDataType, connector: ConnectorProps) => GraphData<NodeProps, ConnectorProps<unknown>> | null;
+    addNode: ({ graphData, nodeType, metaData, getNewNode, getNewConnector, connectorsCount }: AddHelperParams) => GraphData<NodeProps, ConnectorProps<unknown>>;
+};
+export default helpers;
+//# sourceMappingURL=helper.d.ts.map

package/lib/components/FlowModeller/helper.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"helper.d.ts","sourceRoot":"","sources":["../../../src/components/FlowModeller/helper.ts"],"names":[],"mappings":"AAEA,OAAO,EAAiB,SAAS,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AAClF,OAAO,EAAE,oBAAoB,EAAE,MAAM,2BAA2B,CAAC;AACjE,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAiB,MAAM,mBAAmB,CAAC;AAEvE,UAAU,YAAY;IACpB,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB,UAAU,EAAE,cAAc,EAAE,CAAC;CAC9B;AAED,MAAM,WAAW,eAAe;IAC9B,QAAQ,EAAE,QAAQ,CAAC;IACnB,SAAS,EAAE,SAAS,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;IAChD,QAAQ,EAAE,oBAAoB,CAAC;IAC/B,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,UAAU,CAAC,EAAE,MAAM,SAAS,CAAC;IAC7B,eAAe,CAAC,EAAE,CAAC,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,KAAK,cAAc,CAAC;CAC5E;AAED,QAAA,MAAM,OAAO;0BACW,YAAY,UAAU,MAAM;iCAmBrB,YAAY,aAAa,cAAc;+FAqCjE,eAAe;CAqDnB,CAAC;AAEF,eAAe,OAAO,CAAC"}

package/lib/components/FlowModeller/helper.js

@@ -0,0 +1,97 @@
+import { createUID } from '@pega/cosmos-react-core';
+import { DirectedGraph } from './Renderer/Utils/Graph';
+import { STOP_NODETYPE } from './Node/Node.types';
+const helpers = {
+    deleteNode(graphData, nodeId) {
+        const graph = new DirectedGraph(graphData);
+        const outConnectors = graph.getOutConnectors(nodeId);
+        if (outConnectors.length > 1) {
+            return null;
+        }
+        const inConnectors = graph.getInConnectors(nodeId);
+        inConnectors.forEach(con => {
+            con.toNodeId = outConnectors[0].toNodeId;
+        });
+        graph.removeConnector(outConnectors[0].id);
+        graph.deleteNode(nodeId, true);
+        return graph.getGraphData();
+    },
+    deleteConnector: (graphData, connector) => {
+        const graph = new DirectedGraph(graphData);
+        const nodeId = connector.fromNodeId;
+        const outConnectors = graph.getOutConnectors(nodeId);
+        const toNode = graph.getNode(connector.toNodeId);
+        const inConnectors = graph.getInConnectors(connector.toNodeId);
+        let isRemoved = false;
+        if (inConnectors.length >= 2) {
+            graph.removeConnector(connector.id);
+            isRemoved = true;
+        }
+        if (toNode.type.id === STOP_NODETYPE.id && outConnectors.length > 1 && !isRemoved) {
+            graph.removeConnector(connector.id);
+            isRemoved = true;
+        }
+        if (outConnectors.length > 1 && !isRemoved) {
+            outConnectors.forEach(item => {
+                if (connector.toNodeId === item.toNodeId && item.id !== connector.id) {
+                    // Connector without any node
+                    graph.removeConnector(connector.id);
+                    isRemoved = true;
+                }
+            });
+        }
+        if (isRemoved) {
+            return graph.getGraphData();
+        }
+        return null;
+    },
+    addNode: ({ graphData, nodeType, metaData, getNewNode, getNewConnector, connectorsCount }) => {
+        const graph = new DirectedGraph(graphData);
+        const newNode = getNewNode
+            ? getNewNode()
+            : {
+                ...nodeType.defaults.node,
+                id: createUID(),
+                type: nodeType
+            };
+        // add new node
+        graph.addNode(newNode);
+        let toNodeId = '';
+        if (metaData.refType === 'connector') {
+            const refConnector = graph.getConnector(metaData.refId);
+            // backup current connectors toNodeId
+            toNodeId = refConnector.toNodeId;
+            // update the actual connector
+            refConnector.toNodeId = newNode.id;
+        }
+        else if (metaData.refType === 'node') {
+            toNodeId = metaData.refId;
+            // iterate and update all in-connectors to point to the new node
+            graph.getInConnectors(metaData.refId).forEach(con => {
+                con.toNodeId = newNode.id;
+            });
+        }
+        let minConnectors = 1;
+        if (connectorsCount !== undefined) {
+            minConnectors = connectorsCount;
+        }
+        else {
+            minConnectors = nodeType.minConnectors !== undefined ? nodeType.minConnectors : 1;
+        }
+        for (let i = 0; i < minConnectors; i += 1) {
+            const newConnector = getNewConnector
+                ? getNewConnector(newNode.id, toNodeId)
+                : {
+                    id: createUID(),
+                    fromNodeId: newNode.id,
+                    toNodeId,
+                    label: nodeType.defaults?.connector[i].label
+                };
+            graph.addConnector(newConnector);
+        }
+        // return the updated graphData
+        return graph.getGraphData();
+    }
+};
+export default helpers;
+//# sourceMappingURL=helper.js.map

package/lib/components/FlowModeller/helper.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"helper.js","sourceRoot":"","sources":["../../../src/components/FlowModeller/helper.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAEpD,OAAO,EAAE,aAAa,EAA6B,MAAM,wBAAwB,CAAC;AAElF,OAAO,EAAuB,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAgBvE,MAAM,OAAO,GAAG;IACd,UAAU,CAAC,SAAuB,EAAE,MAAc;QAChD,MAAM,KAAK,GAAG,IAAI,aAAa,CAA4B,SAAS,CAAC,CAAC;QACtE,MAAM,aAAa,GAAG,KAAK,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;QAErD,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE;YAC5B,OAAO,IAAI,CAAC;SACb;QACD,MAAM,YAAY,GAAG,KAAK,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;QAEnD,YAAY,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;YACzB,GAAG,CAAC,QAAQ,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;QAC3C,CAAC,CAAC,CAAC;QAEH,KAAK,CAAC,eAAe,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAE3C,KAAK,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAE/B,OAAO,KAAK,CAAC,YAAY,EAAE,CAAC;IAC9B,CAAC;IACD,eAAe,EAAE,CAAC,SAAuB,EAAE,SAAyB,EAAE,EAAE;QACtE,MAAM,KAAK,GAAG,IAAI,aAAa,CAA4B,SAAS,CAAC,CAAC;QACtE,MAAM,MAAM,GAAG,SAAS,CAAC,UAAU,CAAC;QACpC,MAAM,aAAa,GAAG,KAAK,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;QACrD,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QACjD,MAAM,YAAY,GAAG,KAAK,CAAC,eAAe,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QAC/D,IAAI,SAAS,GAAG,KAAK,CAAC;QACtB,IAAI,YAAY,CAAC,MAAM,IAAI,CAAC,EAAE;YAC5B,KAAK,CAAC,eAAe,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;YACpC,SAAS,GAAG,IAAI,CAAC;SAClB;QACD,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,aAAa,CAAC,EAAE,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE;YACjF,KAAK,CAAC,eAAe,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;YACpC,SAAS,GAAG,IAAI,CAAC;SAClB;QAED,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE;YAC1C,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;gBAC3B,IAAI,SAAS,CAAC,QAAQ,KAAK,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,EAAE,KAAK,SAAS,CAAC,EAAE,EAAE;oBACpE,6BAA6B;oBAC7B,KAAK,CAAC,eAAe,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;oBACpC,SAAS,GAAG,IAAI,CAAC;iBAClB;YACH,CAAC,CAAC,CAAC;SACJ;QACD,IAAI,SAAS,EAAE;YACb,OAAO,KAAK,CAAC,YAAY,EAAE,CAAC;SAC7B;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,OAAO,EAAE,CAAC,EACR,SAAS,EACT,QAAQ,EACR,QAAQ,EACR,UAAU,EACV,eAAe,EACf,eAAe,EACC,EAAE,EAAE;QACpB,MAAM,KAAK,GAAG,IAAI,aAAa,CAAC,SAAS,CAAC,CAAC;QAE3C,MAAM,OAAO,GAAG,UAAU;YACxB,CAAC,CAAC,UAAU,EAAE;YACd,CAAC,CAAC;gBACE,GAAG,QAAQ,CAAC,QAAQ,CAAC,IAAI;gBACzB,EAAE,EAAE,SAAS,EAAE;gBACf,IAAI,EAAE,QAAQ;aACf,CAAC;QAEN,eAAe;QACf,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QAEvB,IAAI,QAAQ,GAAG,EAAE,CAAC;QAClB,IAAI,QAAQ,CAAC,OAAO,KAAK,WAAW,EAAE;YACpC,MAAM,YAAY,GAAG,KAAK,CAAC,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAExD,qCAAqC;YACrC,QAAQ,GAAG,YAAY,CAAC,QAAQ,CAAC;YAEjC,8BAA8B;YAC9B,YAAY,CAAC,QAAQ,GAAG,OAAO,CAAC,EAAE,CAAC;SACpC;aAAM,IAAI,QAAQ,CAAC,OAAO,KAAK,MAAM,EAAE;YACtC,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC;YAE1B,gEAAgE;YAChE,KAAK,CAAC,eAAe,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;gBAClD,GAAG,CAAC,QAAQ,GAAG,OAAO,CAAC,EAAE,CAAC;YAC5B,CAAC,CAAC,CAAC;SACJ;QAED,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,eAAe,KAAK,SAAS,EAAE;YACjC,aAAa,GAAG,eAAe,CAAC;SACjC;aAAM;YACL,aAAa,GAAG,QAAQ,CAAC,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;SACnF;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,EAAE,CAAC,IAAI,CAAC,EAAE;YACzC,MAAM,YAAY,GAAG,eAAe;gBAClC,CAAC,CAAC,eAAe,CAAC,OAAO,CAAC,EAAE,EAAE,QAAQ,CAAC;gBACvC,CAAC,CAAC;oBACE,EAAE,EAAE,SAAS,EAAE;oBACf,UAAU,EAAE,OAAO,CAAC,EAAE;oBACtB,QAAQ;oBACR,KAAK,EAAE,QAAQ,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK;iBAC7C,CAAC;YACN,KAAK,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC;SAClC;QACD,+BAA+B;QAC/B,OAAO,KAAK,CAAC,YAAY,EAAE,CAAC;IAC9B,CAAC;CACF,CAAC;AAEF,eAAe,OAAO,CAAC","sourcesContent":["import { createUID } from '@pega/cosmos-react-core';\n\nimport { DirectedGraph, GraphData, ConnectorProps } from './Renderer/Utils/Graph';\nimport { AddNodeHandlerParams } from './Renderer/Renderer.types';\nimport { NodeProps, NodeType, STOP_NODETYPE } from './Node/Node.types';\n\ninterface NodeDataType {\n  nodes: NodeProps[];\n  connectors: ConnectorProps[];\n}\n\nexport interface AddHelperParams {\n  nodeType: NodeType;\n  graphData: GraphData<NodeProps, ConnectorProps>;\n  metaData: AddNodeHandlerParams;\n  connectorsCount?: number;\n  getNewNode?: () => NodeProps;\n  getNewConnector?: (fromNodeId: string, toNodeId: string) => ConnectorProps;\n}\n\nconst helpers = {\n  deleteNode(graphData: NodeDataType, nodeId: string) {\n    const graph = new DirectedGraph<NodeProps, ConnectorProps>(graphData);\n    const outConnectors = graph.getOutConnectors(nodeId);\n\n    if (outConnectors.length > 1) {\n      return null;\n    }\n    const inConnectors = graph.getInConnectors(nodeId);\n\n    inConnectors.forEach(con => {\n      con.toNodeId = outConnectors[0].toNodeId;\n    });\n\n    graph.removeConnector(outConnectors[0].id);\n\n    graph.deleteNode(nodeId, true);\n\n    return graph.getGraphData();\n  },\n  deleteConnector: (graphData: NodeDataType, connector: ConnectorProps) => {\n    const graph = new DirectedGraph<NodeProps, ConnectorProps>(graphData);\n    const nodeId = connector.fromNodeId;\n    const outConnectors = graph.getOutConnectors(nodeId);\n    const toNode = graph.getNode(connector.toNodeId);\n    const inConnectors = graph.getInConnectors(connector.toNodeId);\n    let isRemoved = false;\n    if (inConnectors.length >= 2) {\n      graph.removeConnector(connector.id);\n      isRemoved = true;\n    }\n    if (toNode.type.id === STOP_NODETYPE.id && outConnectors.length > 1 && !isRemoved) {\n      graph.removeConnector(connector.id);\n      isRemoved = true;\n    }\n\n    if (outConnectors.length > 1 && !isRemoved) {\n      outConnectors.forEach(item => {\n        if (connector.toNodeId === item.toNodeId && item.id !== connector.id) {\n          // Connector without any node\n          graph.removeConnector(connector.id);\n          isRemoved = true;\n        }\n      });\n    }\n    if (isRemoved) {\n      return graph.getGraphData();\n    }\n    return null;\n  },\n  addNode: ({\n    graphData,\n    nodeType,\n    metaData,\n    getNewNode,\n    getNewConnector,\n    connectorsCount\n  }: AddHelperParams) => {\n    const graph = new DirectedGraph(graphData);\n\n    const newNode = getNewNode\n      ? getNewNode()\n      : {\n          ...nodeType.defaults.node,\n          id: createUID(),\n          type: nodeType\n        };\n\n    // add new node\n    graph.addNode(newNode);\n\n    let toNodeId = '';\n    if (metaData.refType === 'connector') {\n      const refConnector = graph.getConnector(metaData.refId);\n\n      // backup current connectors toNodeId\n      toNodeId = refConnector.toNodeId;\n\n      // update the actual connector\n      refConnector.toNodeId = newNode.id;\n    } else if (metaData.refType === 'node') {\n      toNodeId = metaData.refId;\n\n      // iterate and update all in-connectors to point to the new node\n      graph.getInConnectors(metaData.refId).forEach(con => {\n        con.toNodeId = newNode.id;\n      });\n    }\n\n    let minConnectors = 1;\n    if (connectorsCount !== undefined) {\n      minConnectors = connectorsCount;\n    } else {\n      minConnectors = nodeType.minConnectors !== undefined ? nodeType.minConnectors : 1;\n    }\n\n    for (let i = 0; i < minConnectors; i += 1) {\n      const newConnector = getNewConnector\n        ? getNewConnector(newNode.id, toNodeId)\n        : {\n            id: createUID(),\n            fromNodeId: newNode.id,\n            toNodeId,\n            label: nodeType.defaults?.connector[i].label\n          };\n      graph.addConnector(newConnector);\n    }\n    // return the updated graphData\n    return graph.getGraphData();\n  }\n};\n\nexport default helpers;\n"]}