@pega/cosmos-react-build 5.0.0-dev.4.7 → 5.0.0-dev.4.9

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

@@ -1,258 +0,0 @@
-export class DirectedGraph {
-    nodes = {};
-    connectors = {};
-    // additional way to maintain related data - for cases where Graph is used for indirect purposes
-    nodeData = {};
-    connectorData = {};
-    inConnectors = {}; // we are maintaining connector reference instead of id, to avoid iterations later on.
-    prevNodesCount = {};
-    outConnectors = {}; // we are maintaining connector reference instead of id, to avoid iterations later on
-    nextNodesCount = {};
-    nodeCount = 0;
-    connectorsCount = 0;
-    constructor(graphData = { nodes: [], connectors: [] }) {
-        // 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 => {
-            const data = item.data;
-            const newItem = JSON.parse(JSON.stringify(item));
-            // below statement is necessary to retain the actual references of any function/instances if any
-            newItem.data = data;
-            this.addConnector(newItem);
-        });
-    }
-    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;
-    }
-    setConnector(id, data) {
-        // VALIDATE
-        // -connector with given id exists
-        // -node with given fromNodeId exists
-        // -node with given toNodeId exists
-        if (!this.getConnector(id)) {
-            throw new Error(`Connector with id '${id}' does not exist.`);
-        }
-        if (data.fromNodeId && !this.getNode(data.fromNodeId)) {
-            throw new Error(`Node with id '${data.fromNodeId}' does not exist, to update fromNodeId.`);
-        }
-        if (data.toNodeId && !this.getNode(data.toNodeId)) {
-            throw new Error(`Node with id '${data.toNodeId}' does not exist, to update toNodeId.`);
-        }
-        const connector = this.getConnector(id);
-        // current references
-        let fromNodeId = connector.fromNodeId;
-        let toNodeId = connector.toNodeId;
-        // update prev nodes count - unset prev values
-        this.prevNodesCount[toNodeId][fromNodeId] -= 1;
-        if (this.prevNodesCount[toNodeId][fromNodeId] === 0) {
-            delete this.prevNodesCount[toNodeId][fromNodeId];
-        }
-        // update next nodes count - unset prev values
-        this.nextNodesCount[fromNodeId][toNodeId] -= 1;
-        if (this.nextNodesCount[fromNodeId][toNodeId] === 0) {
-            delete this.nextNodesCount[fromNodeId][toNodeId];
-        }
-        // remove prev references
-        delete this.inConnectors[toNodeId][id];
-        delete this.outConnectors[fromNodeId][id];
-        // new references
-        fromNodeId = data.fromNodeId ? data.fromNodeId : connector.fromNodeId;
-        toNodeId = data.toNodeId ? data.toNodeId : connector.toNodeId;
-        connector.fromNodeId = fromNodeId;
-        connector.toNodeId = toNodeId;
-        // 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;
-        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

@@ -1 +0,0 @@
-{"version":3,"file":"Graph.js","sourceRoot":"","sources":["../../../../../src/components/FlowModeller/Renderer/Utils/Graph.ts"],"names":[],"mappings":"AAsBA,MAAM,OAAO,aAAa;IAMhB,KAAK,GAAsB,EAAE,CAAC;IAC9B,UAAU,GAAsB,EAAE,CAAC;IAE3C,gGAAgG;IACxF,QAAQ,GAAiC,EAAE,CAAC;IAC5C,aAAa,GAAiC,EAAE,CAAC;IAEjD,YAAY,GAAsC,EAAE,CAAC,CAAC,sFAAsF;IAC5I,cAAc,GAA2C,EAAE,CAAC;IAE5D,aAAa,GAAsC,EAAE,CAAC,CAAC,qFAAqF;IAC5I,cAAc,GAA2C,EAAE,CAAC;IAE5D,SAAS,GAAG,CAAC,CAAC;IACd,eAAe,GAAG,CAAC,CAAC;IAE5B,YAAY,YAA6B,EAAE,KAAK,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE;QACpE,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;YAClC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACvB,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;YAEjD,gGAAgG;YAChG,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC;YAEpB,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC;IACL,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,YAAY,CAAC,EAAU,EAAE,IAAgD;QACvE,WAAW;QACX,kCAAkC;QAClC,qCAAqC;QACrC,mCAAmC;QACnC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,EAAE;YAC1B,MAAM,IAAI,KAAK,CAAC,sBAAsB,EAAE,mBAAmB,CAAC,CAAC;SAC9D;QACD,IAAI,IAAI,CAAC,UAAU,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE;YACrD,MAAM,IAAI,KAAK,CAAC,iBAAiB,IAAI,CAAC,UAAU,yCAAyC,CAAC,CAAC;SAC5F;QACD,IAAI,IAAI,CAAC,QAAQ,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE;YACjD,MAAM,IAAI,KAAK,CAAC,iBAAiB,IAAI,CAAC,QAAQ,uCAAuC,CAAC,CAAC;SACxF;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;QAExC,qBAAqB;QACrB,IAAI,UAAU,GAAG,SAAS,CAAC,UAAU,CAAC;QACtC,IAAI,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC;QAElC,8CAA8C;QAC9C,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAC/C,IAAI,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE;YACnD,OAAO,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,UAAU,CAAC,CAAC;SAClD;QAED,8CAA8C;QAC9C,IAAI,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC/C,IAAI,IAAI,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;YACnD,OAAO,IAAI,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,CAAC;SAClD;QAED,yBAAyB;QACzB,OAAO,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC;QACvC,OAAO,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC;QAE1C,iBAAiB;QACjB,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC,UAAU,CAAC;QACtE,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC;QAE9D,SAAS,CAAC,UAAU,GAAG,UAAU,CAAC;QAClC,SAAS,CAAC,QAAQ,GAAG,QAAQ,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,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}\nexport interface NodeType {\n  minConnectors: number;\n}\nexport interface Node<T = unknown> {\n  type?: NodeType;\n  id: string;\n  data?: T;\n  reference?: string;\n}\n\nexport interface GraphData<T extends Node = Node, U extends ConnectorProps = 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,\n  D2 = unknown\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 => {\n      const data = item.data;\n      const newItem = JSON.parse(JSON.stringify(item));\n\n      // below statement is necessary to retain the actual references of any function/instances if any\n      newItem.data = data;\n\n      this.addConnector(newItem);\n    });\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  setConnector(id: string, data: { fromNodeId?: string; toNodeId?: string }): DirectedGraph<T, U> {\n    // VALIDATE\n    // -connector with given id exists\n    // -node with given fromNodeId exists\n    // -node with given toNodeId exists\n    if (!this.getConnector(id)) {\n      throw new Error(`Connector with id '${id}' does not exist.`);\n    }\n    if (data.fromNodeId && !this.getNode(data.fromNodeId)) {\n      throw new Error(`Node with id '${data.fromNodeId}' does not exist, to update fromNodeId.`);\n    }\n    if (data.toNodeId && !this.getNode(data.toNodeId)) {\n      throw new Error(`Node with id '${data.toNodeId}' does not exist, to update toNodeId.`);\n    }\n\n    const connector = this.getConnector(id);\n\n    // current references\n    let fromNodeId = connector.fromNodeId;\n    let toNodeId = connector.toNodeId;\n\n    // update prev nodes count - unset prev values\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 - unset prev values\n    this.nextNodesCount[fromNodeId][toNodeId] -= 1;\n    if (this.nextNodesCount[fromNodeId][toNodeId] === 0) {\n      delete this.nextNodesCount[fromNodeId][toNodeId];\n    }\n\n    // remove prev references\n    delete this.inConnectors[toNodeId][id];\n    delete this.outConnectors[fromNodeId][id];\n\n    // new references\n    fromNodeId = data.fromNodeId ? data.fromNodeId : connector.fromNodeId;\n    toNodeId = data.toNodeId ? data.toNodeId : connector.toNodeId;\n\n    connector.fromNodeId = fromNodeId;\n    connector.toNodeId = toNodeId;\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    return this;\n  }\n\n  getInConnectors(toNodeId: string, fromNodeId?: string): U[] {\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): U[] {\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

@@ -1,36 +0,0 @@
-import { ConnectorProps, GraphData, Node } from './Graph';
-export interface PlottedGraphNode<T = any> extends Node<T> {
-    dimensions: {
-        width: number;
-        height: number;
-    };
-    position: {
-        x: number;
-        y: number;
-    };
-    referencedNode?: T;
-}
-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, readOnly?: boolean, direction?: GraphLayoutDirection): {
-        width: number;
-        height: number;
-    };
-}
-//# sourceMappingURL=GraphLayout.d.ts.map

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

