@pega/cosmos-react-build 9.0.0-build.9.9 → 9.0.0

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

@@ -0,0 +1,363 @@
+import { DirectedGraph } from './Graph';
+import GraphTraversal from './GraphTraversal';
+/**
+ * Checks if the given graphItem is a part of multi branch convergence scenario and returns the convergence data and parent id
+ * @param graphItem - node or connector
+ * @param graph - Directed graph object
+ */
+export const getParentConvergence = (graphItem, graph) => {
+    const gd = graph.getGraphData();
+    /** As convergence data exists only for node
+     * if the given graphItem is a connector then
+     * reset it to the source node of first in-connector
+     */
+    let parent = 'dimensions' in graphItem ? graphItem : graph.getNode(graphItem.fromNodeId);
+    // loop until a node with convergence data is found and the given graphItem is a part of the convergence data
+    while (graph.getInConnectors(parent.id).length > 0) {
+        /** if convergence data exists check whether the graphItem is exists in nodesInvolved or connectorsInvolved
+         * if graphItem exists in the summary then return the current convergence data
+         */
+        const convergence = GraphTraversal.getConvergenceData(gd, parent.id);
+        if (convergence &&
+            convergence.paths &&
+            (graphItem.id in convergence.summary.nodesInvolved ||
+                graphItem.id in convergence.summary.connectorsInvolved)) {
+            for (let i = 0; i < convergence.paths.length; i += 1) {
+                const pathData = convergence.paths[i];
+                if (Array.isArray(pathData)) {
+                    for (let j = 0; j < pathData.length; j += 1) {
+                        const pathItem = pathData[j];
+                        if (!Array.isArray(pathItem) &&
+                            (graphItem.id in pathItem.summary.nodesInvolved ||
+                                graphItem.id in pathItem.summary.connectorsInvolved)) {
+                            return { convergence, pathIndex: i, itemIndexInPath: j, parent };
+                        }
+                    }
+                }
+            }
+        }
+        /** if current graphItem(parent) is not a part of convergence data
+         * set it to source node of first in-connector
+         */
+        parent = graph.getNode(graph.getInConnectors(parent.id)[0].fromNodeId);
+    }
+    return false;
+};
+/** Returns an object where keys are y-cords of node/connector and
+ * values are an array of node/connector id's having same y-cord as key
+ * @param graph - Directed graph object
+ */
+export const groupByPosition = (graph) => {
+    const graphData = [...graph.getNodes(), ...graph.getConnectors()];
+    const positions = {};
+    graphData.forEach((graphItem) => {
+        /** check if current graphItem's y-cord exists as a key in positions object
+         * if key exists then insert the current graphItem id in appropriate index of the value array sorted by x-cord
+         * else create a key value pair where key is the y-cord and value is an array with current graphItem id
+         */
+        if (graphItem) {
+            if ('dimensions' in graphItem) {
+                const yCoordinate = graphItem.dimensions.height
+                    ? graphItem.position.y
+                    : graphItem.position.y - 60;
+                if (yCoordinate in positions) {
+                    const graphItemIds = positions[yCoordinate];
+                    for (let i = graphItemIds.length - 1; i >= 0; i -= 1) {
+                        const node = graph.getNode(graphItemIds[i]);
+                        if (graphItem.position && node.position && graphItem.position.x < node.position.x) {
+                            if (i === 0) {
+                                graphItemIds.unshift(graphItem.id);
+                            }
+                        }
+                        else {
+                            if (graphItemIds.length === 1) {
+                                graphItemIds.push(graphItem.id);
+                                break;
+                            }
+                            graphItemIds.splice(i + 1, 0, graphItem.id);
+                            break;
+                        }
+                    }
+                }
+                else {
+                    positions[graphItem.position.y] = [graphItem.id];
+                }
+            }
+            else if (graphItem.points.length > 3) {
+                const y = graphItem.points[3].y - 20;
+                if (y in positions) {
+                    const graphItemIds = positions[y];
+                    for (let i = graphItemIds.length - 1; i >= 0; i -= 1) {
+                        const connector = graph.getConnector(graphItemIds[i]);
+                        if (graphItem.points.length &&
+                            connector?.points?.length &&
+                            graphItem.points[3].x < connector.points[3].x) {
+                            if (i === 0) {
+                                graphItemIds.unshift(graphItem.id);
+                            }
+                        }
+                        else {
+                            if (graphItemIds.length === 1) {
+                                graphItemIds.push(graphItem.id);
+                                break;
+                            }
+                            graphItemIds.splice(i + 1, 0, graphItem.id);
+                            break;
+                        }
+                    }
+                }
+                else {
+                    positions[y] = [graphItem.id];
+                }
+            }
+        }
+    });
+    return positions;
+};
+export const arrowUpKey = ({ activeGraphItemId, activeGraphItem, readOnly, graph }) => {
+    if (readOnly) {
+        const prevNode = graph.getPrevNodes(activeGraphItemId).slice(-1)[0];
+        if (!prevNode) {
+            return GraphTraversal.findLeafNode(graph);
+        }
+        if (!prevNode.dimensions.height) {
+            const inConnectors = graph.getInConnectors(prevNode.id);
+            return inConnectors[0].fromNodeId;
+        }
+        return prevNode.id;
+    }
+    // Node
+    if ('dimensions' in activeGraphItem) {
+        const inConnectors = graph.getInConnectors(activeGraphItemId);
+        if (inConnectors.length > 0) {
+            return inConnectors[0].id;
+        }
+        return GraphTraversal.findLeafNode(graph);
+    }
+    // for Connector
+    const targetNode = graph.getNode(graph.getConnector(activeGraphItemId).fromNodeId);
+    if (targetNode.dimensions.height) {
+        return targetNode.id;
+    }
+    const parentConvergence = getParentConvergence(targetNode, graph);
+    if (parentConvergence) {
+        const connectorId = parentConvergence.convergence.connectors[0]?.[0];
+        if (typeof connectorId !== 'string') {
+            return undefined;
+        }
+        const connectorFromNode = graph.getNode(graph.getConnector(connectorId).fromNodeId);
+        if (connectorFromNode.type?.minConnectors || !connectorFromNode.dimensions.height) {
+            return connectorId;
+        }
+        if (connectorFromNode.dimensions.height) {
+            return graph.getConnector(connectorId).fromNodeId;
+        }
+    }
+    return undefined;
+};
+export const arrowDownKey = ({ activeGraphItemId, activeGraphItem, readOnly, graph }) => {
+    if (readOnly) {
+        let nextNode = graph.getNextNodes(activeGraphItemId)[0];
+        if (!nextNode) {
+            return GraphTraversal.findRootNode(graph);
+        }
+        while (!nextNode.dimensions.height) {
+            [nextNode] = graph.getNextNodes(nextNode.id);
+        }
+        return nextNode.id;
+    }
+    // for Node
+    if ('dimensions' in activeGraphItem) {
+        const outConnectors = graph.getOutConnectors(activeGraphItemId);
+        if (outConnectors.length > 0) {
+            if (activeGraphItem.type?.minConnectors) {
+                return outConnectors[0].id;
+            }
+            return graph.getOutConnectors(outConnectors[0].toNodeId)[0].id;
+        }
+        return GraphTraversal.findRootNode(graph);
+    }
+    // for Connector
+    const targetNode = graph.getNode(graph.getConnector(activeGraphItemId).toNodeId);
+    if (targetNode.dimensions.height) {
+        return targetNode.id;
+    }
+    return graph.getOutConnectors(targetNode.id)[0].id;
+};
+export const horizontalNavigation = ({ positions, activeGraphItem, keyEvent, graph, readOnly }) => {
+    const pointsIndex = 3;
+    const yCoordinate = 20;
+    let focusId;
+    const rankGroup = 'dimensions' in activeGraphItem
+        ? positions[activeGraphItem.position.y]
+        : positions[activeGraphItem.points[pointsIndex].y - yCoordinate];
+    let itemIndex = rankGroup.indexOf(activeGraphItem.id);
+    if (keyEvent === 'ArrowLeft') {
+        /**
+         * If current active graph item is a connector and previous connector in rank group is originating from a Go to node
+         * then iterate the rank group until we find a connector thats not originating from a go to node
+         * and is not the first connector in the rank group
+         */
+        while (itemIndex > 0 && !('dimensions' in activeGraphItem)) {
+            const previousConnector = graph.getConnector(rankGroup[itemIndex - 1]);
+            const sourceNode = graph.getNode(previousConnector.fromNodeId);
+            if (sourceNode.type?.minConnectors === 0) {
+                itemIndex -= 1;
+            }
+            else {
+                break;
+            }
+        }
+        if (itemIndex > 0) {
+            /**
+             * If current focused graph item is a node and previous node to focus in rank group is a placeholder node
+             * then get the in-connectors of placeholder node and focus on the last focusable item(node/connector add node button)
+             * of the last in-connector
+             * If the previous node in rank group is not placeholder node then directly focus it
+             */
+            if ('dimensions' in activeGraphItem) {
+                const parallelNodeInPreviousPath = graph.getNode(rankGroup[itemIndex - 1]);
+                if (parallelNodeInPreviousPath.dimensions.height) {
+                    focusId = rankGroup[itemIndex - 1];
+                }
+                else {
+                    const inConnectors = graph.getInConnectors(parallelNodeInPreviousPath.id);
+                    const lastInConnectorIndex = inConnectors.length - 1;
+                    if (readOnly) {
+                        let sourceNode = graph.getNode(inConnectors[lastInConnectorIndex].fromNodeId);
+                        while (!sourceNode.dimensions.height) {
+                            const sourceNodeInConnectors = graph.getInConnectors(sourceNode.id);
+                            if (sourceNodeInConnectors.length) {
+                                sourceNode = graph.getNode(sourceNodeInConnectors[sourceNodeInConnectors.length - 1].fromNodeId);
+                            }
+                        }
+                        focusId = sourceNode.id;
+                    }
+                    else {
+                        const sourceNode = graph.getNode(inConnectors[lastInConnectorIndex].fromNodeId);
+                        if (sourceNode.type?.minConnectors === 0) {
+                            focusId = inConnectors[lastInConnectorIndex].fromNodeId;
+                        }
+                        else {
+                            focusId = inConnectors[lastInConnectorIndex].id;
+                        }
+                    }
+                }
+            }
+            else {
+                focusId = rankGroup[itemIndex - 1];
+            }
+        }
+        else {
+            /**
+             * If current focused item is the first item in the rank group
+             * then check if there is branch of the same convergence or any parent convergence is present to the left of the current focused item
+             * if so then focus on the first focusable in that branch/path
+             */
+            let result = getParentConvergence(activeGraphItem, graph);
+            while (result && result.pathIndex === 0) {
+                result = getParentConvergence(result.parent, graph);
+            }
+            if (result) {
+                const connectorInPreviousPath = graph.getOutConnectors(result.parent.id)[result.pathIndex - 1];
+                if (readOnly) {
+                    let nodeIdInPreviousPath = graph.getNode(connectorInPreviousPath.toNodeId);
+                    while (!nodeIdInPreviousPath.dimensions.height) {
+                        const outConnectors = graph.getOutConnectors(nodeIdInPreviousPath.id);
+                        if (outConnectors.length) {
+                            nodeIdInPreviousPath = graph.getNode(outConnectors[0].toNodeId);
+                        }
+                    }
+                    focusId = nodeIdInPreviousPath.id;
+                }
+                else {
+                    focusId = connectorInPreviousPath.id;
+                }
+            }
+        }
+    }
+    if (keyEvent === 'ArrowRight') {
+        /**
+         * If current active graph item is a connector and next connector in rank group is originating from a Goto node
+         * then iterate the rank group until we find a connector thats not originating from a Goto node
+         * and is not the last connector in the rank group
+         */
+        while (itemIndex < rankGroup.length - 1 && !('dimensions' in activeGraphItem)) {
+            const nextConnector = graph.getConnector(rankGroup[itemIndex + 1]);
+            const sourceNode = graph.getNode(nextConnector.fromNodeId);
+            if (sourceNode.type?.minConnectors === 0) {
+                itemIndex += 1;
+            }
+            else {
+                break;
+            }
+        }
+        if (itemIndex < rankGroup.length - 1) {
+            if ('dimensions' in activeGraphItem) {
+                /**
+                 * If current focused graph item is a node and next node to focus in rank group is a placeholder node
+                 * then get the in-connectors of placeholder node and focus on the last focusable item(node/connector add node button)
+                 * of the first in-connector
+                 * If the next node in rank group is not placeholder node then directly focus it
+                 */
+                const parallelNodeInNextPath = graph.getNode(rankGroup[itemIndex + 1]);
+                if (parallelNodeInNextPath.dimensions.height) {
+                    focusId = rankGroup[itemIndex + 1];
+                }
+                else {
+                    const inConnectors = graph.getInConnectors(parallelNodeInNextPath.id);
+                    if (readOnly) {
+                        let sourceNode = graph.getNode(inConnectors[0].fromNodeId);
+                        while (!sourceNode.dimensions.height) {
+                            const sourceNodeInConnectors = graph.getInConnectors(sourceNode.id);
+                            if (sourceNodeInConnectors.length) {
+                                sourceNode = graph.getNode(sourceNodeInConnectors[0].fromNodeId);
+                            }
+                        }
+                        focusId = sourceNode.id;
+                    }
+                    else {
+                        const sourceNode = graph.getNode(inConnectors[0].fromNodeId);
+                        if (sourceNode.type?.minConnectors === 0) {
+                            focusId = inConnectors[0].fromNodeId;
+                        }
+                        else {
+                            focusId = inConnectors[0].id;
+                        }
+                    }
+                }
+            }
+            else {
+                focusId = rankGroup[itemIndex + 1];
+            }
+        }
+        else {
+            /**
+             * If current focused item is the last item in the rank group
+             * then check if there is branch of the same convergence or any parent convergence is present to the right of the current focused item
+             * if so then focus on the first focusable in that branch/path
+             */
+            let result = getParentConvergence(activeGraphItem, graph);
+            while (result &&
+                result.convergence.paths &&
+                result.pathIndex === result.convergence.paths.length - 1) {
+                result = getParentConvergence(result.parent, graph);
+            }
+            if (result) {
+                const connectorInNextPath = graph.getOutConnectors(result.parent.id)[result.pathIndex + 1];
+                if (readOnly) {
+                    let nodeIdInNextPath = graph.getNode(connectorInNextPath.toNodeId);
+                    while (!nodeIdInNextPath.dimensions.height) {
+                        nodeIdInNextPath = graph.getNode(graph.getOutConnectors(nodeIdInNextPath.id)[0].toNodeId);
+                    }
+                    focusId = nodeIdInNextPath.id;
+                }
+                else {
+                    focusId = connectorInNextPath.id;
+                }
+            }
+        }
+    }
+    return focusId;
+};
+//# sourceMappingURL=RendererUtils.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"RendererUtils.js","sourceRoot":"","sources":["../../../../../src/components/FlowModeller/Renderer/Utils/RendererUtils.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AAGxC,OAAO,cAAc,MAAM,kBAAkB,CAAC;AAU9C;;;;GAIG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAClC,SAAmD,EACnD,KAA6D,EAClC,EAAE;IAC7B,MAAM,EAAE,GAAG,KAAK,CAAC,YAAY,EAAE,CAAC;IAChC;;;OAGG;IACH,IAAI,MAAM,GACR,YAAY,IAAI,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;IAE9E,6GAA6G;IAC7G,OAAO,KAAK,CAAC,eAAe,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACnD;;WAEG;QACH,MAAM,WAAW,GAAG,cAAc,CAAC,kBAAkB,CACnD,EAAE,EACF,MAAM,CAAC,EAAE,CACV,CAAC;QACF,IACE,WAAW;YACX,WAAW,CAAC,KAAK;YACjB,CAAC,SAAS,CAAC,EAAE,IAAI,WAAW,CAAC,OAAO,CAAC,aAAa;gBAChD,SAAS,CAAC,EAAE,IAAI,WAAW,CAAC,OAAO,CAAC,kBAAkB,CAAC,EACzD,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;gBACrD,MAAM,QAAQ,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACtC,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;wBAC5C,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;wBAC7B,IACE,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC;4BACxB,CAAC,SAAS,CAAC,EAAE,IAAI,QAAQ,CAAC,OAAO,CAAC,aAAa;gCAC7C,SAAS,CAAC,EAAE,IAAI,QAAQ,CAAC,OAAO,CAAC,kBAAkB,CAAC,EACtD,CAAC;4BACD,OAAO,EAAE,WAAW,EAAE,SAAS,EAAE,CAAC,EAAE,eAAe,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC;wBACnE,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD;;WAEG;QACH,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,eAAe,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;IACzE,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,KAA6D,EAAE,EAAE;IAC/F,MAAM,SAAS,GAAG,CAAC,GAAG,KAAK,CAAC,QAAQ,EAAE,EAAE,GAAG,KAAK,CAAC,aAAa,EAAE,CAAC,CAAC;IAClE,MAAM,SAAS,GAGX,EAAE,CAAC;IAEP,SAAS,CAAC,OAAO,CAAC,CAAC,SAAmD,EAAE,EAAE;QACxE;;;WAGG;QACH,IAAI,SAAS,EAAE,CAAC;YACd,IAAI,YAAY,IAAI,SAAS,EAAE,CAAC;gBAC9B,MAAM,WAAW,GAAG,SAAS,CAAC,UAAU,CAAC,MAAM;oBAC7C,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;oBACtB,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,GAAG,EAAE,CAAC;gBAC9B,IAAI,WAAW,IAAI,SAAS,EAAE,CAAC;oBAC7B,MAAM,YAAY,GAAG,SAAS,CAAC,WAAW,CAAC,CAAC;oBAC5C,KAAK,IAAI,CAAC,GAAG,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;wBACrD,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;wBAC5C,IAAI,SAAS,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,IAAI,SAAS,CAAC,QAAQ,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC;4BAClF,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gCACZ,YAAY,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;4BACrC,CAAC;wBACH,CAAC;6BAAM,CAAC;4BACN,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gCAC9B,YAAY,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;gCAChC,MAAM;4BACR,CAAC;4BACD,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC;4BAC5C,MAAM;wBACR,CAAC;oBACH,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,SAAS,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;gBACnD,CAAC;YACH,CAAC;iBAAM,IAAI,SAAS,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACvC,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;gBACrC,IAAI,CAAC,IAAI,SAAS,EAAE,CAAC;oBACnB,MAAM,YAAY,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;oBAClC,KAAK,IAAI,CAAC,GAAG,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;wBACrD,MAAM,SAAS,GAAG,KAAK,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;wBACtD,IACE,SAAS,CAAC,MAAM,CAAC,MAAM;4BACvB,SAAS,EAAE,MAAM,EAAE,MAAM;4BACzB,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAC7C,CAAC;4BACD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gCACZ,YAAY,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;4BACrC,CAAC;wBACH,CAAC;6BAAM,CAAC;4BACN,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gCAC9B,YAAY,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;gCAChC,MAAM;4BACR,CAAC;4BACD,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC;4BAC5C,MAAM;wBACR,CAAC;oBACH,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;gBAChC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,SAAS,CAAC;AACnB,CAAC,CAAC;AAiBF,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,EACzB,iBAAiB,EACjB,eAAe,EACf,QAAQ,EACR,KAAK,EACmB,EAAE,EAAE;IAC5B,IAAI,QAAQ,EAAE,CAAC;QACb,MAAM,QAAQ,GAAG,KAAK,CAAC,YAAY,CAAC,iBAAiB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpE,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,OAAO,cAAc,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QAC5C,CAAC;QACD,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;YAChC,MAAM,YAAY,GAAG,KAAK,CAAC,eAAe,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YACxD,OAAO,YAAY,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;QACpC,CAAC;QACD,OAAO,QAAQ,CAAC,EAAE,CAAC;IACrB,CAAC;IAED,OAAO;IACP,IAAI,YAAY,IAAI,eAAe,EAAE,CAAC;QACpC,MAAM,YAAY,GAAG,KAAK,CAAC,eAAe,CAAC,iBAAiB,CAAC,CAAC;QAC9D,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,OAAO,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5B,CAAC;QACD,OAAO,cAAc,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;IAC5C,CAAC;IAED,gBAAgB;IAChB,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,YAAY,CAAC,iBAAiB,CAAC,CAAC,UAAU,CAAC,CAAC;IACnF,IAAI,UAAU,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;QACjC,OAAO,UAAU,CAAC,EAAE,CAAC;IACvB,CAAC;IACD,MAAM,iBAAiB,GAAG,oBAAoB,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;IAClE,IAAI,iBAAiB,EAAE,CAAC;QACtB,MAAM,WAAW,GAAG,iBAAiB,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACrE,IAAI,OAAO,WAAW,KAAK,QAAQ,EAAE,CAAC;YACpC,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,MAAM,iBAAiB,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,UAAU,CAAC,CAAC;QACpF,IAAI,iBAAiB,CAAC,IAAI,EAAE,aAAa,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;YAClF,OAAO,WAAW,CAAC;QACrB,CAAC;QACD,IAAI,iBAAiB,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;YACxC,OAAO,KAAK,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,UAAU,CAAC;QACpD,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,EAC3B,iBAAiB,EACjB,eAAe,EACf,QAAQ,EACR,KAAK,EACmB,EAAE,EAAE;IAC5B,IAAI,QAAQ,EAAE,CAAC;QACb,IAAI,QAAQ,GAAG,KAAK,CAAC,YAAY,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;QACxD,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,OAAO,cAAc,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QAC5C,CAAC;QACD,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;YACnC,CAAC,QAAQ,CAAC,GAAG,KAAK,CAAC,YAAY,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAC/C,CAAC;QACD,OAAO,QAAQ,CAAC,EAAE,CAAC;IACrB,CAAC;IACD,WAAW;IACX,IAAI,YAAY,IAAI,eAAe,EAAE,CAAC;QACpC,MAAM,aAAa,GAAG,KAAK,CAAC,gBAAgB,CAAC,iBAAiB,CAAC,CAAC;QAChE,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7B,IAAI,eAAe,CAAC,IAAI,EAAE,aAAa,EAAE,CAAC;gBACxC,OAAO,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAC7B,CAAC;YACD,OAAO,KAAK,CAAC,gBAAgB,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACjE,CAAC;QACD,OAAO,cAAc,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;IAC5C,CAAC;IACD,gBAAgB;IAChB,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,YAAY,CAAC,iBAAiB,CAAC,CAAC,QAAQ,CAAC,CAAC;IACjF,IAAI,UAAU,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;QACjC,OAAO,UAAU,CAAC,EAAE,CAAC;IACvB,CAAC;IACD,OAAO,KAAK,CAAC,gBAAgB,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AACrD,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,EACnC,SAAS,EACT,eAAe,EACf,QAAQ,EACR,KAAK,EACL,QAAQ,EACkB,EAAE,EAAE;IAC9B,MAAM,WAAW,GAAG,CAAC,CAAC;IACtB,MAAM,WAAW,GAAG,EAAE,CAAC;IACvB,IAAI,OAA2B,CAAC;IAEhC,MAAM,SAAS,GACb,YAAY,IAAI,eAAe;QAC7B,CAAC,CAAC,SAAS,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC;QACvC,CAAC,CAAC,SAAS,CAAC,eAAe,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC;IACrE,IAAI,SAAS,GAAG,SAAS,CAAC,OAAO,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;IAEtD,IAAI,QAAQ,KAAK,WAAW,EAAE,CAAC;QAC7B;;;;WAIG;QACH,OAAO,SAAS,GAAG,CAAC,IAAI,CAAC,CAAC,YAAY,IAAI,eAAe,CAAC,EAAE,CAAC;YAC3D,MAAM,iBAAiB,GAAG,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC;YACvE,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,iBAAiB,CAAC,UAAU,CAAC,CAAC;YAC/D,IAAI,UAAU,CAAC,IAAI,EAAE,aAAa,KAAK,CAAC,EAAE,CAAC;gBACzC,SAAS,IAAI,CAAC,CAAC;YACjB,CAAC;iBAAM,CAAC;gBACN,MAAM;YACR,CAAC;QACH,CAAC;QACD,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;YAClB;;;;;eAKG;YACH,IAAI,YAAY,IAAI,eAAe,EAAE,CAAC;gBACpC,MAAM,0BAA0B,GAAG,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC;gBAC3E,IAAI,0BAA0B,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;oBACjD,OAAO,GAAG,SAAS,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;gBACrC,CAAC;qBAAM,CAAC;oBACN,MAAM,YAAY,GAAG,KAAK,CAAC,eAAe,CAAC,0BAA0B,CAAC,EAAE,CAAC,CAAC;oBAC1E,MAAM,oBAAoB,GAAG,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC;oBAErD,IAAI,QAAQ,EAAE,CAAC;wBACb,IAAI,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,oBAAoB,CAAC,CAAC,UAAU,CAAC,CAAC;wBAC9E,OAAO,CAAC,UAAU,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;4BACrC,MAAM,sBAAsB,GAAG,KAAK,CAAC,eAAe,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;4BACpE,IAAI,sBAAsB,CAAC,MAAM,EAAE,CAAC;gCAClC,UAAU,GAAG,KAAK,CAAC,OAAO,CACxB,sBAAsB,CAAC,sBAAsB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,UAAU,CACrE,CAAC;4BACJ,CAAC;wBACH,CAAC;wBACD,OAAO,GAAG,UAAU,CAAC,EAAE,CAAC;oBAC1B,CAAC;yBAAM,CAAC;wBACN,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,oBAAoB,CAAC,CAAC,UAAU,CAAC,CAAC;wBAChF,IAAI,UAAU,CAAC,IAAI,EAAE,aAAa,KAAK,CAAC,EAAE,CAAC;4BACzC,OAAO,GAAG,YAAY,CAAC,oBAAoB,CAAC,CAAC,UAAU,CAAC;wBAC1D,CAAC;6BAAM,CAAC;4BACN,OAAO,GAAG,YAAY,CAAC,oBAAoB,CAAC,CAAC,EAAE,CAAC;wBAClD,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,OAAO,GAAG,SAAS,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;YACrC,CAAC;QACH,CAAC;aAAM,CAAC;YACN;;;;eAIG;YACH,IAAI,MAAM,GAAG,oBAAoB,CAAC,eAAe,EAAE,KAAK,CAAC,CAAC;YAC1D,OAAO,MAAM,IAAI,MAAM,CAAC,SAAS,KAAK,CAAC,EAAE,CAAC;gBACxC,MAAM,GAAG,oBAAoB,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YACtD,CAAC;YACD,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,uBAAuB,GAAG,KAAK,CAAC,gBAAgB,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CACtE,MAAM,CAAC,SAAS,GAAG,CAAC,CACrB,CAAC;gBACF,IAAI,QAAQ,EAAE,CAAC;oBACb,IAAI,oBAAoB,GAAG,KAAK,CAAC,OAAO,CAAC,uBAAuB,CAAC,QAAQ,CAAC,CAAC;oBAC3E,OAAO,CAAC,oBAAoB,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;wBAC/C,MAAM,aAAa,GAAG,KAAK,CAAC,gBAAgB,CAAC,oBAAoB,CAAC,EAAE,CAAC,CAAC;wBACtE,IAAI,aAAa,CAAC,MAAM,EAAE,CAAC;4BACzB,oBAAoB,GAAG,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;wBAClE,CAAC;oBACH,CAAC;oBACD,OAAO,GAAG,oBAAoB,CAAC,EAAE,CAAC;gBACpC,CAAC;qBAAM,CAAC;oBACN,OAAO,GAAG,uBAAuB,CAAC,EAAE,CAAC;gBACvC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,IAAI,QAAQ,KAAK,YAAY,EAAE,CAAC;QAC9B;;;;WAIG;QACH,OAAO,SAAS,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,YAAY,IAAI,eAAe,CAAC,EAAE,CAAC;YAC9E,MAAM,aAAa,GAAG,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC;YACnE,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;YAC3D,IAAI,UAAU,CAAC,IAAI,EAAE,aAAa,KAAK,CAAC,EAAE,CAAC;gBACzC,SAAS,IAAI,CAAC,CAAC;YACjB,CAAC;iBAAM,CAAC;gBACN,MAAM;YACR,CAAC;QACH,CAAC;QAED,IAAI,SAAS,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrC,IAAI,YAAY,IAAI,eAAe,EAAE,CAAC;gBACpC;;;;;mBAKG;gBACH,MAAM,sBAAsB,GAAG,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC;gBACvE,IAAI,sBAAsB,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;oBAC7C,OAAO,GAAG,SAAS,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;gBACrC,CAAC;qBAAM,CAAC;oBACN,MAAM,YAAY,GAAG,KAAK,CAAC,eAAe,CAAC,sBAAsB,CAAC,EAAE,CAAC,CAAC;oBAEtE,IAAI,QAAQ,EAAE,CAAC;wBACb,IAAI,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;wBAC3D,OAAO,CAAC,UAAU,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;4BACrC,MAAM,sBAAsB,GAAG,KAAK,CAAC,eAAe,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;4BACpE,IAAI,sBAAsB,CAAC,MAAM,EAAE,CAAC;gCAClC,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;4BACnE,CAAC;wBACH,CAAC;wBACD,OAAO,GAAG,UAAU,CAAC,EAAE,CAAC;oBAC1B,CAAC;yBAAM,CAAC;wBACN,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;wBAC7D,IAAI,UAAU,CAAC,IAAI,EAAE,aAAa,KAAK,CAAC,EAAE,CAAC;4BACzC,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;wBACvC,CAAC;6BAAM,CAAC;4BACN,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;wBAC/B,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,OAAO,GAAG,SAAS,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;YACrC,CAAC;QACH,CAAC;aAAM,CAAC;YACN;;;;eAIG;YACH,IAAI,MAAM,GAAG,oBAAoB,CAAC,eAAe,EAAE,KAAK,CAAC,CAAC;YAC1D,OACE,MAAM;gBACN,MAAM,CAAC,WAAW,CAAC,KAAK;gBACxB,MAAM,CAAC,SAAS,KAAK,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EACxD,CAAC;gBACD,MAAM,GAAG,oBAAoB,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YACtD,CAAC;YACD,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,mBAAmB,GAAG,KAAK,CAAC,gBAAgB,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;gBAC3F,IAAI,QAAQ,EAAE,CAAC;oBACb,IAAI,gBAAgB,GAAG,KAAK,CAAC,OAAO,CAAC,mBAAmB,CAAC,QAAQ,CAAC,CAAC;oBACnE,OAAO,CAAC,gBAAgB,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;wBAC3C,gBAAgB,GAAG,KAAK,CAAC,OAAO,CAC9B,KAAK,CAAC,gBAAgB,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CACxD,CAAC;oBACJ,CAAC;oBACD,OAAO,GAAG,gBAAgB,CAAC,EAAE,CAAC;gBAChC,CAAC;qBAAM,CAAC;oBACN,OAAO,GAAG,mBAAmB,CAAC,EAAE,CAAC;gBACnC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC,CAAC","sourcesContent":["import type { NodeProps } from '../../Node/Node.types';\n\nimport { DirectedGraph } from './Graph';\nimport type { ConnectorProps } from './Graph';\nimport type { PlottedGraphConnector, PlottedGraphNode } from './GraphLayout';\nimport GraphTraversal from './GraphTraversal';\nimport type { ConvergenceData } from './GraphTraversal';\n\nexport type ParentConvergence = {\n  convergence: ConvergenceData<PlottedGraphNode, PlottedGraphConnector>;\n  pathIndex: number;\n  itemIndexInPath: number;\n  parent: PlottedGraphNode;\n};\n\n/**\n * Checks if the given graphItem is a part of multi branch convergence scenario and returns the convergence data and parent id\n * @param graphItem - node or connector\n * @param graph - Directed graph object\n */\nexport const getParentConvergence = (\n  graphItem: PlottedGraphNode | PlottedGraphConnector,\n  graph: DirectedGraph<PlottedGraphNode, PlottedGraphConnector>\n): ParentConvergence | false => {\n  const gd = graph.getGraphData();\n  /** As convergence data exists only for node\n   * if the given graphItem is a connector then\n   * reset it to the source node of first in-connector\n   */\n  let parent: PlottedGraphNode | PlottedGraphConnector =\n    'dimensions' in graphItem ? graphItem : graph.getNode(graphItem.fromNodeId);\n\n  // loop until a node with convergence data is found and the given graphItem is a part of the convergence data\n  while (graph.getInConnectors(parent.id).length > 0) {\n    /** if convergence data exists check whether the graphItem is exists in nodesInvolved or connectorsInvolved\n     * if graphItem exists in the summary then return the current convergence data\n     */\n    const convergence = GraphTraversal.getConvergenceData<PlottedGraphNode, PlottedGraphConnector>(\n      gd,\n      parent.id\n    );\n    if (\n      convergence &&\n      convergence.paths &&\n      (graphItem.id in convergence.summary.nodesInvolved ||\n        graphItem.id in convergence.summary.connectorsInvolved)\n    ) {\n      for (let i = 0; i < convergence.paths.length; i += 1) {\n        const pathData = convergence.paths[i];\n        if (Array.isArray(pathData)) {\n          for (let j = 0; j < pathData.length; j += 1) {\n            const pathItem = pathData[j];\n            if (\n              !Array.isArray(pathItem) &&\n              (graphItem.id in pathItem.summary.nodesInvolved ||\n                graphItem.id in pathItem.summary.connectorsInvolved)\n            ) {\n              return { convergence, pathIndex: i, itemIndexInPath: j, parent };\n            }\n          }\n        }\n      }\n    }\n    /** if current graphItem(parent) is not a part of convergence data\n     * set it to source node of first in-connector\n     */\n    parent = graph.getNode(graph.getInConnectors(parent.id)[0].fromNodeId);\n  }\n\n  return false;\n};\n\n/** Returns an object where keys are y-cords of node/connector and\n * values are an array of node/connector id's having same y-cord as key\n * @param graph - Directed graph object\n */\nexport const groupByPosition = (graph: DirectedGraph<PlottedGraphNode, PlottedGraphConnector>) => {\n  const graphData = [...graph.getNodes(), ...graph.getConnectors()];\n  const positions: Record<\n    NodeProps['id'] | ConnectorProps['id'],\n    [NodeProps['id'] | ConnectorProps['id']]\n  > = {};\n\n  graphData.forEach((graphItem: PlottedGraphNode | PlottedGraphConnector) => {\n    /** check if current graphItem's y-cord exists as a key in positions object\n     * if key exists then insert the current graphItem id in appropriate index of the value array sorted by x-cord\n     * else create a key value pair where key is the y-cord and value is an array with current graphItem id\n     */\n    if (graphItem) {\n      if ('dimensions' in graphItem) {\n        const yCoordinate = graphItem.dimensions.height\n          ? graphItem.position.y\n          : graphItem.position.y - 60;\n        if (yCoordinate in positions) {\n          const graphItemIds = positions[yCoordinate];\n          for (let i = graphItemIds.length - 1; i >= 0; i -= 1) {\n            const node = graph.getNode(graphItemIds[i]);\n            if (graphItem.position && node.position && graphItem.position.x < node.position.x) {\n              if (i === 0) {\n                graphItemIds.unshift(graphItem.id);\n              }\n            } else {\n              if (graphItemIds.length === 1) {\n                graphItemIds.push(graphItem.id);\n                break;\n              }\n              graphItemIds.splice(i + 1, 0, graphItem.id);\n              break;\n            }\n          }\n        } else {\n          positions[graphItem.position.y] = [graphItem.id];\n        }\n      } else if (graphItem.points.length > 3) {\n        const y = graphItem.points[3].y - 20;\n        if (y in positions) {\n          const graphItemIds = positions[y];\n          for (let i = graphItemIds.length - 1; i >= 0; i -= 1) {\n            const connector = graph.getConnector(graphItemIds[i]);\n            if (\n              graphItem.points.length &&\n              connector?.points?.length &&\n              graphItem.points[3].x < connector.points[3].x\n            ) {\n              if (i === 0) {\n                graphItemIds.unshift(graphItem.id);\n              }\n            } else {\n              if (graphItemIds.length === 1) {\n                graphItemIds.push(graphItem.id);\n                break;\n              }\n              graphItemIds.splice(i + 1, 0, graphItem.id);\n              break;\n            }\n          }\n        } else {\n          positions[y] = [graphItem.id];\n        }\n      }\n    }\n  });\n\n  return positions;\n};\n\ninterface VerticalNavigationProps {\n  activeGraphItemId: string;\n  activeGraphItem: PlottedGraphNode | PlottedGraphConnector;\n  readOnly: boolean;\n  graph: DirectedGraph<PlottedGraphNode, PlottedGraphConnector>;\n}\n\ninterface HorizontalNavigationProps {\n  activeGraphItem: VerticalNavigationProps['activeGraphItem'];\n  keyEvent: 'ArrowLeft' | 'ArrowRight';\n  positions: Record<string, [string]>;\n  graph: DirectedGraph<PlottedGraphNode, PlottedGraphConnector>;\n  readOnly?: boolean;\n}\n\nexport const arrowUpKey = ({\n  activeGraphItemId,\n  activeGraphItem,\n  readOnly,\n  graph\n}: VerticalNavigationProps) => {\n  if (readOnly) {\n    const prevNode = graph.getPrevNodes(activeGraphItemId).slice(-1)[0];\n    if (!prevNode) {\n      return GraphTraversal.findLeafNode(graph);\n    }\n    if (!prevNode.dimensions.height) {\n      const inConnectors = graph.getInConnectors(prevNode.id);\n      return inConnectors[0].fromNodeId;\n    }\n    return prevNode.id;\n  }\n\n  // Node\n  if ('dimensions' in activeGraphItem) {\n    const inConnectors = graph.getInConnectors(activeGraphItemId);\n    if (inConnectors.length > 0) {\n      return inConnectors[0].id;\n    }\n    return GraphTraversal.findLeafNode(graph);\n  }\n\n  // for Connector\n  const targetNode = graph.getNode(graph.getConnector(activeGraphItemId).fromNodeId);\n  if (targetNode.dimensions.height) {\n    return targetNode.id;\n  }\n  const parentConvergence = getParentConvergence(targetNode, graph);\n  if (parentConvergence) {\n    const connectorId = parentConvergence.convergence.connectors[0]?.[0];\n    if (typeof connectorId !== 'string') {\n      return undefined;\n    }\n\n    const connectorFromNode = graph.getNode(graph.getConnector(connectorId).fromNodeId);\n    if (connectorFromNode.type?.minConnectors || !connectorFromNode.dimensions.height) {\n      return connectorId;\n    }\n    if (connectorFromNode.dimensions.height) {\n      return graph.getConnector(connectorId).fromNodeId;\n    }\n  }\n\n  return undefined;\n};\n\nexport const arrowDownKey = ({\n  activeGraphItemId,\n  activeGraphItem,\n  readOnly,\n  graph\n}: VerticalNavigationProps) => {\n  if (readOnly) {\n    let nextNode = graph.getNextNodes(activeGraphItemId)[0];\n    if (!nextNode) {\n      return GraphTraversal.findRootNode(graph);\n    }\n    while (!nextNode.dimensions.height) {\n      [nextNode] = graph.getNextNodes(nextNode.id);\n    }\n    return nextNode.id;\n  }\n  // for Node\n  if ('dimensions' in activeGraphItem) {\n    const outConnectors = graph.getOutConnectors(activeGraphItemId);\n    if (outConnectors.length > 0) {\n      if (activeGraphItem.type?.minConnectors) {\n        return outConnectors[0].id;\n      }\n      return graph.getOutConnectors(outConnectors[0].toNodeId)[0].id;\n    }\n    return GraphTraversal.findRootNode(graph);\n  }\n  // for Connector\n  const targetNode = graph.getNode(graph.getConnector(activeGraphItemId).toNodeId);\n  if (targetNode.dimensions.height) {\n    return targetNode.id;\n  }\n  return graph.getOutConnectors(targetNode.id)[0].id;\n};\n\nexport const horizontalNavigation = ({\n  positions,\n  activeGraphItem,\n  keyEvent,\n  graph,\n  readOnly\n}: HorizontalNavigationProps) => {\n  const pointsIndex = 3;\n  const yCoordinate = 20;\n  let focusId: string | undefined;\n\n  const rankGroup =\n    'dimensions' in activeGraphItem\n      ? positions[activeGraphItem.position.y]\n      : positions[activeGraphItem.points[pointsIndex].y - yCoordinate];\n  let itemIndex = rankGroup.indexOf(activeGraphItem.id);\n\n  if (keyEvent === 'ArrowLeft') {\n    /**\n     * If current active graph item is a connector and previous connector in rank group is originating from a Go to node\n     * then iterate the rank group until we find a connector thats not originating from a go to node\n     * and is not the first connector in the rank group\n     */\n    while (itemIndex > 0 && !('dimensions' in activeGraphItem)) {\n      const previousConnector = graph.getConnector(rankGroup[itemIndex - 1]);\n      const sourceNode = graph.getNode(previousConnector.fromNodeId);\n      if (sourceNode.type?.minConnectors === 0) {\n        itemIndex -= 1;\n      } else {\n        break;\n      }\n    }\n    if (itemIndex > 0) {\n      /**\n       * If current focused graph item is a node and previous node to focus in rank group is a placeholder node\n       * then get the in-connectors of placeholder node and focus on the last focusable item(node/connector add node button)\n       * of the last in-connector\n       * If the previous node in rank group is not placeholder node then directly focus it\n       */\n      if ('dimensions' in activeGraphItem) {\n        const parallelNodeInPreviousPath = graph.getNode(rankGroup[itemIndex - 1]);\n        if (parallelNodeInPreviousPath.dimensions.height) {\n          focusId = rankGroup[itemIndex - 1];\n        } else {\n          const inConnectors = graph.getInConnectors(parallelNodeInPreviousPath.id);\n          const lastInConnectorIndex = inConnectors.length - 1;\n\n          if (readOnly) {\n            let sourceNode = graph.getNode(inConnectors[lastInConnectorIndex].fromNodeId);\n            while (!sourceNode.dimensions.height) {\n              const sourceNodeInConnectors = graph.getInConnectors(sourceNode.id);\n              if (sourceNodeInConnectors.length) {\n                sourceNode = graph.getNode(\n                  sourceNodeInConnectors[sourceNodeInConnectors.length - 1].fromNodeId\n                );\n              }\n            }\n            focusId = sourceNode.id;\n          } else {\n            const sourceNode = graph.getNode(inConnectors[lastInConnectorIndex].fromNodeId);\n            if (sourceNode.type?.minConnectors === 0) {\n              focusId = inConnectors[lastInConnectorIndex].fromNodeId;\n            } else {\n              focusId = inConnectors[lastInConnectorIndex].id;\n            }\n          }\n        }\n      } else {\n        focusId = rankGroup[itemIndex - 1];\n      }\n    } else {\n      /**\n       * If current focused item is the first item in the rank group\n       * then check if there is branch of the same convergence or any parent convergence is present to the left of the current focused item\n       * if so then focus on the first focusable in that branch/path\n       */\n      let result = getParentConvergence(activeGraphItem, graph);\n      while (result && result.pathIndex === 0) {\n        result = getParentConvergence(result.parent, graph);\n      }\n      if (result) {\n        const connectorInPreviousPath = graph.getOutConnectors(result.parent.id)[\n          result.pathIndex - 1\n        ];\n        if (readOnly) {\n          let nodeIdInPreviousPath = graph.getNode(connectorInPreviousPath.toNodeId);\n          while (!nodeIdInPreviousPath.dimensions.height) {\n            const outConnectors = graph.getOutConnectors(nodeIdInPreviousPath.id);\n            if (outConnectors.length) {\n              nodeIdInPreviousPath = graph.getNode(outConnectors[0].toNodeId);\n            }\n          }\n          focusId = nodeIdInPreviousPath.id;\n        } else {\n          focusId = connectorInPreviousPath.id;\n        }\n      }\n    }\n  }\n  if (keyEvent === 'ArrowRight') {\n    /**\n     * If current active graph item is a connector and next connector in rank group is originating from a Goto node\n     * then iterate the rank group until we find a connector thats not originating from a Goto node\n     * and is not the last connector in the rank group\n     */\n    while (itemIndex < rankGroup.length - 1 && !('dimensions' in activeGraphItem)) {\n      const nextConnector = graph.getConnector(rankGroup[itemIndex + 1]);\n      const sourceNode = graph.getNode(nextConnector.fromNodeId);\n      if (sourceNode.type?.minConnectors === 0) {\n        itemIndex += 1;\n      } else {\n        break;\n      }\n    }\n\n    if (itemIndex < rankGroup.length - 1) {\n      if ('dimensions' in activeGraphItem) {\n        /**\n         * If current focused graph item is a node and next node to focus in rank group is a placeholder node\n         * then get the in-connectors of placeholder node and focus on the last focusable item(node/connector add node button)\n         * of the first in-connector\n         * If the next node in rank group is not placeholder node then directly focus it\n         */\n        const parallelNodeInNextPath = graph.getNode(rankGroup[itemIndex + 1]);\n        if (parallelNodeInNextPath.dimensions.height) {\n          focusId = rankGroup[itemIndex + 1];\n        } else {\n          const inConnectors = graph.getInConnectors(parallelNodeInNextPath.id);\n\n          if (readOnly) {\n            let sourceNode = graph.getNode(inConnectors[0].fromNodeId);\n            while (!sourceNode.dimensions.height) {\n              const sourceNodeInConnectors = graph.getInConnectors(sourceNode.id);\n              if (sourceNodeInConnectors.length) {\n                sourceNode = graph.getNode(sourceNodeInConnectors[0].fromNodeId);\n              }\n            }\n            focusId = sourceNode.id;\n          } else {\n            const sourceNode = graph.getNode(inConnectors[0].fromNodeId);\n            if (sourceNode.type?.minConnectors === 0) {\n              focusId = inConnectors[0].fromNodeId;\n            } else {\n              focusId = inConnectors[0].id;\n            }\n          }\n        }\n      } else {\n        focusId = rankGroup[itemIndex + 1];\n      }\n    } else {\n      /**\n       * If current focused item is the last item in the rank group\n       * then check if there is branch of the same convergence or any parent convergence is present to the right of the current focused item\n       * if so then focus on the first focusable in that branch/path\n       */\n      let result = getParentConvergence(activeGraphItem, graph);\n      while (\n        result &&\n        result.convergence.paths &&\n        result.pathIndex === result.convergence.paths.length - 1\n      ) {\n        result = getParentConvergence(result.parent, graph);\n      }\n      if (result) {\n        const connectorInNextPath = graph.getOutConnectors(result.parent.id)[result.pathIndex + 1];\n        if (readOnly) {\n          let nodeIdInNextPath = graph.getNode(connectorInNextPath.toNodeId);\n          while (!nodeIdInNextPath.dimensions.height) {\n            nodeIdInNextPath = graph.getNode(\n              graph.getOutConnectors(nodeIdInNextPath.id)[0].toNodeId\n            );\n          }\n          focusId = nodeIdInNextPath.id;\n        } else {\n          focusId = connectorInNextPath.id;\n        }\n      }\n    }\n  }\n  return focusId;\n};\n"]}

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

