@pega/cosmos-react-build 8.0.0-build.9.1 → 8.0.0

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

@@ -1,172 +0,0 @@
-import { DirectedGraph } from './Graph';
-export default class GraphTraversal {
-    static bfs(gd, src) {
-        const graph = new DirectedGraph(gd);
-        if (!src) {
-            const rootNodeId = GraphTraversal.findRootNode(graph);
-            if (!rootNodeId) {
-                throw Error('Invalid graph, cannot find root node.');
-            }
-            src = rootNodeId;
-        }
-        const queue = [src];
-        const result = [];
-        const map = {
-            src
-        }; // needed for duplicate comparision
-        while (queue.length > 0) {
-            const source = queue.shift();
-            if (source !== undefined) {
-                result.push(source);
-                const nextNodes = graph.getNextNodes(source);
-                nextNodes.forEach((node) => {
-                    if (!map[node.id]) {
-                        queue.push(node.id);
-                        map[node.id] = node.id;
-                    }
-                });
-            }
-        }
-        return result;
-    }
-    static dfs(gd, src) {
-        const graph = new DirectedGraph(gd);
-        // finding the start node automatically
-        if (!src) {
-            const rootNodeId = GraphTraversal.findRootNode(graph);
-            if (!rootNodeId) {
-                throw Error('Invalid graph, cannot find root node.');
-            }
-            src = rootNodeId;
-        }
-        const stack = [src];
-        const result = [];
-        const map = {
-            src
-        }; // needed for duplicate comparision
-        while (stack.length > 0) {
-            const source = stack.pop();
-            if (source !== undefined) {
-                result.push(source);
-                const nextNodes = graph.getNextNodes(source);
-                nextNodes.forEach(node => {
-                    if (map[node.id] === undefined) {
-                        stack.push(node.id);
-                        map[node.id] = node.id;
-                    }
-                });
-            }
-        }
-        return result;
-    }
-    // Assuming the given graph has no unconnected nodes and the graph is not cyclic(if start node have in-connectors(ie., cyclic), this will fail).
-    // - returns first encountered node with no in-connectors as a rootnode, if more than one exists
-    static findRootNode(graph) {
-        const nodes = graph.getNodes();
-        for (let i = 0; i < nodes.length; i += 1) {
-            if (graph.getPrevNodesCount(nodes[i].id) === 0) {
-                return nodes[i].id;
-            }
-        }
-        return 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
-     */
-    // TODO-OPTIMIZE Memoize, for a given GraphData
-    static getConvergenceData(gd, src) {
-        const graph = new DirectedGraph(gd);
-        // return false, if there is no node with given source node id
-        if (graph.getNode(src) === undefined || graph.getNextNodesCount(src) < 2) {
-            return false;
-        }
-        // traverse the nodes -- and record the paths of each connector
-        const path = []; // array of path-arrays
-        const initialConnectors = graph.getOutConnectors(src);
-        // iterate the initial set of connectors
-        initialConnectors.forEach((item, index) => {
-            path[index] = [];
-            let currentConnector = item;
-            // traverse through each connector and push the encountered nodes
-            while (currentConnector && currentConnector.toNodeId !== undefined) {
-                path[index].push({
-                    nodeId: currentConnector.toNodeId,
-                    connectors: [currentConnector.id],
-                    summary: {
-                        nodesinvolved: {
-                            [currentConnector.toNodeId]: graph.getNode(currentConnector.toNodeId)
-                        },
-                        connectorsInvolved: { [currentConnector.id]: currentConnector }
-                    }
-                });
-                const inConnectors = graph.getInConnectors(currentConnector.toNodeId);
-                // if this node has multiple in connectors, that means this is a join [IMP TODO NOTE until we support goTo option]
-                if (inConnectors.length > 1) {
-                    return;
-                }
-                let outConnectors = graph.getOutConnectors(currentConnector.toNodeId);
-                let newCurrentNodeId = currentConnector.toNodeId;
-                // check if this node has multiple branches and call recursively
-                while (outConnectors.length > 1) {
-                    const result = GraphTraversal.getConvergenceData(gd, newCurrentNodeId);
-                    // handle resultNodeId val as false use case: just cancel futher processing and return false
-                    if (result === false) {
-                        return false;
-                    }
-                    // add result node to the path
-                    path[index].push(result);
-                    // handle, resultNode as destination shape of alternate connector too
-                    const tempInConnectors = graph.getInConnectors(result.nodeId);
-                    // if this node has multiple in connectors and more than expected count, that means this is a join [IMP TODO NOTE until we support goTo option]
-                    if (tempInConnectors.length > outConnectors.length) {
-                        return;
-                    }
-                    // handle, resultNode as decision shape
-                    outConnectors = graph.getOutConnectors(result.nodeId);
-                    newCurrentNodeId = result.nodeId;
-                }
-                // else if out connectors is 1
-                currentConnector = outConnectors[0];
-            }
-        });
-        // validate and return false if no convergence node found
-        for (let i = 1; i < path.length; i += 1) {
-            if (path[i][path[i].length - 1].nodeId !== path[i - 1][path[i - 1].length - 1].nodeId) {
-                return false;
-            }
-        }
-        const result = {
-            nodeId: path[0][path[0].length - 1].nodeId,
-            connectors: [],
-            paths: [],
-            summary: {
-                nodesinvolved: {},
-                connectorsInvolved: {}
-            }
-        };
-        for (let i = 0; i < path.length; i += 1) {
-            const current = path[i];
-            result.connectors.push(current[current.length - 1].connectors);
-            if (result.paths !== undefined) {
-                result.paths[i] = current;
-            }
-            current.forEach(item => {
-                result.summary.nodesinvolved = {
-                    ...result.summary.nodesinvolved,
-                    ...item.summary.nodesinvolved
-                };
-                result.summary.connectorsInvolved = {
-                    ...result.summary.connectorsInvolved,
-                    ...item.summary.connectorsInvolved
-                };
-            });
-        }
-        return result;
-    }
-}
-//# sourceMappingURL=GraphTraversal.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"GraphTraversal.js","sourceRoot":"","sources":["../../../../../src/components/FlowModeller/Renderer/Utils/GraphTraversal.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AAexC,MAAM,CAAC,OAAO,OAAO,cAAc;IACjC,MAAM,CAAC,GAAG,CAAC,EAAa,EAAE,GAAY;QACpC,MAAM,KAAK,GAAG,IAAI,aAAa,CAAC,EAAE,CAAC,CAAC;QAEpC,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,MAAM,UAAU,GAAG,cAAc,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;YAEtD,IAAI,CAAC,UAAU,EAAE,CAAC;gBAChB,MAAM,KAAK,CAAC,uCAAuC,CAAC,CAAC;YACvD,CAAC;YAED,GAAG,GAAG,UAAU,CAAC;QACnB,CAAC;QAED,MAAM,KAAK,GAAa,CAAC,GAAG,CAAC,CAAC;QAC9B,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,MAAM,GAAG,GAA2B;YAClC,GAAG;SACJ,CAAC,CAAC,mCAAmC;QAEtC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YAC7B,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACzB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAEpB,MAAM,SAAS,GAAG,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;gBAC7C,SAAS,CAAC,OAAO,CAAC,CAAC,IAAU,EAAE,EAAE;oBAC/B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;wBAClB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;wBACpB,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;oBACzB,CAAC;gBACH,CAAC,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,MAAM,CAAC,GAAG,CAAC,EAAa,EAAE,GAAY;QACpC,MAAM,KAAK,GAAG,IAAI,aAAa,CAAC,EAAE,CAAC,CAAC;QAEpC,uCAAuC;QACvC,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,MAAM,UAAU,GAAG,cAAc,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;YAEtD,IAAI,CAAC,UAAU,EAAE,CAAC;gBAChB,MAAM,KAAK,CAAC,uCAAuC,CAAC,CAAC;YACvD,CAAC;YAED,GAAG,GAAG,UAAU,CAAC;QACnB,CAAC;QAED,MAAM,KAAK,GAAa,CAAC,GAAG,CAAC,CAAC;QAC9B,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,MAAM,GAAG,GAA2B;YAClC,GAAG;SACJ,CAAC,CAAC,mCAAmC;QAEtC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;YAC3B,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACzB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAEpB,MAAM,SAAS,GAAG,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;gBAE7C,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;oBACvB,IAAI,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,SAAS,EAAE,CAAC;wBAC/B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;wBACpB,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;oBACzB,CAAC;gBACH,CAAC,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,gJAAgJ;IAChJ,gGAAgG;IAChG,MAAM,CAAC,YAAY,CAAC,KAAoB;QACtC,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;QAE/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACzC,IAAI,KAAK,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC/C,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACrB,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;;OAOG;IACH,+CAA+C;IAC/C,MAAM,CAAC,kBAAkB,CACvB,EAAmB,EACnB,GAAW;QAEX,MAAM,KAAK,GAAG,IAAI,aAAa,CAAO,EAAE,CAAC,CAAC;QAE1C,8DAA8D;QAC9D,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,SAAS,IAAI,KAAK,CAAC,iBAAiB,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACzE,OAAO,KAAK,CAAC;QACf,CAAC;QAED,+DAA+D;QAC/D,MAAM,IAAI,GAA8B,EAAE,CAAC,CAAC,uBAAuB;QACnE,MAAM,iBAAiB,GAAG,KAAK,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAEtD,wCAAwC;QACxC,iBAAiB,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;YACxC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;YAEjB,IAAI,gBAAgB,GAAG,IAAI,CAAC;YAC5B,iEAAiE;YACjE,OAAO,gBAAgB,IAAI,gBAAgB,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;gBACnE,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC;oBACf,MAAM,EAAE,gBAAgB,CAAC,QAAQ;oBACjC,UAAU,EAAE,CAAC,gBAAgB,CAAC,EAAE,CAAC;oBACjC,OAAO,EAAE;wBACP,aAAa,EAAE;4BACb,CAAC,gBAAgB,CAAC,QAAQ,CAAC,EAAE,KAAK,CAAC,OAAO,CAAC,gBAAgB,CAAC,QAAQ,CAAC;yBACtE;wBACD,kBAAkB,EAAE,EAAE,CAAC,gBAAgB,CAAC,EAAE,CAAC,EAAE,gBAAgB,EAAE;qBAChE;iBACF,CAAC,CAAC;gBAEH,MAAM,YAAY,GAAG,KAAK,CAAC,eAAe,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;gBACtE,kHAAkH;gBAClH,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC5B,OAAO;gBACT,CAAC;gBAED,IAAI,aAAa,GAAG,KAAK,CAAC,gBAAgB,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;gBAEtE,IAAI,gBAAgB,GAAG,gBAAgB,CAAC,QAAQ,CAAC;gBACjD,gEAAgE;gBAChE,OAAO,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAChC,MAAM,MAAM,GAAG,cAAc,CAAC,kBAAkB,CAAC,EAAE,EAAE,gBAAgB,CAAC,CAAC;oBAEvE,4FAA4F;oBAC5F,IAAI,MAAM,KAAK,KAAK,EAAE,CAAC;wBACrB,OAAO,KAAK,CAAC;oBACf,CAAC;oBAED,8BAA8B;oBAC9B,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBAEzB,qEAAqE;oBACrE,MAAM,gBAAgB,GAAG,KAAK,CAAC,eAAe,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;oBAC9D,+IAA+I;oBAC/I,IAAI,gBAAgB,CAAC,MAAM,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC;wBACnD,OAAO;oBACT,CAAC;oBAED,uCAAuC;oBACvC,aAAa,GAAG,KAAK,CAAC,gBAAgB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;oBACtD,gBAAgB,GAAG,MAAM,CAAC,MAAM,CAAC;gBACnC,CAAC;gBAED,8BAA8B;gBAC9B,gBAAgB,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;YACtC,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,yDAAyD;QACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACxC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;gBACtF,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QAED,MAAM,MAAM,GAA0B;YACpC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,MAAM;YAC1C,UAAU,EAAE,EAAE;YACd,KAAK,EAAE,EAAE;YACT,OAAO,EAAE;gBACP,aAAa,EAAE,EAAE;gBACjB,kBAAkB,EAAE,EAAE;aACvB;SACF,CAAC;QAEF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACxC,MAAM,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;YAE/D,IAAI,MAAM,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;gBAC/B,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;YAC5B,CAAC;YAED,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;gBACrB,MAAM,CAAC,OAAO,CAAC,aAAa,GAAG;oBAC7B,GAAG,MAAM,CAAC,OAAO,CAAC,aAAa;oBAC/B,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa;iBAC9B,CAAC;gBAEF,MAAM,CAAC,OAAO,CAAC,kBAAkB,GAAG;oBAClC,GAAG,MAAM,CAAC,OAAO,CAAC,kBAAkB;oBACpC,GAAG,IAAI,CAAC,OAAO,CAAC,kBAAkB;iBACnC,CAAC;YACJ,CAAC,CAAC,CAAC;QACL,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;CACF","sourcesContent":["import { DirectedGraph } from './Graph';\nimport type { ConnectorProps, GraphData, Node } from './Graph';\n\nexport interface NestedArray<T> extends Array<T | NestedArray<T>> {}\n\nexport interface ConvergenceData<T extends Node, U extends ConnectorProps> {\n  nodeId: string;\n  connectors: NestedArray<string>;\n  summary: {\n    nodesinvolved: Record<string, T>;\n    connectorsInvolved: Record<string, U>;\n  };\n  paths?: NestedArray<ConvergenceData<T, U>>;\n}\n\nexport default class GraphTraversal {\n  static bfs(gd: GraphData, src?: string): string[] {\n    const graph = new DirectedGraph(gd);\n\n    if (!src) {\n      const rootNodeId = GraphTraversal.findRootNode(graph);\n\n      if (!rootNodeId) {\n        throw Error('Invalid graph, cannot find root node.');\n      }\n\n      src = rootNodeId;\n    }\n\n    const queue: string[] = [src];\n    const result: string[] = [];\n    const map: Record<string, string> = {\n      src\n    }; // needed for duplicate comparision\n\n    while (queue.length > 0) {\n      const source = queue.shift();\n      if (source !== undefined) {\n        result.push(source);\n\n        const nextNodes = graph.getNextNodes(source);\n        nextNodes.forEach((node: Node) => {\n          if (!map[node.id]) {\n            queue.push(node.id);\n            map[node.id] = node.id;\n          }\n        });\n      }\n    }\n\n    return result;\n  }\n\n  static dfs(gd: GraphData, src?: string): string[] {\n    const graph = new DirectedGraph(gd);\n\n    // finding the start node automatically\n    if (!src) {\n      const rootNodeId = GraphTraversal.findRootNode(graph);\n\n      if (!rootNodeId) {\n        throw Error('Invalid graph, cannot find root node.');\n      }\n\n      src = rootNodeId;\n    }\n\n    const stack: string[] = [src];\n    const result: string[] = [];\n    const map: Record<string, string> = {\n      src\n    }; // needed for duplicate comparision\n\n    while (stack.length > 0) {\n      const source = stack.pop();\n      if (source !== undefined) {\n        result.push(source);\n\n        const nextNodes = graph.getNextNodes(source);\n\n        nextNodes.forEach(node => {\n          if (map[node.id] === undefined) {\n            stack.push(node.id);\n            map[node.id] = node.id;\n          }\n        });\n      }\n    }\n\n    return result;\n  }\n\n  // Assuming the given graph has no unconnected nodes and the graph is not cyclic(if start node have in-connectors(ie., cyclic), this will fail).\n  // - returns first encountered node with no in-connectors as a rootnode, if more than one exists\n  static findRootNode(graph: DirectedGraph): string | false {\n    const nodes = graph.getNodes();\n\n    for (let i = 0; i < nodes.length; i += 1) {\n      if (graph.getPrevNodesCount(nodes[i].id) === 0) {\n        return nodes[i].id;\n      }\n    }\n\n    return false;\n  }\n\n  /**\n   * Given the graphData and the source node with morethan one branch, It calculates the convergence node, involved connectors and paths\n   * Assuming, goTo is not supported\n   *\n   * @param gd graphData to process on\n   * @param src id of the source node. This needs to be a node with multiple branches\n   * @returns id of the destination node or null if not found\n   */\n  // TODO-OPTIMIZE Memoize, for a given GraphData\n  static getConvergenceData<T extends Node = Node, U extends ConnectorProps = ConnectorProps>(\n    gd: GraphData<T, U>,\n    src: string\n  ): ConvergenceData<T, U> | false {\n    const graph = new DirectedGraph<T, U>(gd);\n\n    // return false, if there is no node with given source node id\n    if (graph.getNode(src) === undefined || graph.getNextNodesCount(src) < 2) {\n      return false;\n    }\n\n    // traverse the nodes -- and record the paths of each connector\n    const path: ConvergenceData<T, U>[][] = []; // array of path-arrays\n    const initialConnectors = graph.getOutConnectors(src);\n\n    // iterate the initial set of connectors\n    initialConnectors.forEach((item, index) => {\n      path[index] = [];\n\n      let currentConnector = item;\n      // traverse through each connector and push the encountered nodes\n      while (currentConnector && currentConnector.toNodeId !== undefined) {\n        path[index].push({\n          nodeId: currentConnector.toNodeId,\n          connectors: [currentConnector.id],\n          summary: {\n            nodesinvolved: {\n              [currentConnector.toNodeId]: graph.getNode(currentConnector.toNodeId)\n            },\n            connectorsInvolved: { [currentConnector.id]: currentConnector }\n          }\n        });\n\n        const inConnectors = graph.getInConnectors(currentConnector.toNodeId);\n        // if this node has multiple in connectors, that means this is a join [IMP TODO NOTE until we support goTo option]\n        if (inConnectors.length > 1) {\n          return;\n        }\n\n        let outConnectors = graph.getOutConnectors(currentConnector.toNodeId);\n\n        let newCurrentNodeId = currentConnector.toNodeId;\n        // check if this node has multiple branches and call recursively\n        while (outConnectors.length > 1) {\n          const result = GraphTraversal.getConvergenceData(gd, newCurrentNodeId);\n\n          // handle resultNodeId val as false use case: just cancel futher processing and return false\n          if (result === false) {\n            return false;\n          }\n\n          // add result node to the path\n          path[index].push(result);\n\n          // handle, resultNode as destination shape of alternate connector too\n          const tempInConnectors = graph.getInConnectors(result.nodeId);\n          // if this node has multiple in connectors and more than expected count, that means this is a join [IMP TODO NOTE until we support goTo option]\n          if (tempInConnectors.length > outConnectors.length) {\n            return;\n          }\n\n          // handle, resultNode as decision shape\n          outConnectors = graph.getOutConnectors(result.nodeId);\n          newCurrentNodeId = result.nodeId;\n        }\n\n        // else if out connectors is 1\n        currentConnector = outConnectors[0];\n      }\n    });\n\n    // validate and return false if no convergence node found\n    for (let i = 1; i < path.length; i += 1) {\n      if (path[i][path[i].length - 1].nodeId !== path[i - 1][path[i - 1].length - 1].nodeId) {\n        return false;\n      }\n    }\n\n    const result: ConvergenceData<T, U> = {\n      nodeId: path[0][path[0].length - 1].nodeId,\n      connectors: [],\n      paths: [],\n      summary: {\n        nodesinvolved: {},\n        connectorsInvolved: {}\n      }\n    };\n\n    for (let i = 0; i < path.length; i += 1) {\n      const current = path[i];\n      result.connectors.push(current[current.length - 1].connectors);\n\n      if (result.paths !== undefined) {\n        result.paths[i] = current;\n      }\n\n      current.forEach(item => {\n        result.summary.nodesinvolved = {\n          ...result.summary.nodesinvolved,\n          ...item.summary.nodesinvolved\n        };\n\n        result.summary.connectorsInvolved = {\n          ...result.summary.connectorsInvolved,\n          ...item.summary.connectorsInvolved\n        };\n      });\n    }\n\n    return result;\n  }\n}\n"]}

package/lib/components/FlowModeller/Utils/addNodeUtils.d.ts

@@ -1,18 +0,0 @@
-import type { AddNodeHandlerParams } from '../Renderer/Renderer.types';
-import { DirectedGraph } from '../Renderer/Utils/Graph';
-import type { ConnectorProps, GraphData, Node } from '../Renderer/Utils/Graph';
-import type { PlottedGraphNode, PlottedGraphConnector } from '../Renderer/Utils/GraphLayout';
-export interface PlaceHolderNode extends PlottedGraphNode {
-    realConnectors: string[];
-}
-export interface PlaceHolderConnector extends PlottedGraphConnector {
-    realConnectors: string[];
-}
-export declare const isPlaceHolderNode: (node: PlaceHolderNode | Node) => node is PlaceHolderNode;
-export declare const isPlaceHolderConnector: (connector: PlaceHolderConnector | ConnectorProps) => connector is PlaceHolderConnector;
-declare const PlaceHolderHelper: {
-    insertAtConnectorsMerge: (graph: DirectedGraph, getNewPHNodeCB: (addNodeMeta: AddNodeHandlerParams) => PlottedGraphNode, getNewPHConnectorCB: (fromNode: string, toNode: string, addNodeMeta: AddNodeHandlerParams) => PlottedGraphConnector) => void;
-    injectPlaceholderNodes: (graphData: GraphData<PlottedGraphNode, PlottedGraphConnector>, onGetNewNode: (metaData: AddNodeHandlerParams) => PlottedGraphNode, onGetNewConnector: (fromNodeId: string, toNodeId: string, metaData: AddNodeHandlerParams) => PlottedGraphConnector) => GraphData<PlottedGraphNode<any>, PlottedGraphConnector<any>>;
-};
-export default PlaceHolderHelper;
-//# sourceMappingURL=addNodeUtils.d.ts.map

package/lib/components/FlowModeller/Utils/addNodeUtils.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"addNodeUtils.d.ts","sourceRoot":"","sources":["../../../../src/components/FlowModeller/Utils/addNodeUtils.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,4BAA4B,CAAC;AACvE,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,KAAK,EAAE,cAAc,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,yBAAyB,CAAC;AAC/E,OAAO,KAAK,EAAE,gBAAgB,EAAE,qBAAqB,EAAE,MAAM,+BAA+B,CAAC;AAI7F,MAAM,WAAW,eAAgB,SAAQ,gBAAgB;IACvD,cAAc,EAAE,MAAM,EAAE,CAAC;CAC1B;AACD,MAAM,WAAW,oBAAqB,SAAQ,qBAAqB;IACjE,cAAc,EAAE,MAAM,EAAE,CAAC;CAC1B;AAGD,eAAO,MAAM,iBAAiB,SAAU,eAAe,GAAG,IAAI,KAAG,IAAI,IAAI,eAExE,CAAC;AAGF,eAAO,MAAM,sBAAsB,cACtB,oBAAoB,GAAG,cAAc,KAC/C,SAAS,IAAI,oBAEf,CAAC;AAwBF,QAAA,MAAM,iBAAiB;qCAEZ,aAAa,kBACJ,CAAC,WAAW,EAAE,oBAAoB,KAAK,gBAAgB,uBAClD,CACnB,QAAQ,EAAE,MAAM,EAChB,MAAM,EAAE,MAAM,EACd,WAAW,EAAE,oBAAoB,KAC9B,qBAAqB;wCAyEf,SAAS,CAAC,gBAAgB,EAAE,qBAAqB,CAAC,gBAC/C,CAAC,QAAQ,EAAE,oBAAoB,KAAK,gBAAgB,qBAC/C,CACjB,UAAU,EAAE,MAAM,EAClB,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,oBAAoB,KAC3B,qBAAqB;CA8D7B,CAAC;AAEF,eAAe,iBAAiB,CAAC"}

package/lib/components/FlowModeller/Utils/addNodeUtils.js

@@ -1,141 +0,0 @@
-import { DirectedGraph } from '../Renderer/Utils/Graph';
-import GraphTraversal from '../Renderer/Utils/GraphTraversal';
-// type-guard PlaceHolderNode
-export const isPlaceHolderNode = (node) => {
-    return node.realConnectors !== undefined;
-};
-// type-guard PlaceHolderConnector
-export const isPlaceHolderConnector = (connector) => {
-    return connector.realConnectors !== undefined;
-};
-const countInvisibleConnectors = (graph, connectors) => {
-    let invisibleConnectorsCount = 0;
-    for (let i = 0; i < connectors.length; i += 1) {
-        if (Array.isArray(connectors[i]))
-            invisibleConnectorsCount += countInvisibleConnectors(graph, connectors[i]);
-        else {
-            const connectorData = graph.getConnector(connectors[i]);
-            const fromNode = graph.getNode(connectorData.fromNodeId);
-            if (fromNode?.type?.minConnectors === 0) {
-                invisibleConnectorsCount += 1;
-            }
-        }
-    }
-    return invisibleConnectorsCount;
-};
-const PlaceHolderHelper = {
-    insertAtConnectorsMerge: (graph, getNewPHNodeCB, getNewPHConnectorCB) => {
-        const gd = graph.getGraphData();
-        // process the graph and find the first node automatically. We can find it easily by iterating and finding the node with no in-connectors
-        const bfs = GraphTraversal.bfs(gd);
-        bfs.reverse().forEach(nodeId => {
-            const node = graph.getNode(nodeId);
-            // get the node's convergence data
-            const result = GraphTraversal.getConvergenceData(graph.getGraphData(), node.id);
-            // if node has more than one out-connector and has convergence data
-            if (result !== false) {
-                // iterate over the resultant connectors
-                for (let i = 0; i < result.connectors.length; i += 1) {
-                    const connectorsToUpdate = result.connectors[i];
-                    let invisibleConnectorsCount = 0;
-                    /** Count number of invisible connectors originating from go to shapes forming a convergence/join
-                     * compare invisible connectors count with connectors forming a convergence
-                     */
-                    if (typeof connectorsToUpdate !== 'string' && connectorsToUpdate.length > 1) {
-                        invisibleConnectorsCount = countInvisibleConnectors(graph, connectorsToUpdate);
-                        // ensure connectors converging are greater than invisible connectors
-                        if (connectorsToUpdate.length > invisibleConnectorsCount) {
-                            let refConnectorIdsArray = [];
-                            connectorsToUpdate.forEach(itrConId => {
-                                let conId = itrConId;
-                                if (Array.isArray(conId)) {
-                                    conId = itrConId[0];
-                                }
-                                const connector = graph.getConnector(conId);
-                                if (isPlaceHolderConnector(connector)) {
-                                    refConnectorIdsArray = [...refConnectorIdsArray, ...connector.realConnectors];
-                                }
-                                else {
-                                    refConnectorIdsArray.push(conId);
-                                }
-                            });
-                            const addNodeMeta = {
-                                refType: 'connector',
-                                refId: refConnectorIdsArray
-                            };
-                            const newNode = getNewPHNodeCB(addNodeMeta);
-                            const newPNode = {
-                                ...newNode,
-                                realConnectors: refConnectorIdsArray
-                            };
-                            graph.addNode(newPNode);
-                            connectorsToUpdate.forEach(item => {
-                                graph.setConnector(item, {
-                                    toNodeId: newNode.id
-                                });
-                            });
-                            const newConnector = getNewPHConnectorCB(newNode.id, result.nodeId, addNodeMeta);
-                            const newPConnector = {
-                                ...newConnector,
-                                realConnectors: refConnectorIdsArray
-                            };
-                            graph.addConnector(newPConnector);
-                        }
-                    }
-                }
-            }
-        });
-    },
-    injectPlaceholderNodes: (graphData, onGetNewNode, onGetNewConnector) => {
-        // gets GraphData<RendererNodeProps, RendererConnectorProps>
-        const targetGraph = new DirectedGraph(graphData);
-        // insert placeholder-nodes at connector convergence point for nodes with multiple out connectors.
-        PlaceHolderHelper.insertAtConnectorsMerge(targetGraph, onGetNewNode, onGetNewConnector);
-        // iterate all nodes with more than one in-connectors and insert addNode before current one.
-        targetGraph.getNodes().forEach(node => {
-            // should not add a node before a placeholder node
-            if (isPlaceHolderNode(node)) {
-                return;
-            }
-            if (targetGraph.getPrevNodesCount(node.id) > 1) {
-                let refConnectorIdsArray = [];
-                // connect all in-connectors to a new node and create a new connector that connects from new node to the actual toNodeId.
-                targetGraph.getInConnectors(node.id).forEach(con => {
-                    const connector = targetGraph.getConnector(con.id);
-                    if (isPlaceHolderConnector(connector)) {
-                        refConnectorIdsArray = [...refConnectorIdsArray, ...connector.realConnectors];
-                    }
-                    else {
-                        refConnectorIdsArray.push(con.id);
-                    }
-                });
-                const metaData = {
-                    refType: 'connector',
-                    refId: refConnectorIdsArray
-                };
-                // create a new placeholder node
-                const newNode = onGetNewNode(metaData);
-                const placeHolderNode = {
-                    ...newNode,
-                    realConnectors: refConnectorIdsArray
-                };
-                targetGraph.addNode(placeHolderNode);
-                // connect all in-connectors to a new node and create a new connector that connects from new node to the actual toNodeId.
-                targetGraph.getInConnectors(node.id).forEach(con => {
-                    targetGraph.setConnector(con.id, {
-                        toNodeId: placeHolderNode.id
-                    });
-                });
-                const newConnector = onGetNewConnector(placeHolderNode.id, node.id, metaData);
-                const placeholderConnector = {
-                    ...newConnector,
-                    realConnectors: refConnectorIdsArray
-                };
-                targetGraph.addConnector(placeholderConnector);
-            }
-        });
-        return targetGraph.getGraphData();
-    }
-};
-export default PlaceHolderHelper;
-//# sourceMappingURL=addNodeUtils.js.map

package/lib/components/FlowModeller/Utils/addNodeUtils.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"addNodeUtils.js","sourceRoot":"","sources":["../../../../src/components/FlowModeller/Utils/addNodeUtils.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AAGxD,OAAO,cAAc,MAAM,kCAAkC,CAAC;AAU9D,6BAA6B;AAC7B,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,IAA4B,EAA2B,EAAE;IACzF,OAAQ,IAAwB,CAAC,cAAc,KAAK,SAAS,CAAC;AAChE,CAAC,CAAC;AAEF,kCAAkC;AAClC,MAAM,CAAC,MAAM,sBAAsB,GAAG,CACpC,SAAgD,EACb,EAAE;IACrC,OAAQ,SAAkC,CAAC,cAAc,KAAK,SAAS,CAAC;AAC1E,CAAC,CAAC;AAEF,MAAM,wBAAwB,GAAG,CAC/B,KAAoB,EACpB,UAA+B,EACvB,EAAE;IACV,IAAI,wBAAwB,GAAG,CAAC,CAAC;IACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9C,IAAI,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAC9B,wBAAwB,IAAI,wBAAwB,CAClD,KAAK,EACL,UAAU,CAAC,CAAC,CAAwB,CACrC,CAAC;aACC,CAAC;YACJ,MAAM,aAAa,GAAG,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC,CAAW,CAAC,CAAC;YAClE,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;YACzD,IAAI,QAAQ,EAAE,IAAI,EAAE,aAAa,KAAK,CAAC,EAAE,CAAC;gBACxC,wBAAwB,IAAI,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,wBAAwB,CAAC;AAClC,CAAC,CAAC;AAEF,MAAM,iBAAiB,GAAG;IACxB,uBAAuB,EAAE,CACvB,KAAoB,EACpB,cAAuE,EACvE,mBAI0B,EAC1B,EAAE;QACF,MAAM,EAAE,GAAG,KAAK,CAAC,YAAY,EAAE,CAAC;QAEhC,yIAAyI;QACzI,MAAM,GAAG,GAAG,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACnC,GAAG,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;YAC7B,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;YAEnC,kCAAkC;YAClC,MAAM,MAAM,GAAG,cAAc,CAAC,kBAAkB,CAAC,KAAK,CAAC,YAAY,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;YAEhF,mEAAmE;YACnE,IAAI,MAAM,KAAK,KAAK,EAAE,CAAC;gBACrB,wCAAwC;gBACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;oBACrD,MAAM,kBAAkB,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;oBAChD,IAAI,wBAAwB,GAAG,CAAC,CAAC;oBAEjC;;uBAEG;oBACH,IAAI,OAAO,kBAAkB,KAAK,QAAQ,IAAI,kBAAkB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBAC5E,wBAAwB,GAAG,wBAAwB,CAAC,KAAK,EAAE,kBAAkB,CAAC,CAAC;wBAE/E,qEAAqE;wBACrE,IAAI,kBAAkB,CAAC,MAAM,GAAG,wBAAwB,EAAE,CAAC;4BACzD,IAAI,oBAAoB,GAAa,EAAE,CAAC;4BAExC,kBAAkB,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;gCACpC,IAAI,KAAK,GAAG,QAAQ,CAAC;gCACrB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;oCACzB,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAW,CAAC;gCAChC,CAAC;gCAED,MAAM,SAAS,GAAG,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;gCAC5C,IAAI,sBAAsB,CAAC,SAAS,CAAC,EAAE,CAAC;oCACtC,oBAAoB,GAAG,CAAC,GAAG,oBAAoB,EAAE,GAAG,SAAS,CAAC,cAAc,CAAC,CAAC;gCAChF,CAAC;qCAAM,CAAC;oCACN,oBAAoB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gCACnC,CAAC;4BACH,CAAC,CAAC,CAAC;4BAEH,MAAM,WAAW,GAAyB;gCACxC,OAAO,EAAE,WAAW;gCACpB,KAAK,EAAE,oBAAoB;6BAC5B,CAAC;4BACF,MAAM,OAAO,GAAG,cAAc,CAAC,WAAW,CAAC,CAAC;4BAC5C,MAAM,QAAQ,GAAoB;gCAChC,GAAG,OAAO;gCACV,cAAc,EAAE,oBAAoB;6BACrC,CAAC;4BACF,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;4BAExB,kBAAkB,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;gCAChC,KAAK,CAAC,YAAY,CAAC,IAAc,EAAE;oCACjC,QAAQ,EAAE,OAAO,CAAC,EAAE;iCACrB,CAAC,CAAC;4BACL,CAAC,CAAC,CAAC;4BAEH,MAAM,YAAY,GAAG,mBAAmB,CAAC,OAAO,CAAC,EAAE,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;4BACjF,MAAM,aAAa,GAAyB;gCAC1C,GAAG,YAAY;gCACf,cAAc,EAAE,oBAAoB;6BACrC,CAAC;4BACF,KAAK,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC;wBACpC,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IACD,sBAAsB,EAAE,CACtB,SAA6D,EAC7D,YAAkE,EAClE,iBAI0B,EAC1B,EAAE;QACF,4DAA4D;QAC5D,MAAM,WAAW,GAAG,IAAI,aAAa,CAAC,SAAS,CAAC,CAAC;QAEjD,kGAAkG;QAClG,iBAAiB,CAAC,uBAAuB,CAAC,WAAW,EAAE,YAAY,EAAE,iBAAiB,CAAC,CAAC;QAExF,4FAA4F;QAC5F,WAAW,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACpC,kDAAkD;YAClD,IAAI,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC5B,OAAO;YACT,CAAC;YAED,IAAI,WAAW,CAAC,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC/C,IAAI,oBAAoB,GAAa,EAAE,CAAC;gBAExC,yHAAyH;gBACzH,WAAW,CAAC,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;oBACjD,MAAM,SAAS,GAAG,WAAW,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBACnD,IAAI,sBAAsB,CAAC,SAAS,CAAC,EAAE,CAAC;wBACtC,oBAAoB,GAAG,CAAC,GAAG,oBAAoB,EAAE,GAAG,SAAS,CAAC,cAAc,CAAC,CAAC;oBAChF,CAAC;yBAAM,CAAC;wBACN,oBAAoB,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBACpC,CAAC;gBACH,CAAC,CAAC,CAAC;gBAEH,MAAM,QAAQ,GAAyB;oBACrC,OAAO,EAAE,WAAW;oBACpB,KAAK,EAAE,oBAAoB;iBAC5B,CAAC;gBAEF,gCAAgC;gBAChC,MAAM,OAAO,GACX,YAAY,CAAC,QAAQ,CAAC,CAAC;gBACzB,MAAM,eAAe,GAAoB;oBACvC,GAAG,OAAO;oBACV,cAAc,EAAE,oBAAoB;iBACrC,CAAC;gBAEF,WAAW,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC;gBAErC,yHAAyH;gBACzH,WAAW,CAAC,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;oBACjD,WAAW,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,EAAE;wBAC/B,QAAQ,EAAE,eAAe,CAAC,EAAE;qBAC7B,CAAC,CAAC;gBACL,CAAC,CAAC,CAAC;gBAEH,MAAM,YAAY,GAAG,iBAAiB,CAAC,eAAe,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;gBAC9E,MAAM,oBAAoB,GAAyB;oBACjD,GAAG,YAAY;oBACf,cAAc,EAAE,oBAAoB;iBACrC,CAAC;gBAEF,WAAW,CAAC,YAAY,CAAC,oBAAoB,CAAC,CAAC;YACjD,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,OAAO,WAAW,CAAC,YAAY,EAAE,CAAC;IACpC,CAAC;CACF,CAAC;AAEF,eAAe,iBAAiB,CAAC","sourcesContent":["import type { OmitStrict } from '@pega/cosmos-react-core';\n\nimport type { AddNodeProps } from '../AddNode';\nimport type { AddNodeHandlerParams } from '../Renderer/Renderer.types';\nimport { DirectedGraph } from '../Renderer/Utils/Graph';\nimport type { ConnectorProps, GraphData, Node } from '../Renderer/Utils/Graph';\nimport type { PlottedGraphNode, PlottedGraphConnector } from '../Renderer/Utils/GraphLayout';\nimport GraphTraversal from '../Renderer/Utils/GraphTraversal';\nimport type { NestedArray } from '../Renderer/Utils/GraphTraversal';\n\nexport interface PlaceHolderNode extends PlottedGraphNode {\n  realConnectors: string[];\n}\nexport interface PlaceHolderConnector extends PlottedGraphConnector {\n  realConnectors: string[];\n}\n\n// type-guard PlaceHolderNode\nexport const isPlaceHolderNode = (node: PlaceHolderNode | Node): node is PlaceHolderNode => {\n  return (node as PlaceHolderNode).realConnectors !== undefined;\n};\n\n// type-guard PlaceHolderConnector\nexport const isPlaceHolderConnector = (\n  connector: PlaceHolderConnector | ConnectorProps\n): connector is PlaceHolderConnector => {\n  return (connector as PlaceHolderConnector).realConnectors !== undefined;\n};\n\nconst countInvisibleConnectors = (\n  graph: DirectedGraph,\n  connectors: NestedArray<string>\n): number => {\n  let invisibleConnectorsCount = 0;\n  for (let i = 0; i < connectors.length; i += 1) {\n    if (Array.isArray(connectors[i]))\n      invisibleConnectorsCount += countInvisibleConnectors(\n        graph,\n        connectors[i] as NestedArray<string>\n      );\n    else {\n      const connectorData = graph.getConnector(connectors[i] as string);\n      const fromNode = graph.getNode(connectorData.fromNodeId);\n      if (fromNode?.type?.minConnectors === 0) {\n        invisibleConnectorsCount += 1;\n      }\n    }\n  }\n  return invisibleConnectorsCount;\n};\n\nconst PlaceHolderHelper = {\n  insertAtConnectorsMerge: (\n    graph: DirectedGraph,\n    getNewPHNodeCB: (addNodeMeta: AddNodeHandlerParams) => PlottedGraphNode,\n    getNewPHConnectorCB: (\n      fromNode: string,\n      toNode: string,\n      addNodeMeta: AddNodeHandlerParams\n    ) => PlottedGraphConnector\n  ) => {\n    const gd = graph.getGraphData();\n\n    // process the graph and find the first node automatically. We can find it easily by iterating and finding the node with no in-connectors\n    const bfs = GraphTraversal.bfs(gd);\n    bfs.reverse().forEach(nodeId => {\n      const node = graph.getNode(nodeId);\n\n      // get the node's convergence data\n      const result = GraphTraversal.getConvergenceData(graph.getGraphData(), node.id);\n\n      // if node has more than one out-connector and has convergence data\n      if (result !== false) {\n        // iterate over the resultant connectors\n        for (let i = 0; i < result.connectors.length; i += 1) {\n          const connectorsToUpdate = result.connectors[i];\n          let invisibleConnectorsCount = 0;\n\n          /** Count number of invisible connectors originating from go to shapes forming a convergence/join\n           * compare invisible connectors count with connectors forming a convergence\n           */\n          if (typeof connectorsToUpdate !== 'string' && connectorsToUpdate.length > 1) {\n            invisibleConnectorsCount = countInvisibleConnectors(graph, connectorsToUpdate);\n\n            // ensure connectors converging are greater than invisible connectors\n            if (connectorsToUpdate.length > invisibleConnectorsCount) {\n              let refConnectorIdsArray: string[] = [];\n\n              connectorsToUpdate.forEach(itrConId => {\n                let conId = itrConId;\n                if (Array.isArray(conId)) {\n                  conId = itrConId[0] as string;\n                }\n\n                const connector = graph.getConnector(conId);\n                if (isPlaceHolderConnector(connector)) {\n                  refConnectorIdsArray = [...refConnectorIdsArray, ...connector.realConnectors];\n                } else {\n                  refConnectorIdsArray.push(conId);\n                }\n              });\n\n              const addNodeMeta: AddNodeHandlerParams = {\n                refType: 'connector',\n                refId: refConnectorIdsArray\n              };\n              const newNode = getNewPHNodeCB(addNodeMeta);\n              const newPNode: PlaceHolderNode = {\n                ...newNode,\n                realConnectors: refConnectorIdsArray\n              };\n              graph.addNode(newPNode);\n\n              connectorsToUpdate.forEach(item => {\n                graph.setConnector(item as string, {\n                  toNodeId: newNode.id\n                });\n              });\n\n              const newConnector = getNewPHConnectorCB(newNode.id, result.nodeId, addNodeMeta);\n              const newPConnector: PlaceHolderConnector = {\n                ...newConnector,\n                realConnectors: refConnectorIdsArray\n              };\n              graph.addConnector(newPConnector);\n            }\n          }\n        }\n      }\n    });\n  },\n  injectPlaceholderNodes: (\n    graphData: GraphData<PlottedGraphNode, PlottedGraphConnector>,\n    onGetNewNode: (metaData: AddNodeHandlerParams) => PlottedGraphNode,\n    onGetNewConnector: (\n      fromNodeId: string,\n      toNodeId: string,\n      metaData: AddNodeHandlerParams\n    ) => PlottedGraphConnector\n  ) => {\n    // gets GraphData<RendererNodeProps, RendererConnectorProps>\n    const targetGraph = new DirectedGraph(graphData);\n\n    // insert placeholder-nodes at connector convergence point for nodes with multiple out connectors.\n    PlaceHolderHelper.insertAtConnectorsMerge(targetGraph, onGetNewNode, onGetNewConnector);\n\n    // iterate all nodes with more than one in-connectors and insert addNode before current one.\n    targetGraph.getNodes().forEach(node => {\n      // should not add a node before a placeholder node\n      if (isPlaceHolderNode(node)) {\n        return;\n      }\n\n      if (targetGraph.getPrevNodesCount(node.id) > 1) {\n        let refConnectorIdsArray: string[] = [];\n\n        // connect all in-connectors to a new node and create a new connector that connects from new node to the actual toNodeId.\n        targetGraph.getInConnectors(node.id).forEach(con => {\n          const connector = targetGraph.getConnector(con.id);\n          if (isPlaceHolderConnector(connector)) {\n            refConnectorIdsArray = [...refConnectorIdsArray, ...connector.realConnectors];\n          } else {\n            refConnectorIdsArray.push(con.id);\n          }\n        });\n\n        const metaData: AddNodeHandlerParams = {\n          refType: 'connector',\n          refId: refConnectorIdsArray\n        };\n\n        // create a new placeholder node\n        const newNode: OmitStrict<AddNodeProps, 'highlight' | 'addNodeHandler'> =\n          onGetNewNode(metaData);\n        const placeHolderNode: PlaceHolderNode = {\n          ...newNode,\n          realConnectors: refConnectorIdsArray\n        };\n\n        targetGraph.addNode(placeHolderNode);\n\n        // connect all in-connectors to a new node and create a new connector that connects from new node to the actual toNodeId.\n        targetGraph.getInConnectors(node.id).forEach(con => {\n          targetGraph.setConnector(con.id, {\n            toNodeId: placeHolderNode.id\n          });\n        });\n\n        const newConnector = onGetNewConnector(placeHolderNode.id, node.id, metaData);\n        const placeholderConnector: PlaceHolderConnector = {\n          ...newConnector,\n          realConnectors: refConnectorIdsArray\n        };\n\n        targetGraph.addConnector(placeholderConnector);\n      }\n    });\n\n    return targetGraph.getGraphData();\n  }\n};\n\nexport default PlaceHolderHelper;\n"]}

package/lib/components/FlowModeller/Utils/deleteNodeUtils.d.ts

@@ -1,30 +0,0 @@
-import type { NodeProps } from '../Node/Node.types';
-import type { Node, ConnectorProps, DirectedGraph, GraphData } from '../Renderer/Utils/Graph';
-export interface GraphDataAsMap {
-    nodes: Record<string, Node>;
-    connectors: Record<string, ConnectorProps>;
-}
-export interface DeleteNodeModalOption {
-    connector: ConnectorProps;
-    pathItems: GraphDataAsMap;
-    restItems: GraphDataAsMap;
-}
-export interface DeleteNodeModalResult {
-    options: DeleteNodeModalOption[];
-    selectedNodeId: string;
-    destinationNodeId?: string;
-    allItems: GraphDataAsMap;
-}
-export interface DeleteNodeOutcome {
-    graphData: GraphData<NodeProps, ConnectorProps>;
-    updates?: {
-        connectors: ConnectorProps[];
-    };
-    deletes: GraphDataAsMap;
-    error: boolean;
-}
-declare const deleteNodeUtils: {
-    getDeleteNodeOptions: (graph: DirectedGraph, nodeId: string) => DeleteNodeModalResult;
-};
-export default deleteNodeUtils;
-//# sourceMappingURL=deleteNodeUtils.d.ts.map

package/lib/components/FlowModeller/Utils/deleteNodeUtils.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"deleteNodeUtils.d.ts","sourceRoot":"","sources":["../../../../src/components/FlowModeller/Utils/deleteNodeUtils.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AACpD,OAAO,KAAK,EAAE,IAAI,EAAE,cAAc,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAI9F,MAAM,WAAW,cAAc;IAC7B,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAC5B,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;CAC5C;AAED,MAAM,WAAW,qBAAqB;IACpC,SAAS,EAAE,cAAc,CAAC;IAC1B,SAAS,EAAE,cAAc,CAAC;IAC1B,SAAS,EAAE,cAAc,CAAC;CAC3B;AAED,MAAM,WAAW,qBAAqB;IACpC,OAAO,EAAE,qBAAqB,EAAE,CAAC;IACjC,cAAc,EAAE,MAAM,CAAC;IACvB,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,QAAQ,EAAE,cAAc,CAAC;CAC1B;AAED,MAAM,WAAW,iBAAiB;IAChC,SAAS,EAAE,SAAS,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;IAChD,OAAO,CAAC,EAAE;QACR,UAAU,EAAE,cAAc,EAAE,CAAC;KAC9B,CAAC;IACF,OAAO,EAAE,cAAc,CAAC;IACxB,KAAK,EAAE,OAAO,CAAC;CAChB;AAED,QAAA,MAAM,eAAe;kCACW,aAAa,UAAU,MAAM,KAAG,qBAAqB;CA0FpF,CAAC;AAEF,eAAe,eAAe,CAAC"}

package/lib/components/FlowModeller/Utils/deleteNodeUtils.js

@@ -1,81 +0,0 @@
-import GraphTraversal from '../Renderer/Utils/GraphTraversal';
-const deleteNodeUtils = {
-    getDeleteNodeOptions: (graph, nodeId) => {
-        const convergenceData = GraphTraversal.getConvergenceData(graph.getGraphData(), nodeId);
-        if (convergenceData && convergenceData.paths) {
-            const options = convergenceData.paths.map(path => {
-                if (Array.isArray(path) &&
-                    !Array.isArray(path[0]) &&
-                    typeof path[0].connectors[0] === 'string') {
-                    let nodes = {};
-                    let connectors = {};
-                    // rest of the overall items
-                    const restItems = {
-                        nodes: {
-                            ...convergenceData.summary.nodesinvolved
-                        },
-                        connectors: {
-                            ...convergenceData.summary.connectorsInvolved
-                        }
-                    };
-                    path.forEach(item => {
-                        if (!Array.isArray(item)) {
-                            nodes = {
-                                ...nodes,
-                                ...item.summary.nodesinvolved
-                            };
-                            delete nodes[convergenceData.nodeId];
-                            // remove the above nodes from the restItems
-                            Object.keys(nodes).forEach(id => {
-                                delete restItems.nodes[id];
-                            });
-                            connectors = {
-                                ...connectors,
-                                ...item.summary.connectorsInvolved
-                            };
-                            // remove the above connectors from the restItems
-                            Object.keys(connectors).forEach(id => {
-                                delete restItems.connectors[id];
-                            });
-                        }
-                    });
-                    // ignore the destination node
-                    delete restItems.nodes[convergenceData.nodeId];
-                    return {
-                        connector: graph.getConnector(path[0].connectors[0]),
-                        pathItems: {
-                            nodes,
-                            connectors
-                        },
-                        restItems
-                    };
-                }
-                return [];
-            });
-            const result = {
-                options: options,
-                selectedNodeId: nodeId,
-                destinationNodeId: convergenceData.nodeId,
-                allItems: {
-                    nodes: convergenceData.summary.nodesinvolved,
-                    connectors: convergenceData.summary.connectorsInvolved
-                }
-            };
-            // ignore the destination node
-            if (result.allItems)
-                delete result.allItems.nodes[convergenceData.nodeId];
-            return result;
-        }
-        return {
-            options: [],
-            selectedNodeId: nodeId,
-            destinationNodeId: undefined,
-            allItems: {
-                nodes: {},
-                connectors: {}
-            }
-        };
-    }
-};
-export default deleteNodeUtils;
-//# sourceMappingURL=deleteNodeUtils.js.map

package/lib/components/FlowModeller/Utils/deleteNodeUtils.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"deleteNodeUtils.js","sourceRoot":"","sources":["../../../../src/components/FlowModeller/Utils/deleteNodeUtils.ts"],"names":[],"mappings":"AAEA,OAAO,cAAc,MAAM,kCAAkC,CAAC;AA8B9D,MAAM,eAAe,GAAG;IACtB,oBAAoB,EAAE,CAAC,KAAoB,EAAE,MAAc,EAAyB,EAAE;QACpF,MAAM,eAAe,GACnB,cAAc,CAAC,kBAAkB,CAAC,KAAK,CAAC,YAAY,EAAE,EAAE,MAAM,CAAC,CAAC;QAElE,IAAI,eAAe,IAAI,eAAe,CAAC,KAAK,EAAE,CAAC;YAC7C,MAAM,OAAO,GAAG,eAAe,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;gBAC/C,IACE,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;oBACnB,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACvB,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,QAAQ,EACzC,CAAC;oBACD,IAAI,KAAK,GAA4B,EAAE,CAAC;oBACxC,IAAI,UAAU,GAAiC,EAAE,CAAC;oBAElD,4BAA4B;oBAC5B,MAAM,SAAS,GAAG;wBAChB,KAAK,EAAE;4BACL,GAAG,eAAe,CAAC,OAAO,CAAC,aAAa;yBACzC;wBACD,UAAU,EAAE;4BACV,GAAG,eAAe,CAAC,OAAO,CAAC,kBAAkB;yBAC9C;qBACF,CAAC;oBAEF,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;wBAClB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;4BACzB,KAAK,GAAG;gCACN,GAAG,KAAK;gCACR,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa;6BAC9B,CAAC;4BAEF,OAAO,KAAK,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;4BAErC,4CAA4C;4BAC5C,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;gCAC9B,OAAO,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;4BAC7B,CAAC,CAAC,CAAC;4BAEH,UAAU,GAAG;gCACX,GAAG,UAAU;gCACb,GAAG,IAAI,CAAC,OAAO,CAAC,kBAAkB;6BACnC,CAAC;4BAEF,iDAAiD;4BACjD,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;gCACnC,OAAO,SAAS,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;4BAClC,CAAC,CAAC,CAAC;wBACL,CAAC;oBACH,CAAC,CAAC,CAAC;oBAEH,8BAA8B;oBAC9B,OAAO,SAAS,CAAC,KAAK,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;oBAE/C,OAAO;wBACL,SAAS,EAAE,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;wBACpD,SAAS,EAAE;4BACT,KAAK;4BACL,UAAU;yBACX;wBACD,SAAS;qBACV,CAAC;gBACJ,CAAC;gBACD,OAAO,EAAE,CAAC;YACZ,CAAC,CAAC,CAAC;YAEH,MAAM,MAAM,GAA0B;gBACpC,OAAO,EAAE,OAAkC;gBAC3C,cAAc,EAAE,MAAM;gBACtB,iBAAiB,EAAE,eAAe,CAAC,MAAM;gBACzC,QAAQ,EAAE;oBACR,KAAK,EAAE,eAAe,CAAC,OAAO,CAAC,aAAa;oBAC5C,UAAU,EAAE,eAAe,CAAC,OAAO,CAAC,kBAAkB;iBACvD;aACF,CAAC;YAEF,8BAA8B;YAC9B,IAAI,MAAM,CAAC,QAAQ;gBAAE,OAAO,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;YAE1E,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,OAAO;YACL,OAAO,EAAE,EAAE;YACX,cAAc,EAAE,MAAM;YACtB,iBAAiB,EAAE,SAAS;YAC5B,QAAQ,EAAE;gBACR,KAAK,EAAE,EAAE;gBACT,UAAU,EAAE,EAAE;aACf;SACF,CAAC;IACJ,CAAC;CACF,CAAC;AAEF,eAAe,eAAe,CAAC","sourcesContent":["import type { NodeProps } from '../Node/Node.types';\nimport type { Node, ConnectorProps, DirectedGraph, GraphData } from '../Renderer/Utils/Graph';\nimport GraphTraversal from '../Renderer/Utils/GraphTraversal';\nimport type { ConvergenceData } from '../Renderer/Utils/GraphTraversal';\n\nexport interface GraphDataAsMap {\n  nodes: Record<string, Node>;\n  connectors: Record<string, ConnectorProps>;\n}\n\nexport interface DeleteNodeModalOption {\n  connector: ConnectorProps;\n  pathItems: GraphDataAsMap;\n  restItems: GraphDataAsMap;\n}\n\nexport interface DeleteNodeModalResult {\n  options: DeleteNodeModalOption[];\n  selectedNodeId: string;\n  destinationNodeId?: string;\n  allItems: GraphDataAsMap;\n}\n\nexport interface DeleteNodeOutcome {\n  graphData: GraphData<NodeProps, ConnectorProps>;\n  updates?: {\n    connectors: ConnectorProps[];\n  };\n  deletes: GraphDataAsMap;\n  error: boolean;\n}\n\nconst deleteNodeUtils = {\n  getDeleteNodeOptions: (graph: DirectedGraph, nodeId: string): DeleteNodeModalResult => {\n    const convergenceData: ConvergenceData<Node, ConnectorProps> | false =\n      GraphTraversal.getConvergenceData(graph.getGraphData(), nodeId);\n\n    if (convergenceData && convergenceData.paths) {\n      const options = convergenceData.paths.map(path => {\n        if (\n          Array.isArray(path) &&\n          !Array.isArray(path[0]) &&\n          typeof path[0].connectors[0] === 'string'\n        ) {\n          let nodes: GraphDataAsMap['nodes'] = {};\n          let connectors: GraphDataAsMap['connectors'] = {};\n\n          // rest of the overall items\n          const restItems = {\n            nodes: {\n              ...convergenceData.summary.nodesinvolved\n            },\n            connectors: {\n              ...convergenceData.summary.connectorsInvolved\n            }\n          };\n\n          path.forEach(item => {\n            if (!Array.isArray(item)) {\n              nodes = {\n                ...nodes,\n                ...item.summary.nodesinvolved\n              };\n\n              delete nodes[convergenceData.nodeId];\n\n              // remove the above nodes from the restItems\n              Object.keys(nodes).forEach(id => {\n                delete restItems.nodes[id];\n              });\n\n              connectors = {\n                ...connectors,\n                ...item.summary.connectorsInvolved\n              };\n\n              // remove the above connectors from the restItems\n              Object.keys(connectors).forEach(id => {\n                delete restItems.connectors[id];\n              });\n            }\n          });\n\n          // ignore the destination node\n          delete restItems.nodes[convergenceData.nodeId];\n\n          return {\n            connector: graph.getConnector(path[0].connectors[0]),\n            pathItems: {\n              nodes,\n              connectors\n            },\n            restItems\n          };\n        }\n        return [];\n      });\n\n      const result: DeleteNodeModalResult = {\n        options: options as DeleteNodeModalOption[],\n        selectedNodeId: nodeId,\n        destinationNodeId: convergenceData.nodeId,\n        allItems: {\n          nodes: convergenceData.summary.nodesinvolved,\n          connectors: convergenceData.summary.connectorsInvolved\n        }\n      };\n\n      // ignore the destination node\n      if (result.allItems) delete result.allItems.nodes[convergenceData.nodeId];\n\n      return result;\n    }\n    return {\n      options: [],\n      selectedNodeId: nodeId,\n      destinationNodeId: undefined,\n      allItems: {\n        nodes: {},\n        connectors: {}\n      }\n    };\n  }\n};\n\nexport default deleteNodeUtils;\n"]}

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