@@ -1 +0,0 @@
-{"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;IACF,cAAc,CAAC,EAAE,CAAC,CAAC;CACpB;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,QAAQ,GAAE,OAAe,EACzB,SAAS,GAAE,oBAAuD;;;;CAyIrE"}

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

@@ -1,120 +0,0 @@
-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, readOnly = false, direction = GraphLayoutDirection.TopToBottom) {
-        const dagreGraph = new dagre.graphlib.Graph({ multigraph: true });
-        dagreGraph.setDefaultEdgeLabel(() => ({}));
-        const defaultNodeWidth = 280;
-        const defaultNodeHeight = 112;
-        dagreGraph.setGraph({
-            rankdir: direction,
-            ranksep: readOnly ? 2 : 4,
-            edgesep: defaultNodeWidth / 2,
-            nodesep: 20,
-            // cspell:disable-next-line
-            marginx: 200,
-            // cspell:disable-next-line
-            marginy: 32
-        });
-        graphData.nodes.forEach(node => {
-            const height = node.dimensions.height === 0 ? 0 : node.dimensions.height || defaultNodeHeight;
-            const width = node.dimensions.width === 0 ? 0 : node.dimensions.width || defaultNodeWidth;
-            dagreGraph.setNode(node.id, {
-                width,
-                height
-            });
-        });
-        graphData.connectors.forEach((con, index) => {
-            dagreGraph.setEdge(con.fromNodeId, con.toNodeId, {
-                weight: 1,
-                minlen: 2,
-                label: con.data?.label || '',
-                width: 250,
-                height: con.data?.label ? 90 : 40,
-                // cspell:disable-next-line
-                lablepos: 'c',
-                labeloffset: 0
-            }, index.toString());
-        });
-        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, index) => {
-            const edge = dagreGraph.edge(con.fromNodeId, con.toNodeId, index.toString());
-            con.labelLayout = {
-                value: edge.label,
-                x: edge.x,
-                y: edge.y,
-                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, y: firstPoint.y + 10 },
-                { ...secondPoint, y: secondPoint.y + 10 },
-                ...edge.points.slice(2, lastIndex),
-                lastPoint
-            ];
-            // Only add the last point incase the edge has an arc at end
-            if (edge.points[lastIndex].x !== edge.points[lastIndex - 1].x) {
-                con.points.push({ x: toNode.x, y: toNode.y });
-            }
-            // if current edge source node is an placeholder node move down the starting point of placeholder node by 12
-            if (fromNode.height === 0) {
-                con.points[0].y += 12;
-            }
-            const edgeLastPointIndex = con.points.length - 1;
-            // Move the merging arcs last point to the starting point of placeholder node
-            if (con.points[edgeLastPointIndex].x === con.points[edgeLastPointIndex - 1].x &&
-                toNode.height === 0) {
-                con.points[edgeLastPointIndex].y += 12;
-            }
-        });
-        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