@@ -0,0 +1,18 @@
+import type { AddNodeHandlerParams } from '../Renderer/Renderer.types';
+import type { ConnectorProps, GraphData, Node } from '../Renderer/Utils/Graph';
+import { DirectedGraph } 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<unknown>, PlottedGraphConnector<unknown>>;
+};
+export default PlaceHolderHelper;
+//# sourceMappingURL=addNodeUtils.d.ts.map

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

@@ -0,0 +1 @@
+{"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,KAAK,EAAE,cAAc,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,yBAAyB,CAAC;AAC/E,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,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,GAAI,MAAM,eAAe,GAAG,IAAI,KAAG,IAAI,IAAI,eAExE,CAAC;AAGF,eAAO,MAAM,sBAAsB,GACjC,WAAW,oBAAoB,GAAG,cAAc,KAC/C,SAAS,IAAI,oBAEf,CAAC;AA+BF,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;wCAsEf,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

@@ -0,0 +1,148 @@
+import { DirectedGraph } from '../Renderer/Utils/Graph';
+import GraphTraversal from '../Renderer/Utils/GraphTraversal';
+// type-guard PlaceHolderNode
+export const isPlaceHolderNode = (node) => {
+    return 'realConnectors' in node && node.realConnectors !== undefined;
+};
+// type-guard PlaceHolderConnector
+export const isPlaceHolderConnector = (connector) => {
+    return 'realConnectors' in connector && connector.realConnectors !== undefined;
+};
+// Extracts the first string from a NestedArray item.
+const getFirstString = (item) => {
+    let current = item;
+    while (typeof current !== 'string') {
+        [current] = current;
+    }
+    return current;
+};
+const countInvisibleConnectors = (graph, connectors) => {
+    let invisibleConnectorsCount = 0;
+    for (let i = 0; i < connectors.length; i += 1) {
+        const connector = connectors[i];
+        if (Array.isArray(connector)) {
+            invisibleConnectorsCount += countInvisibleConnectors(graph, connector);
+        }
+        else {
+            const connectorData = graph.getConnector(connector);
+            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 => {
+                                const conId = getFirstString(itrConId);
+                                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(getFirstString(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

@@ -0,0 +1 @@
+{"version":3,"file":"addNodeUtils.js","sourceRoot":"","sources":["../../../../src/components/FlowModeller/Utils/addNodeUtils.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AAExD,OAAO,cAAc,MAAM,kCAAkC,CAAC;AAU9D,6BAA6B;AAC7B,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,IAA4B,EAA2B,EAAE;IACzF,OAAO,gBAAgB,IAAI,IAAI,IAAI,IAAI,CAAC,cAAc,KAAK,SAAS,CAAC;AACvE,CAAC,CAAC;AAEF,kCAAkC;AAClC,MAAM,CAAC,MAAM,sBAAsB,GAAG,CACpC,SAAgD,EACb,EAAE;IACrC,OAAO,gBAAgB,IAAI,SAAS,IAAI,SAAS,CAAC,cAAc,KAAK,SAAS,CAAC;AACjF,CAAC,CAAC;AAEF,qDAAqD;AACrD,MAAM,cAAc,GAAG,CAAC,IAAkC,EAAU,EAAE;IACpE,IAAI,OAAO,GAAiC,IAAI,CAAC;IACjD,OAAO,OAAO,OAAO,KAAK,QAAQ,EAAE,CAAC;QACnC,CAAC,OAAO,CAAC,GAAG,OAAO,CAAC;IACtB,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,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,MAAM,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QAChC,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;YAC7B,wBAAwB,IAAI,wBAAwB,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QACzE,CAAC;aAAM,CAAC;YACN,MAAM,aAAa,GAAG,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;YACpD,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,MAAM,KAAK,GAAG,cAAc,CAAC,QAAQ,CAAC,CAAC;gCAEvC,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,cAAc,CAAC,IAAI,CAAC,EAAE;oCACvC,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 type { ConnectorProps, GraphData, Node } from '../Renderer/Utils/Graph';\nimport { DirectedGraph } 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 'realConnectors' in node && node.realConnectors !== undefined;\n};\n\n// type-guard PlaceHolderConnector\nexport const isPlaceHolderConnector = (\n  connector: PlaceHolderConnector | ConnectorProps\n): connector is PlaceHolderConnector => {\n  return 'realConnectors' in connector && connector.realConnectors !== undefined;\n};\n\n// Extracts the first string from a NestedArray item.\nconst getFirstString = (item: string | NestedArray<string>): string => {\n  let current: string | NestedArray<string> = item;\n  while (typeof current !== 'string') {\n    [current] = current;\n  }\n  return current;\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    const connector = connectors[i];\n    if (Array.isArray(connector)) {\n      invisibleConnectorsCount += countInvisibleConnectors(graph, connector);\n    } else {\n      const connectorData = graph.getConnector(connector);\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                const conId = getFirstString(itrConId);\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(getFirstString(item), {\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"]}