@@ -1,39 +0,0 @@
-import type { GraphData, ConnectorProps } from './Renderer/Utils/Graph';
-import type { AddNodeHandlerParams } from './Renderer/Renderer.types';
-import type { NodeProps, NodeType } from './Node/Node.types';
-import type { DeleteNodeOutcome } from './Utils/deleteNodeUtils';
-export interface AddHelperParams {
-    nodeType: NodeType;
-    graphData: GraphData<NodeProps, ConnectorProps>;
-    metaData: AddNodeHandlerParams;
-    connectorsCount?: number;
-    getNewNode?: () => NodeProps;
-    isBranchNode: boolean;
-    getNewConnector?: (fromNodeId: string, toNodeId: string) => ConnectorProps;
-}
-export interface NodeInfo<T extends NodeProps = NodeProps, U extends ConnectorProps = ConnectorProps> {
-    node: T;
-    inConnectors: U[];
-    outConnectors: U[];
-}
-declare const helpers: {
-    addConnector(graphData: GraphData<NodeProps, ConnectorProps>, nodeId: string, label?: string, getNewConnector?: AddHelperParams["getNewConnector"]): {
-        graphData: GraphData<NodeProps, ConnectorProps<unknown>>;
-        connector: ConnectorProps<unknown>;
-    } | {
-        graphData: {
-            nodes: never[];
-            connectors: never[];
-        };
-        connector: {};
-    };
-    deleteConnector: (graphData: GraphData<NodeProps, ConnectorProps>, connector: ConnectorProps) => DeleteNodeOutcome;
-    addNode: ({ graphData, nodeType, isBranchNode, metaData, getNewNode, getNewConnector, connectorsCount }: AddHelperParams) => {
-        graphData: GraphData<NodeProps, ConnectorProps<unknown>>;
-        node: NodeProps;
-    };
-    deleteNode(graphData: GraphData<NodeProps, ConnectorProps>, nodeId: string): DeleteNodeOutcome | false;
-    selectNode(graphData: GraphData<NodeProps, ConnectorProps>, nodeId: NodeProps["id"]): NodeInfo;
-};
-export default helpers;
-//# sourceMappingURL=helper.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"helper.d.ts","sourceRoot":"","sources":["../../../src/components/FlowModeller/helper.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,SAAS,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AACxE,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,2BAA2B,CAAC;AACtE,OAAO,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAG7D,OAAO,KAAK,EAAE,iBAAiB,EAAkB,MAAM,yBAAyB,CAAC;AAEjF,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,YAAY,EAAE,OAAO,CAAC;IACtB,eAAe,CAAC,EAAE,CAAC,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,KAAK,cAAc,CAAC;CAC5E;AAED,MAAM,WAAW,QAAQ,CACvB,CAAC,SAAS,SAAS,GAAG,SAAS,EAC/B,CAAC,SAAS,cAAc,GAAG,cAAc;IAEzC,IAAI,EAAE,CAAC,CAAC;IACR,YAAY,EAAE,CAAC,EAAE,CAAC;IAClB,aAAa,EAAE,CAAC,EAAE,CAAC;CACpB;AAED,QAAA,MAAM,OAAO;4BAEE,SAAS,CAAC,SAAS,EAAE,cAAc,CAAC,UACvC,MAAM,UACN,MAAM,oBACI,eAAe,CAAC,iBAAiB,CAAC;;;;;;;;;;iCA4BzB,SAAS,CAAC,SAAS,EAAE,cAAc,CAAC,aAAa,cAAc;6GA8EzF,eAAe;;;;0BA8DL,SAAS,CAAC,SAAS,EAAE,cAAc,CAAC,UACvC,MAAM,GACb,iBAAiB,GAAG,KAAK;0BAkDN,SAAS,CAAC,SAAS,EAAE,cAAc,CAAC,UAAU,SAAS,CAAC,IAAI,CAAC,GAAG,QAAQ;CAW/F,CAAC;AAEF,eAAe,OAAO,CAAC"}