@@ -1 +0,0 @@
-{"version":3,"file":"GraphLayout.js","sourceRoot":"","sources":["../../../../../src/components/FlowModeller/Renderer/Utils/GraphLayout.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,MAAM,OAAO,CAAC;AA2B1B,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,WAAoB,KAAK,EACzB,YAAkC,oBAAoB,CAAC,WAAW;QAElE,MAAM,UAAU,GAAG,IAAI,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC;QAElE,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,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzB,OAAO,EAAE,gBAAgB,GAAG,CAAC;YAC7B,OAAO,EAAE,EAAE;YACX,2BAA2B;YAC3B,OAAO,EAAE,GAAG;YACZ,2BAA2B;YAC3B,OAAO,EAAE,EAAE;SACZ,CAAC,CAAC;QAEH,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YAC7B,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,IAAI,iBAAiB,CAAC;YAC9F,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,IAAI,gBAAgB,CAAC;YAC1F,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE;gBAC1B,KAAK;gBACL,MAAM;aACP,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,SAAS,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE;YAC1C,UAAU,CAAC,OAAO,CAChB,GAAG,CAAC,UAAU,EACd,GAAG,CAAC,QAAQ,EACZ;gBACE,MAAM,EAAE,CAAC;gBACT,MAAM,EAAE,CAAC;gBACT,KAAK,EAAE,GAAG,CAAC,IAAI,EAAE,KAAK,IAAI,EAAE;gBAC5B,KAAK,EAAE,GAAG;gBACV,MAAM,EAAE,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE;gBACjC,2BAA2B;gBAC3B,QAAQ,EAAE,GAAG;gBACb,WAAW,EAAE,CAAC;aACf,EACD,KAAK,CAAC,QAAQ,EAAE,CACjB,CAAC;QACJ,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,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE;YAC1C,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;YAE7E,GAAG,CAAC,WAAW,GAAG;gBAChB,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,CAAC,EAAE,IAAI,CAAC,CAAC;gBACT,CAAC,EAAE,IAAI,CAAC,CAAC;gBACT,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,EAAE,GAAG,UAAU,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC,GAAG,EAAE,EAAE;gBACvC,EAAE,GAAG,WAAW,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC,GAAG,EAAE,EAAE;gBACzC,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC;gBAClC,SAAS;aACV,CAAC;YAEF,4DAA4D;YAC5D,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE;gBAC7D,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;aAC/C;YAED,4GAA4G;YAC5G,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE;gBACzB,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;aACvB;YAED,MAAM,kBAAkB,GAAG,GAAG,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;YAEjD,6EAA6E;YAC7E,IACE,GAAG,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,MAAM,CAAC,kBAAkB,GAAG,CAAC,CAAC,CAAC,CAAC;gBACzE,MAAM,CAAC,MAAM,KAAK,CAAC,EACnB;gBACA,GAAG,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;aACxC;QACH,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  referencedNode?: T;\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    readOnly: boolean = false,\n    direction: GraphLayoutDirection = GraphLayoutDirection.TopToBottom\n  ) {\n    const dagreGraph = new dagre.graphlib.Graph({ multigraph: true });\n\n    dagreGraph.setDefaultEdgeLabel(() => ({}));\n\n    const defaultNodeWidth = 280;\n    const defaultNodeHeight = 112;\n\n    dagreGraph.setGraph({\n      rankdir: direction,\n      ranksep: readOnly ? 2 : 4,\n      edgesep: defaultNodeWidth / 2,\n      nodesep: 20,\n      // cspell:disable-next-line\n      marginx: 200,\n      // cspell:disable-next-line\n      marginy: 32\n    });\n\n    graphData.nodes.forEach(node => {\n      const height = node.dimensions.height === 0 ? 0 : node.dimensions.height || defaultNodeHeight;\n      const width = node.dimensions.width === 0 ? 0 : node.dimensions.width || defaultNodeWidth;\n      dagreGraph.setNode(node.id, {\n        width,\n        height\n      });\n    });\n\n    graphData.connectors.forEach((con, index) => {\n      dagreGraph.setEdge(\n        con.fromNodeId,\n        con.toNodeId,\n        {\n          weight: 1,\n          minlen: 2,\n          label: con.data?.label || '',\n          width: 250,\n          height: con.data?.label ? 90 : 40,\n          // cspell:disable-next-line\n          lablepos: 'c',\n          labeloffset: 0\n        },\n        index.toString()\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, index) => {\n      const edge = dagreGraph.edge(con.fromNodeId, con.toNodeId, index.toString());\n\n      con.labelLayout = {\n        value: edge.label,\n        x: edge.x,\n        y: edge.y,\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, y: firstPoint.y + 10 },\n        { ...secondPoint, y: secondPoint.y + 10 },\n        ...edge.points.slice(2, lastIndex),\n        lastPoint\n      ];\n\n      // Only add the last point incase the edge has an arc at end\n      if (edge.points[lastIndex].x !== edge.points[lastIndex - 1].x) {\n        con.points.push({ x: toNode.x, y: toNode.y });\n      }\n\n      // if current edge source node is an placeholder node move down the starting point of placeholder node by 12\n      if (fromNode.height === 0) {\n        con.points[0].y += 12;\n      }\n\n      const edgeLastPointIndex = con.points.length - 1;\n\n      // Move the merging arcs last point to the starting point of placeholder node\n      if (\n        con.points[edgeLastPointIndex].x === con.points[edgeLastPointIndex - 1].x &&\n        toNode.height === 0\n      ) {\n        con.points[edgeLastPointIndex].y += 12;\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/Renderer/Utils/GraphTraversal.d.ts

@@ -1,27 +0,0 @@
-import { ConnectorProps, DirectedGraph, GraphData, Node } from './Graph';
-export interface NestedArray<T> extends Array<T | NestedArray<T>> {
-}
-export interface ConvergenceData<T extends Node, U extends ConnectorProps> {
-    nodeId: string;
-    connectors: NestedArray<string>;
-    summary: {
-        nodesinvolved: Record<string, T>;
-        connectorsInvolved: Record<string, U>;
-    };
-    paths?: NestedArray<ConvergenceData<T, U>>;
-}
-export default class GraphTraversal {
-    static bfs(gd: GraphData, src?: string): string[];
-    static dfs(gd: GraphData, src?: string): string[];
-    static findRootNode(graph: DirectedGraph): string | false;
-    /**
-     * Given the graphData and the source node with morethan one branch, It calculates the convergence node, involved connectors and paths
-     * Assuming, goTo is not supported
-     *
-     * @param gd graphData to process on
-     * @param src id of the source node. This needs to be a node with multiple branches
-     * @returns id of the destination node or null if not found
-     */
-    static getConvergenceData<T extends Node = Node, U extends ConnectorProps = ConnectorProps>(gd: GraphData<T, U>, src: string): ConvergenceData<T, U> | false;
-}
-//# sourceMappingURL=GraphTraversal.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"GraphTraversal.d.ts","sourceRoot":"","sources":["../../../../../src/components/FlowModeller/Renderer/Utils/GraphTraversal.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,aAAa,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAEzE,MAAM,WAAW,WAAW,CAAC,CAAC,CAAE,SAAQ,KAAK,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;CAAG;AAEpE,MAAM,WAAW,eAAe,CAAC,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,cAAc;IACvE,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IAChC,OAAO,EAAE;QACP,aAAa,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACjC,kBAAkB,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;KACvC,CAAC;IACF,KAAK,CAAC,EAAE,WAAW,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;CAC5C;AAED,MAAM,CAAC,OAAO,OAAO,cAAc;IACjC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,SAAS,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE;IAqCjD,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,SAAS,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE;IAyCjD,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,aAAa,GAAG,MAAM,GAAG,KAAK;IAYzD;;;;;;;OAOG;IAEH,MAAM,CAAC,kBAAkB,CAAC,CAAC,SAAS,IAAI,GAAG,IAAI,EAAE,CAAC,SAAS,cAAc,GAAG,cAAc,EACxF,EAAE,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,EACnB,GAAG,EAAE,MAAM,GACV,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK;CA4GjC"}