@strapi/content-type-builder 5.54.0 → 5.55.1

package/dist/admin/components/ContentTypeBuilderNav/lib/dropProjection.js

@@ -0,0 +1,277 @@
+'use strict';
+
+var sortable = require('@dnd-kit/sortable');
+var contentStructure = require('../../DataManager/utils/contentStructure.js');
+var buildFolderTree = require('./buildFolderTree.js');
+
+const INDENT_WIDTH = 24; // theme.spaces[6]
+const clamp = (value, min, max)=>{
+    return Math.min(Math.max(value, min), max);
+};
+/**
+ * Locates the position for the line indicator given that root-level re-ordering is currently
+ * not possible. This is temporary measure until root-level re-ordering is implemented.
+ */ function getDropTargetSectionRoot(items, activeId) {
+    const rootItems = items.filter((item)=>item.depth === 0 && item.id !== activeId);
+    const lastRootLeaf = [
+        ...rootItems
+    ].reverse().find((item)=>item.node.type === 'contentType');
+    const firstRootFolder = rootItems.find((item)=>item.node.type === 'folder');
+    const line = (()=>{
+        if (firstRootFolder) {
+            return {
+                anchorId: firstRootFolder.id,
+                edge: 'top'
+            };
+        }
+        if (lastRootLeaf) {
+            return {
+                anchorId: lastRootLeaf.id,
+                edge: 'bottom'
+            };
+        }
+        return null;
+    })();
+    return {
+        parentId: null,
+        index: 0,
+        depth: 0,
+        line
+    };
+}
+function getDropTargetBetweenRows(items, activeId, overId, offsetX, side) {
+    const activeIndex = items.findIndex((item)=>item.id === activeId);
+    const overIndex = items.findIndex((item)=>item.id === overId);
+    if (overIndex === -1 || activeIndex === -1) {
+        return null;
+    }
+    const active = items[activeIndex];
+    const { rowsBeforeSlot, previous, next } = (()=>{
+        if (side) {
+            const withoutActive = items.filter((item)=>item.id !== activeId);
+            const overPos = withoutActive.findIndex((item)=>item.id === overId);
+            const insertPos = side === 'before' ? overPos : overPos + 1;
+            return {
+                rowsBeforeSlot: withoutActive.slice(0, insertPos),
+                previous: withoutActive[insertPos - 1],
+                next: withoutActive[insertPos]
+            };
+        }
+        const reordered = sortable.arrayMove(items, activeIndex, overIndex);
+        return {
+            rowsBeforeSlot: reordered.slice(0, overIndex),
+            previous: reordered[overIndex - 1],
+            next: reordered[overIndex + 1]
+        };
+    })();
+    const dragDepth = Math.round(offsetX / INDENT_WIDTH);
+    const projectedDepth = active.depth + dragDepth;
+    const minDepth = next ? next.depth : 0;
+    let maxDepth;
+    if (!previous) {
+        maxDepth = 0;
+    } else if (previous.node.type === 'folder' && !previous.collapsed) {
+        maxDepth = previous.depth + 1;
+    } else {
+        maxDepth = previous.depth;
+    }
+    if (active.node.type === 'folder') {
+        const folderCeiling = contentStructure.MAX_FOLDER_DEPTH - buildFolderTree.subtreeFolderHeight(active.node);
+        maxDepth = Math.min(maxDepth, folderCeiling);
+    }
+    if (maxDepth < minDepth) {
+        return null;
+    }
+    const depth = clamp(projectedDepth, minDepth, maxDepth);
+    const parentId = (()=>{
+        if (depth === 0 || !previous) {
+            return null;
+        }
+        if (depth === previous.depth) {
+            return previous.parentId;
+        }
+        if (depth > previous.depth) {
+            return previous.node.type === 'folder' ? previous.node.id : previous.parentId;
+        }
+        const ancestor = [
+            ...rowsBeforeSlot
+        ].reverse().find((item)=>item.depth === depth);
+        return ancestor ? ancestor.parentId : null;
+    })();
+    let index = 0;
+    for (const item of rowsBeforeSlot){
+        if (item.parentId !== parentId || item.depth !== depth) {
+            continue;
+        }
+        if (parentId === null && item.node.type !== 'folder') {
+            continue;
+        }
+        index += 1;
+    }
+    const line = (()=>{
+        if (next) {
+            return {
+                anchorId: next.id,
+                edge: 'top'
+            };
+        }
+        if (previous) {
+            return {
+                anchorId: previous.id,
+                edge: 'bottom'
+            };
+        }
+        return null;
+    })();
+    /** For the time being, root content types have no stored order, so trying to move something there is not a real re-order operation. */ const insertingAmongRootContentTypes = parentId === null && next !== undefined && next.node.type === 'contentType' && next.parentId === null;
+    if (insertingAmongRootContentTypes) {
+        return getDropTargetSectionRoot(items, activeId);
+    }
+    return {
+        parentId,
+        index,
+        depth,
+        line
+    };
+}
+function getDropTargetFolderSibling(items, activeId, folderId, side) {
+    const folderIndex = items.findIndex((item)=>item.id === folderId);
+    const active = items.find((item)=>item.id === activeId);
+    if (folderIndex === -1 || !active) {
+        return null;
+    }
+    const folder = items[folderIndex];
+    const { parentId, depth } = folder;
+    if (active.node.type === 'folder' && depth + buildFolderTree.subtreeFolderHeight(active.node) > contentStructure.MAX_FOLDER_DEPTH) {
+        return null;
+    }
+    const boundary = side === 'before' ? folderIndex : folderIndex + 1;
+    let index = 0;
+    for(let i = 0; i < boundary; i += 1){
+        const item = items[i];
+        if (item.id === activeId) {
+            continue;
+        }
+        if (item.parentId !== parentId || item.depth !== depth) {
+            continue;
+        }
+        if (parentId === null && item.node.type !== 'folder') {
+            continue;
+        }
+        index += 1;
+    }
+    const line = (()=>{
+        if (side === 'before') {
+            return {
+                anchorId: folder.id,
+                edge: 'top'
+            };
+        }
+        let lastIndex = folderIndex;
+        for(let i = folderIndex + 1; i < items.length; i += 1){
+            if (items[i].depth <= depth) {
+                break;
+            }
+            lastIndex = i;
+        }
+        return {
+            anchorId: items[lastIndex].id,
+            edge: 'bottom'
+        };
+    })();
+    return {
+        parentId,
+        index,
+        depth,
+        line
+    };
+}
+/**
+ * This resolved the destination for a drag-and-drop operation in the contentStructure tree. It takes into account the active item being dragged, the item it is being dropped over, the horizontal offset of the drag, and optionally which side of the target item the drop is intended for.
+ * It returns a DropTarget object that describes where the active item should be placed in relation to its siblings and parent in the tree structure.
+ *
+ * When the dragged row is over a non-folder row, the drop target is always a sibling of that row (and its destination is based on which half of the row the pointer is over).
+ *
+ * When the dragged row is over a folder row, the drop target can be either a sibling of that folder (if the pointer is over the top or bottom third of the row) or a child of that folder (if the pointer is over the middle third of the row).
+ * If the folder is collapsed, dropping into it will expand it and place the active row inside it.
+ *
+ * If the destination is nested such that the destination could be one of several depths, the depth is determined by the horizontal offset of the pointer.
+ *
+ * This allows for a user to position a row at the end of a folder, even if there are several expanded folders above the destination. Otherwise, this would be a multi-step operation.
+ *
+ */ function resolveDropTarget(items, dragState) {
+    const { activeId, overId, offsetX, pointer, overRect } = dragState;
+    if (overId === activeId) {
+        return null;
+    }
+    const itemHoveredByCursor = items.find((item)=>item.id === overId);
+    // If item is valid FoldeRNode
+    if (itemHoveredByCursor && itemHoveredByCursor.node.type === 'folder' && pointer && overRect) {
+        const folderNode = itemHoveredByCursor.node;
+        const nextItem = items[items.indexOf(itemHoveredByCursor) + 1];
+        const hasVisibleChildren = nextItem != null && nextItem.depth > itemHoveredByCursor.depth;
+        // Determine which zone of the folder row the pointer is in (top, middle, bottom).
+        const zone = calculateFolderDropZone({
+            itemBoundingBox: overRect,
+            pointerY: pointer.y,
+            hasVisibleChildren
+        });
+        if (zone === 'nest') {
+            const activeNode = items.find(({ id })=>id === activeId)?.node;
+            const nestIsValid = activeNode == null || activeNode.type !== 'folder' || buildFolderTree.canNestFolderAt(activeNode, folderNode);
+            if (!nestIsValid) {
+                return null;
+            }
+            return {
+                kind: 'nest',
+                folderId: folderNode.id,
+                depth: itemHoveredByCursor.depth + 1
+            };
+        }
+        const sibling = getDropTargetFolderSibling(items, activeId, overId, zone);
+        if (sibling) {
+            return {
+                kind: 'insert',
+                ...sibling
+            };
+        }
+    }
+    const side = (()=>{
+        if (!pointer || !overRect) {
+            return undefined;
+        }
+        return pointer.y < overRect.top + overRect.height / 2 ? 'before' : 'after';
+    })();
+    const insert = getDropTargetBetweenRows(items, activeId, overId, offsetX, side);
+    return insert ? {
+        kind: 'insert',
+        ...insert
+    } : null;
+}
+/**
+ * Configuration for the folder drop zones.
+ *
+ * There are three zones and several possible behaviors:
+ *  1. The top zone of the folder row ("beore"). This drops the the dragged row above the folder row.
+ *  2. The bottom zone of the folder row ("after"). This drops the dragged row below the folder row.
+ *  If the folder is expanded:
+ *    3. The middle zone of the folder row ("nest"). This drops the dragged row inside the folder row.
+ *  If the folder is collapsed:
+ *   3A. The middle zone of the folder row ("nest"). This drops the dragged row inside the folder row.
+ *   3B. If the folder is held over the middle zone for a certain amount of time, the folder will expand and the dragged row can be dropped inside the folder row.
+ */ const NEST_ZONE_BOTTOM = 0.8;
+const NEST_ZONE_TOP = 0.2;
+function calculateFolderDropZone({ hasVisibleChildren, itemBoundingBox, pointerY }) {
+    if (pointerY < itemBoundingBox.top + itemBoundingBox.height * NEST_ZONE_TOP) {
+        return 'before';
+    }
+    if (!hasVisibleChildren && pointerY > itemBoundingBox.top + itemBoundingBox.height * NEST_ZONE_BOTTOM) {
+        return 'after';
+    }
+    return 'nest';
+}
+
+exports.INDENT_WIDTH = INDENT_WIDTH;
+exports.calculateFolderDropZone = calculateFolderDropZone;
+exports.resolveDropTarget = resolveDropTarget;
+//# sourceMappingURL=dropProjection.js.map

package/dist/admin/components/ContentTypeBuilderNav/lib/dropProjection.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dropProjection.js","sources":["../../../../../admin/src/components/ContentTypeBuilderNav/lib/dropProjection.ts"],"sourcesContent":["import { arrayMove } from '@dnd-kit/sortable';\n\nimport { MAX_FOLDER_DEPTH } from '../../DataManager/utils/contentStructure';\n\nimport { canNestFolderAt, subtreeFolderHeight } from './buildFolderTree';\n\nimport type { FlatItem } from './flatModel';\n\nexport const INDENT_WIDTH = 24; // theme.spaces[6]\n\n/**\n * Temporary flag to disable root content-type reordering.\n */\nconst ROOT_CONTENT_TYPE_REORDER = false;\n\nconst clamp = (value: number, min: number, max: number) => {\n  return Math.min(Math.max(value, min), max);\n};\n\nexport type DropLine = {\n  edge: 'top' | 'bottom';\n  anchorId: string;\n};\n\nexport type InsertTarget = {\n  parentId: string | null;\n  line: DropLine | null;\n  index: number;\n  depth: number;\n};\n\nexport type DropTarget =\n  | { kind: 'nest'; folderId: string; depth: number }\n  | ({ kind: 'insert' } & InsertTarget);\n\n/**\n * Locates the position for the line indicator given that root-level re-ordering is currently\n * not possible. This is temporary measure until root-level re-ordering is implemented.\n */\nfunction getDropTargetSectionRoot(items: FlatItem[], activeId: string): InsertTarget {\n  const rootItems = items.filter((item) => item.depth === 0 && item.id !== activeId);\n\n  const lastRootLeaf = [...rootItems].reverse().find((item) => item.node.type === 'contentType');\n  const firstRootFolder = rootItems.find((item) => item.node.type === 'folder');\n\n  const line: DropLine | null = (() => {\n    if (firstRootFolder) {\n      return { anchorId: firstRootFolder.id, edge: 'top' };\n    }\n\n    if (lastRootLeaf) {\n      return { anchorId: lastRootLeaf.id, edge: 'bottom' };\n    }\n\n    return null;\n  })();\n\n  return { parentId: null, index: 0, depth: 0, line };\n}\n\nfunction getDropTargetBetweenRows(\n  items: FlatItem[],\n  activeId: string,\n  overId: string,\n  offsetX: number,\n  side?: 'before' | 'after'\n): InsertTarget | null {\n  const activeIndex = items.findIndex((item) => item.id === activeId);\n  const overIndex = items.findIndex((item) => item.id === overId);\n\n  if (overIndex === -1 || activeIndex === -1) {\n    return null;\n  }\n\n  const active = items[activeIndex];\n\n  const { rowsBeforeSlot, previous, next } = (() => {\n    if (side) {\n      const withoutActive = items.filter((item) => item.id !== activeId);\n      const overPos = withoutActive.findIndex((item) => item.id === overId);\n      const insertPos = side === 'before' ? overPos : overPos + 1;\n\n      return {\n        rowsBeforeSlot: withoutActive.slice(0, insertPos),\n        previous: withoutActive[insertPos - 1],\n        next: withoutActive[insertPos],\n      };\n    }\n\n    const reordered = arrayMove(items, activeIndex, overIndex);\n\n    return {\n      rowsBeforeSlot: reordered.slice(0, overIndex),\n      previous: reordered[overIndex - 1],\n      next: reordered[overIndex + 1],\n    };\n  })();\n\n  const dragDepth = Math.round(offsetX / INDENT_WIDTH);\n  const projectedDepth = active.depth + dragDepth;\n\n  const minDepth = next ? next.depth : 0;\n\n  let maxDepth: number;\n  if (!previous) {\n    maxDepth = 0;\n  } else if (previous.node.type === 'folder' && !previous.collapsed) {\n    maxDepth = previous.depth + 1;\n  } else {\n    maxDepth = previous.depth;\n  }\n\n  if (active.node.type === 'folder') {\n    const folderCeiling = MAX_FOLDER_DEPTH - subtreeFolderHeight(active.node);\n    maxDepth = Math.min(maxDepth, folderCeiling);\n  }\n\n  if (maxDepth < minDepth) {\n    return null;\n  }\n  const depth = clamp(projectedDepth, minDepth, maxDepth);\n\n  const parentId = ((): string | null => {\n    if (depth === 0 || !previous) {\n      return null;\n    }\n\n    if (depth === previous.depth) {\n      return previous.parentId;\n    }\n\n    if (depth > previous.depth) {\n      return previous.node.type === 'folder' ? previous.node.id : previous.parentId;\n    }\n\n    const ancestor = [...rowsBeforeSlot].reverse().find((item) => item.depth === depth);\n\n    return ancestor ? ancestor.parentId : null;\n  })();\n\n  let index = 0;\n\n  for (const item of rowsBeforeSlot) {\n    if (item.parentId !== parentId || item.depth !== depth) {\n      continue;\n    }\n\n    if (parentId === null && item.node.type !== 'folder') {\n      continue;\n    }\n\n    index += 1;\n  }\n\n  const line: DropLine | null = (() => {\n    if (next) {\n      return { anchorId: next.id, edge: 'top' };\n    }\n\n    if (previous) {\n      return { anchorId: previous.id, edge: 'bottom' };\n    }\n\n    return null;\n  })();\n\n  /** For the time being, root content types have no stored order, so trying to move something there is not a real re-order operation. */\n  const insertingAmongRootContentTypes =\n    parentId === null &&\n    next !== undefined &&\n    next.node.type === 'contentType' &&\n    next.parentId === null;\n\n  if (!ROOT_CONTENT_TYPE_REORDER && insertingAmongRootContentTypes) {\n    return getDropTargetSectionRoot(items, activeId);\n  }\n\n  return { parentId, index, depth, line };\n}\n\nfunction getDropTargetFolderSibling(\n  items: FlatItem[],\n  activeId: string,\n  folderId: string,\n  side: 'before' | 'after'\n): InsertTarget | null {\n  const folderIndex = items.findIndex((item) => item.id === folderId);\n  const active = items.find((item) => item.id === activeId);\n\n  if (folderIndex === -1 || !active) {\n    return null;\n  }\n\n  const folder = items[folderIndex];\n  const { parentId, depth } = folder;\n\n  if (\n    active.node.type === 'folder' &&\n    depth + subtreeFolderHeight(active.node) > MAX_FOLDER_DEPTH\n  ) {\n    return null;\n  }\n\n  const boundary = side === 'before' ? folderIndex : folderIndex + 1;\n  let index = 0;\n\n  for (let i = 0; i < boundary; i += 1) {\n    const item = items[i];\n\n    if (item.id === activeId) {\n      continue;\n    }\n\n    if (item.parentId !== parentId || item.depth !== depth) {\n      continue;\n    }\n\n    if (parentId === null && item.node.type !== 'folder') {\n      continue;\n    }\n\n    index += 1;\n  }\n\n  const line: DropLine = (() => {\n    if (side === 'before') {\n      return { anchorId: folder.id, edge: 'top' };\n    }\n\n    let lastIndex = folderIndex;\n\n    for (let i = folderIndex + 1; i < items.length; i += 1) {\n      if (items[i].depth <= depth) {\n        break;\n      }\n\n      lastIndex = i;\n    }\n\n    return { anchorId: items[lastIndex].id, edge: 'bottom' };\n  })();\n\n  return { parentId, index, depth, line };\n}\n\ntype DragState = {\n  activeId: string;\n  overId: string;\n  offsetX: number;\n  pointer?: { x: number; y: number };\n  overRect?: { top: number; height: number };\n};\n\n/**\n * This resolved the destination for a drag-and-drop operation in the contentStructure tree. It takes into account the active item being dragged, the item it is being dropped over, the horizontal offset of the drag, and optionally which side of the target item the drop is intended for.\n * It returns a DropTarget object that describes where the active item should be placed in relation to its siblings and parent in the tree structure.\n *\n * When the dragged row is over a non-folder row, the drop target is always a sibling of that row (and its destination is based on which half of the row the pointer is over).\n *\n * When the dragged row is over a folder row, the drop target can be either a sibling of that folder (if the pointer is over the top or bottom third of the row) or a child of that folder (if the pointer is over the middle third of the row).\n * If the folder is collapsed, dropping into it will expand it and place the active row inside it.\n *\n * If the destination is nested such that the destination could be one of several depths, the depth is determined by the horizontal offset of the pointer.\n *\n * This allows for a user to position a row at the end of a folder, even if there are several expanded folders above the destination. Otherwise, this would be a multi-step operation.\n *\n */\nexport function resolveDropTarget(items: FlatItem[], dragState: DragState): DropTarget | null {\n  const { activeId, overId, offsetX, pointer, overRect } = dragState;\n\n  if (overId === activeId) {\n    return null;\n  }\n\n  const itemHoveredByCursor = items.find((item) => item.id === overId);\n\n  // If item is valid FoldeRNode\n  if (itemHoveredByCursor && itemHoveredByCursor.node.type === 'folder' && pointer && overRect) {\n    const folderNode = itemHoveredByCursor.node;\n\n    const nextItem = items[items.indexOf(itemHoveredByCursor) + 1];\n    const hasVisibleChildren = nextItem != null && nextItem.depth > itemHoveredByCursor.depth;\n\n    // Determine which zone of the folder row the pointer is in (top, middle, bottom).\n    const zone = calculateFolderDropZone({\n      itemBoundingBox: overRect,\n      pointerY: pointer.y,\n      hasVisibleChildren,\n    });\n\n    if (zone === 'nest') {\n      const activeNode = items.find(({ id }) => id === activeId)?.node;\n      const nestIsValid =\n        activeNode == null ||\n        activeNode.type !== 'folder' ||\n        canNestFolderAt(activeNode, folderNode);\n\n      if (!nestIsValid) {\n        return null;\n      }\n\n      return { kind: 'nest', folderId: folderNode.id, depth: itemHoveredByCursor.depth + 1 };\n    }\n\n    const sibling = getDropTargetFolderSibling(items, activeId, overId, zone);\n    if (sibling) {\n      return { kind: 'insert', ...sibling };\n    }\n  }\n\n  const side = (() => {\n    if (!pointer || !overRect) {\n      return undefined;\n    }\n\n    return pointer.y < overRect.top + overRect.height / 2 ? 'before' : 'after';\n  })();\n\n  const insert = getDropTargetBetweenRows(items, activeId, overId, offsetX, side);\n\n  return insert ? { kind: 'insert', ...insert } : null;\n}\n\nexport type FolderDropZone = 'before' | 'nest' | 'after';\n\n/**\n * Configuration for the folder drop zones.\n *\n * There are three zones and several possible behaviors:\n *  1. The top zone of the folder row (\"beore\"). This drops the the dragged row above the folder row.\n *  2. The bottom zone of the folder row (\"after\"). This drops the dragged row below the folder row.\n *  If the folder is expanded:\n *    3. The middle zone of the folder row (\"nest\"). This drops the dragged row inside the folder row.\n *  If the folder is collapsed:\n *   3A. The middle zone of the folder row (\"nest\"). This drops the dragged row inside the folder row.\n *   3B. If the folder is held over the middle zone for a certain amount of time, the folder will expand and the dragged row can be dropped inside the folder row.\n */\n\nconst NEST_ZONE_BOTTOM = 0.8;\nconst NEST_ZONE_TOP = 0.2;\n\ntype CalculateFolderDropZoneProps = {\n  itemBoundingBox: { top: number; height: number };\n  hasVisibleChildren: boolean;\n  pointerY: number;\n};\n\nexport function calculateFolderDropZone({\n  hasVisibleChildren,\n  itemBoundingBox,\n  pointerY,\n}: CalculateFolderDropZoneProps): FolderDropZone {\n  if (pointerY < itemBoundingBox.top + itemBoundingBox.height * NEST_ZONE_TOP) {\n    return 'before';\n  }\n\n  if (\n    !hasVisibleChildren &&\n    pointerY > itemBoundingBox.top + itemBoundingBox.height * NEST_ZONE_BOTTOM\n  ) {\n    return 'after';\n  }\n\n  return 'nest';\n}\n"],"names":["INDENT_WIDTH","clamp","value","min","max","Math","getDropTargetSectionRoot","items","activeId","rootItems","filter","item","depth","id","lastRootLeaf","reverse","find","node","type","firstRootFolder","line","anchorId","edge","parentId","index","getDropTargetBetweenRows","overId","offsetX","side","activeIndex","findIndex","overIndex","active","rowsBeforeSlot","previous","next","withoutActive","overPos","insertPos","slice","reordered","arrayMove","dragDepth","round","projectedDepth","minDepth","maxDepth","collapsed","folderCeiling","MAX_FOLDER_DEPTH","subtreeFolderHeight","ancestor","insertingAmongRootContentTypes","undefined","getDropTargetFolderSibling","folderId","folderIndex","folder","boundary","i","lastIndex","length","resolveDropTarget","dragState","pointer","overRect","itemHoveredByCursor","folderNode","nextItem","indexOf","hasVisibleChildren","zone","calculateFolderDropZone","itemBoundingBox","pointerY","y","activeNode","nestIsValid","canNestFolderAt","kind","sibling","top","height","insert","NEST_ZONE_BOTTOM","NEST_ZONE_TOP"],"mappings":";;;;;;AAQO,MAAMA,YAAAA,GAAe,GAAG;AAO/B,MAAMC,KAAAA,GAAQ,CAACC,KAAAA,EAAeC,GAAAA,EAAaC,GAAAA,GAAAA;AACzC,IAAA,OAAOC,KAAKF,GAAG,CAACE,KAAKD,GAAG,CAACF,OAAOC,GAAAA,CAAAA,EAAMC,GAAAA,CAAAA;AACxC,CAAA;AAkBA;;;AAGC,IACD,SAASE,wBAAAA,CAAyBC,KAAiB,EAAEC,QAAgB,EAAA;AACnE,IAAA,MAAMC,SAAAA,GAAYF,KAAAA,CAAMG,MAAM,CAAC,CAACC,IAAAA,GAASA,IAAAA,CAAKC,KAAK,KAAK,CAAA,IAAKD,IAAAA,CAAKE,EAAE,KAAKL,QAAAA,CAAAA;AAEzE,IAAA,MAAMM,YAAAA,GAAe;AAAIL,QAAAA,GAAAA;KAAU,CAACM,OAAO,EAAA,CAAGC,IAAI,CAAC,CAACL,OAASA,IAAAA,CAAKM,IAAI,CAACC,IAAI,KAAK,aAAA,CAAA;IAChF,MAAMC,eAAAA,GAAkBV,SAAAA,CAAUO,IAAI,CAAC,CAACL,OAASA,IAAAA,CAAKM,IAAI,CAACC,IAAI,KAAK,QAAA,CAAA;IAEpE,MAAME,IAAAA,GAAwB,CAAC,IAAA;AAC7B,QAAA,IAAID,eAAAA,EAAiB;YACnB,OAAO;AAAEE,gBAAAA,QAAAA,EAAUF,gBAAgBN,EAAE;gBAAES,IAAAA,EAAM;AAAM,aAAA;AACrD,QAAA;AAEA,QAAA,IAAIR,YAAAA,EAAc;YAChB,OAAO;AAAEO,gBAAAA,QAAAA,EAAUP,aAAaD,EAAE;gBAAES,IAAAA,EAAM;AAAS,aAAA;AACrD,QAAA;QAEA,OAAO,IAAA;IACT,CAAA,GAAA;IAEA,OAAO;QAAEC,QAAAA,EAAU,IAAA;QAAMC,KAAAA,EAAO,CAAA;QAAGZ,KAAAA,EAAO,CAAA;AAAGQ,QAAAA;AAAK,KAAA;AACpD;AAEA,SAASK,wBAAAA,CACPlB,KAAiB,EACjBC,QAAgB,EAChBkB,MAAc,EACdC,OAAe,EACfC,IAAyB,EAAA;IAEzB,MAAMC,WAAAA,GAActB,MAAMuB,SAAS,CAAC,CAACnB,IAAAA,GAASA,IAAAA,CAAKE,EAAE,KAAKL,QAAAA,CAAAA;IAC1D,MAAMuB,SAAAA,GAAYxB,MAAMuB,SAAS,CAAC,CAACnB,IAAAA,GAASA,IAAAA,CAAKE,EAAE,KAAKa,MAAAA,CAAAA;AAExD,IAAA,IAAIK,SAAAA,KAAc,EAAC,IAAKF,WAAAA,KAAgB,EAAC,EAAG;QAC1C,OAAO,IAAA;AACT,IAAA;IAEA,MAAMG,MAAAA,GAASzB,KAAK,CAACsB,WAAAA,CAAY;IAEjC,MAAM,EAAEI,cAAc,EAAEC,QAAQ,EAAEC,IAAI,EAAE,GAAI,CAAA,IAAA;AAC1C,QAAA,IAAIP,IAAAA,EAAM;YACR,MAAMQ,aAAAA,GAAgB7B,MAAMG,MAAM,CAAC,CAACC,IAAAA,GAASA,IAAAA,CAAKE,EAAE,KAAKL,QAAAA,CAAAA;YACzD,MAAM6B,OAAAA,GAAUD,cAAcN,SAAS,CAAC,CAACnB,IAAAA,GAASA,IAAAA,CAAKE,EAAE,KAAKa,MAAAA,CAAAA;AAC9D,YAAA,MAAMY,SAAAA,GAAYV,IAAAA,KAAS,QAAA,GAAWS,OAAAA,GAAUA,OAAAA,GAAU,CAAA;YAE1D,OAAO;gBACLJ,cAAAA,EAAgBG,aAAAA,CAAcG,KAAK,CAAC,CAAA,EAAGD,SAAAA,CAAAA;gBACvCJ,QAAAA,EAAUE,aAAa,CAACE,SAAAA,GAAY,CAAA,CAAE;gBACtCH,IAAAA,EAAMC,aAAa,CAACE,SAAAA;AACtB,aAAA;AACF,QAAA;QAEA,MAAME,SAAAA,GAAYC,kBAAAA,CAAUlC,KAAAA,EAAOsB,WAAAA,EAAaE,SAAAA,CAAAA;QAEhD,OAAO;YACLE,cAAAA,EAAgBO,SAAAA,CAAUD,KAAK,CAAC,CAAA,EAAGR,SAAAA,CAAAA;YACnCG,QAAAA,EAAUM,SAAS,CAACT,SAAAA,GAAY,CAAA,CAAE;YAClCI,IAAAA,EAAMK,SAAS,CAACT,SAAAA,GAAY,CAAA;AAC9B,SAAA;IACF,CAAA,GAAA;AAEA,IAAA,MAAMW,SAAAA,GAAYrC,IAAAA,CAAKsC,KAAK,CAAChB,OAAAA,GAAU3B,YAAAA,CAAAA;IACvC,MAAM4C,cAAAA,GAAiBZ,MAAAA,CAAOpB,KAAK,GAAG8B,SAAAA;AAEtC,IAAA,MAAMG,QAAAA,GAAWV,IAAAA,GAAOA,IAAAA,CAAKvB,KAAK,GAAG,CAAA;IAErC,IAAIkC,QAAAA;AACJ,IAAA,IAAI,CAACZ,QAAAA,EAAU;QACbY,QAAAA,GAAW,CAAA;IACb,CAAA,MAAO,IAAIZ,QAAAA,CAASjB,IAAI,CAACC,IAAI,KAAK,QAAA,IAAY,CAACgB,QAAAA,CAASa,SAAS,EAAE;QACjED,QAAAA,GAAWZ,QAAAA,CAAStB,KAAK,GAAG,CAAA;IAC9B,CAAA,MAAO;AACLkC,QAAAA,QAAAA,GAAWZ,SAAStB,KAAK;AAC3B,IAAA;AAEA,IAAA,IAAIoB,MAAAA,CAAOf,IAAI,CAACC,IAAI,KAAK,QAAA,EAAU;AACjC,QAAA,MAAM8B,aAAAA,GAAgBC,iCAAAA,GAAmBC,mCAAAA,CAAoBlB,MAAAA,CAAOf,IAAI,CAAA;QACxE6B,QAAAA,GAAWzC,IAAAA,CAAKF,GAAG,CAAC2C,QAAAA,EAAUE,aAAAA,CAAAA;AAChC,IAAA;AAEA,IAAA,IAAIF,WAAWD,QAAAA,EAAU;QACvB,OAAO,IAAA;AACT,IAAA;IACA,MAAMjC,KAAAA,GAAQX,KAAAA,CAAM2C,cAAAA,EAAgBC,QAAAA,EAAUC,QAAAA,CAAAA;IAE9C,MAAMvB,QAAAA,GAAW,CAAC,IAAA;QAChB,IAAIX,KAAAA,KAAU,CAAA,IAAK,CAACsB,QAAAA,EAAU;YAC5B,OAAO,IAAA;AACT,QAAA;QAEA,IAAItB,KAAAA,KAAUsB,QAAAA,CAAStB,KAAK,EAAE;AAC5B,YAAA,OAAOsB,SAASX,QAAQ;AAC1B,QAAA;QAEA,IAAIX,KAAAA,GAAQsB,QAAAA,CAAStB,KAAK,EAAE;AAC1B,YAAA,OAAOsB,QAAAA,CAASjB,IAAI,CAACC,IAAI,KAAK,QAAA,GAAWgB,QAAAA,CAASjB,IAAI,CAACJ,EAAE,GAAGqB,QAAAA,CAASX,QAAQ;AAC/E,QAAA;AAEA,QAAA,MAAM4B,QAAAA,GAAW;AAAIlB,YAAAA,GAAAA;SAAe,CAAClB,OAAO,GAAGC,IAAI,CAAC,CAACL,IAAAA,GAASA,IAAAA,CAAKC,KAAK,KAAKA,KAAAA,CAAAA;QAE7E,OAAOuC,QAAAA,GAAWA,QAAAA,CAAS5B,QAAQ,GAAG,IAAA;IACxC,CAAA,GAAA;AAEA,IAAA,IAAIC,KAAAA,GAAQ,CAAA;IAEZ,KAAK,MAAMb,QAAQsB,cAAAA,CAAgB;AACjC,QAAA,IAAItB,KAAKY,QAAQ,KAAKA,YAAYZ,IAAAA,CAAKC,KAAK,KAAKA,KAAAA,EAAO;AACtD,YAAA;AACF,QAAA;AAEA,QAAA,IAAIW,aAAa,IAAA,IAAQZ,IAAAA,CAAKM,IAAI,CAACC,IAAI,KAAK,QAAA,EAAU;AACpD,YAAA;AACF,QAAA;QAEAM,KAAAA,IAAS,CAAA;AACX,IAAA;IAEA,MAAMJ,IAAAA,GAAwB,CAAC,IAAA;AAC7B,QAAA,IAAIe,IAAAA,EAAM;YACR,OAAO;AAAEd,gBAAAA,QAAAA,EAAUc,KAAKtB,EAAE;gBAAES,IAAAA,EAAM;AAAM,aAAA;AAC1C,QAAA;AAEA,QAAA,IAAIY,QAAAA,EAAU;YACZ,OAAO;AAAEb,gBAAAA,QAAAA,EAAUa,SAASrB,EAAE;gBAAES,IAAAA,EAAM;AAAS,aAAA;AACjD,QAAA;QAEA,OAAO,IAAA;IACT,CAAA,GAAA;AAEA,4IACA,MAAM8B,8BAAAA,GACJ7B,QAAAA,KAAa,QACbY,IAAAA,KAASkB,SAAAA,IACTlB,IAAAA,CAAKlB,IAAI,CAACC,IAAI,KAAK,aAAA,IACnBiB,IAAAA,CAAKZ,QAAQ,KAAK,IAAA;IAEpB,IAAkC6B,8BAAAA,EAAgC;AAChE,QAAA,OAAO9C,yBAAyBC,KAAAA,EAAOC,QAAAA,CAAAA;AACzC,IAAA;IAEA,OAAO;AAAEe,QAAAA,QAAAA;AAAUC,QAAAA,KAAAA;AAAOZ,QAAAA,KAAAA;AAAOQ,QAAAA;AAAK,KAAA;AACxC;AAEA,SAASkC,2BACP/C,KAAiB,EACjBC,QAAgB,EAChB+C,QAAgB,EAChB3B,IAAwB,EAAA;IAExB,MAAM4B,WAAAA,GAAcjD,MAAMuB,SAAS,CAAC,CAACnB,IAAAA,GAASA,IAAAA,CAAKE,EAAE,KAAK0C,QAAAA,CAAAA;IAC1D,MAAMvB,MAAAA,GAASzB,MAAMS,IAAI,CAAC,CAACL,IAAAA,GAASA,IAAAA,CAAKE,EAAE,KAAKL,QAAAA,CAAAA;AAEhD,IAAA,IAAIgD,WAAAA,KAAgB,EAAC,IAAK,CAACxB,MAAAA,EAAQ;QACjC,OAAO,IAAA;AACT,IAAA;IAEA,MAAMyB,MAAAA,GAASlD,KAAK,CAACiD,WAAAA,CAAY;AACjC,IAAA,MAAM,EAAEjC,QAAQ,EAAEX,KAAK,EAAE,GAAG6C,MAAAA;IAE5B,IACEzB,MAAAA,CAAOf,IAAI,CAACC,IAAI,KAAK,QAAA,IACrBN,KAAAA,GAAQsC,mCAAAA,CAAoBlB,MAAAA,CAAOf,IAAI,CAAA,GAAIgC,iCAAAA,EAC3C;QACA,OAAO,IAAA;AACT,IAAA;AAEA,IAAA,MAAMS,QAAAA,GAAW9B,IAAAA,KAAS,QAAA,GAAW4B,WAAAA,GAAcA,WAAAA,GAAc,CAAA;AACjE,IAAA,IAAIhC,KAAAA,GAAQ,CAAA;AAEZ,IAAA,IAAK,IAAImC,CAAAA,GAAI,CAAA,EAAGA,CAAAA,GAAID,QAAAA,EAAUC,KAAK,CAAA,CAAG;QACpC,MAAMhD,IAAAA,GAAOJ,KAAK,CAACoD,CAAAA,CAAE;QAErB,IAAIhD,IAAAA,CAAKE,EAAE,KAAKL,QAAAA,EAAU;AACxB,YAAA;AACF,QAAA;AAEA,QAAA,IAAIG,KAAKY,QAAQ,KAAKA,YAAYZ,IAAAA,CAAKC,KAAK,KAAKA,KAAAA,EAAO;AACtD,YAAA;AACF,QAAA;AAEA,QAAA,IAAIW,aAAa,IAAA,IAAQZ,IAAAA,CAAKM,IAAI,CAACC,IAAI,KAAK,QAAA,EAAU;AACpD,YAAA;AACF,QAAA;QAEAM,KAAAA,IAAS,CAAA;AACX,IAAA;IAEA,MAAMJ,IAAAA,GAAiB,CAAC,IAAA;AACtB,QAAA,IAAIQ,SAAS,QAAA,EAAU;YACrB,OAAO;AAAEP,gBAAAA,QAAAA,EAAUoC,OAAO5C,EAAE;gBAAES,IAAAA,EAAM;AAAM,aAAA;AAC5C,QAAA;AAEA,QAAA,IAAIsC,SAAAA,GAAYJ,WAAAA;QAEhB,IAAK,IAAIG,IAAIH,WAAAA,GAAc,CAAA,EAAGG,IAAIpD,KAAAA,CAAMsD,MAAM,EAAEF,CAAAA,IAAK,CAAA,CAAG;AACtD,YAAA,IAAIpD,KAAK,CAACoD,CAAAA,CAAE,CAAC/C,KAAK,IAAIA,KAAAA,EAAO;AAC3B,gBAAA;AACF,YAAA;YAEAgD,SAAAA,GAAYD,CAAAA;AACd,QAAA;QAEA,OAAO;AAAEtC,YAAAA,QAAAA,EAAUd,KAAK,CAACqD,SAAAA,CAAU,CAAC/C,EAAE;YAAES,IAAAA,EAAM;AAAS,SAAA;IACzD,CAAA,GAAA;IAEA,OAAO;AAAEC,QAAAA,QAAAA;AAAUC,QAAAA,KAAAA;AAAOZ,QAAAA,KAAAA;AAAOQ,QAAAA;AAAK,KAAA;AACxC;AAUA;;;;;;;;;;;;;AAaC,IACM,SAAS0C,iBAAAA,CAAkBvD,KAAiB,EAAEwD,SAAoB,EAAA;IACvE,MAAM,EAAEvD,QAAQ,EAAEkB,MAAM,EAAEC,OAAO,EAAEqC,OAAO,EAAEC,QAAQ,EAAE,GAAGF,SAAAA;AAEzD,IAAA,IAAIrC,WAAWlB,QAAAA,EAAU;QACvB,OAAO,IAAA;AACT,IAAA;IAEA,MAAM0D,mBAAAA,GAAsB3D,MAAMS,IAAI,CAAC,CAACL,IAAAA,GAASA,IAAAA,CAAKE,EAAE,KAAKa,MAAAA,CAAAA;;IAG7D,IAAIwC,mBAAAA,IAAuBA,oBAAoBjD,IAAI,CAACC,IAAI,KAAK,QAAA,IAAY8C,WAAWC,QAAAA,EAAU;QAC5F,MAAME,UAAAA,GAAaD,oBAAoBjD,IAAI;AAE3C,QAAA,MAAMmD,WAAW7D,KAAK,CAACA,MAAM8D,OAAO,CAACH,uBAAuB,CAAA,CAAE;AAC9D,QAAA,MAAMI,qBAAqBF,QAAAA,IAAY,IAAA,IAAQA,SAASxD,KAAK,GAAGsD,oBAAoBtD,KAAK;;AAGzF,QAAA,MAAM2D,OAAOC,uBAAAA,CAAwB;YACnCC,eAAAA,EAAiBR,QAAAA;AACjBS,YAAAA,QAAAA,EAAUV,QAAQW,CAAC;AACnBL,YAAAA;AACF,SAAA,CAAA;AAEA,QAAA,IAAIC,SAAS,MAAA,EAAQ;YACnB,MAAMK,UAAAA,GAAarE,KAAAA,CAAMS,IAAI,CAAC,CAAC,EAAEH,EAAE,EAAE,GAAKA,EAAAA,KAAOL,QAAAA,CAAAA,EAAWS,IAAAA;YAC5D,MAAM4D,WAAAA,GACJD,cAAc,IAAA,IACdA,UAAAA,CAAW1D,IAAI,KAAK,QAAA,IACpB4D,gCAAgBF,UAAAA,EAAYT,UAAAA,CAAAA;AAE9B,YAAA,IAAI,CAACU,WAAAA,EAAa;gBAChB,OAAO,IAAA;AACT,YAAA;YAEA,OAAO;gBAAEE,IAAAA,EAAM,MAAA;AAAQxB,gBAAAA,QAAAA,EAAUY,WAAWtD,EAAE;gBAAED,KAAAA,EAAOsD,mBAAAA,CAAoBtD,KAAK,GAAG;AAAE,aAAA;AACvF,QAAA;AAEA,QAAA,MAAMoE,OAAAA,GAAU1B,0BAAAA,CAA2B/C,KAAAA,EAAOC,QAAAA,EAAUkB,MAAAA,EAAQ6C,IAAAA,CAAAA;AACpE,QAAA,IAAIS,OAAAA,EAAS;YACX,OAAO;gBAAED,IAAAA,EAAM,QAAA;AAAU,gBAAA,GAAGC;AAAQ,aAAA;AACtC,QAAA;AACF,IAAA;IAEA,MAAMpD,IAAAA,GAAO,CAAC,IAAA;QACZ,IAAI,CAACoC,OAAAA,IAAW,CAACC,QAAAA,EAAU;YACzB,OAAOZ,SAAAA;AACT,QAAA;QAEA,OAAOW,OAAAA,CAAQW,CAAC,GAAGV,QAAAA,CAASgB,GAAG,GAAGhB,QAAAA,CAASiB,MAAM,GAAG,CAAA,GAAI,QAAA,GAAW,OAAA;IACrE,CAAA,GAAA;AAEA,IAAA,MAAMC,MAAAA,GAAS1D,wBAAAA,CAAyBlB,KAAAA,EAAOC,QAAAA,EAAUkB,QAAQC,OAAAA,EAASC,IAAAA,CAAAA;AAE1E,IAAA,OAAOuD,MAAAA,GAAS;QAAEJ,IAAAA,EAAM,QAAA;AAAU,QAAA,GAAGI;KAAO,GAAI,IAAA;AAClD;AAIA;;;;;;;;;;;AAWC,IAED,MAAMC,gBAAAA,GAAmB,GAAA;AACzB,MAAMC,aAAAA,GAAgB,GAAA;AAQf,SAASb,wBAAwB,EACtCF,kBAAkB,EAClBG,eAAe,EACfC,QAAQ,EACqB,EAAA;AAC7B,IAAA,IAAIA,WAAWD,eAAAA,CAAgBQ,GAAG,GAAGR,eAAAA,CAAgBS,MAAM,GAAGG,aAAAA,EAAe;QAC3E,OAAO,QAAA;AACT,IAAA;IAEA,IACE,CAACf,sBACDI,QAAAA,GAAWD,eAAAA,CAAgBQ,GAAG,GAAGR,eAAAA,CAAgBS,MAAM,GAAGE,gBAAAA,EAC1D;QACA,OAAO,OAAA;AACT,IAAA;IAEA,OAAO,MAAA;AACT;;;;;;"}

package/dist/admin/components/ContentTypeBuilderNav/lib/dropProjection.mjs

@@ -0,0 +1,273 @@
+import { arrayMove } from '@dnd-kit/sortable';
+import { MAX_FOLDER_DEPTH } from '../../DataManager/utils/contentStructure.mjs';
+import { canNestFolderAt, subtreeFolderHeight } from './buildFolderTree.mjs';
+
+const INDENT_WIDTH = 24; // theme.spaces[6]
+const clamp = (value, min, max)=>{
+    return Math.min(Math.max(value, min), max);
+};
+/**
+ * Locates the position for the line indicator given that root-level re-ordering is currently
+ * not possible. This is temporary measure until root-level re-ordering is implemented.
+ */ function getDropTargetSectionRoot(items, activeId) {
+    const rootItems = items.filter((item)=>item.depth === 0 && item.id !== activeId);
+    const lastRootLeaf = [
+        ...rootItems
+    ].reverse().find((item)=>item.node.type === 'contentType');
+    const firstRootFolder = rootItems.find((item)=>item.node.type === 'folder');
+    const line = (()=>{
+        if (firstRootFolder) {
+            return {
+                anchorId: firstRootFolder.id,
+                edge: 'top'
+            };
+        }
+        if (lastRootLeaf) {
+            return {
+                anchorId: lastRootLeaf.id,
+                edge: 'bottom'
+            };
+        }
+        return null;
+    })();
+    return {
+        parentId: null,
+        index: 0,
+        depth: 0,
+        line
+    };
+}
+function getDropTargetBetweenRows(items, activeId, overId, offsetX, side) {
+    const activeIndex = items.findIndex((item)=>item.id === activeId);
+    const overIndex = items.findIndex((item)=>item.id === overId);
+    if (overIndex === -1 || activeIndex === -1) {
+        return null;
+    }
+    const active = items[activeIndex];
+    const { rowsBeforeSlot, previous, next } = (()=>{
+        if (side) {
+            const withoutActive = items.filter((item)=>item.id !== activeId);
+            const overPos = withoutActive.findIndex((item)=>item.id === overId);
+            const insertPos = side === 'before' ? overPos : overPos + 1;
+            return {
+                rowsBeforeSlot: withoutActive.slice(0, insertPos),
+                previous: withoutActive[insertPos - 1],
+                next: withoutActive[insertPos]
+            };
+        }
+        const reordered = arrayMove(items, activeIndex, overIndex);
+        return {
+            rowsBeforeSlot: reordered.slice(0, overIndex),
+            previous: reordered[overIndex - 1],
+            next: reordered[overIndex + 1]
+        };
+    })();
+    const dragDepth = Math.round(offsetX / INDENT_WIDTH);
+    const projectedDepth = active.depth + dragDepth;
+    const minDepth = next ? next.depth : 0;
+    let maxDepth;
+    if (!previous) {
+        maxDepth = 0;
+    } else if (previous.node.type === 'folder' && !previous.collapsed) {
+        maxDepth = previous.depth + 1;
+    } else {
+        maxDepth = previous.depth;
+    }
+    if (active.node.type === 'folder') {
+        const folderCeiling = MAX_FOLDER_DEPTH - subtreeFolderHeight(active.node);
+        maxDepth = Math.min(maxDepth, folderCeiling);
+    }
+    if (maxDepth < minDepth) {
+        return null;
+    }
+    const depth = clamp(projectedDepth, minDepth, maxDepth);
+    const parentId = (()=>{
+        if (depth === 0 || !previous) {
+            return null;
+        }
+        if (depth === previous.depth) {
+            return previous.parentId;
+        }
+        if (depth > previous.depth) {
+            return previous.node.type === 'folder' ? previous.node.id : previous.parentId;
+        }
+        const ancestor = [
+            ...rowsBeforeSlot
+        ].reverse().find((item)=>item.depth === depth);
+        return ancestor ? ancestor.parentId : null;
+    })();
+    let index = 0;
+    for (const item of rowsBeforeSlot){
+        if (item.parentId !== parentId || item.depth !== depth) {
+            continue;
+        }
+        if (parentId === null && item.node.type !== 'folder') {
+            continue;
+        }
+        index += 1;
+    }
+    const line = (()=>{
+        if (next) {
+            return {
+                anchorId: next.id,
+                edge: 'top'
+            };
+        }
+        if (previous) {
+            return {
+                anchorId: previous.id,
+                edge: 'bottom'
+            };
+        }
+        return null;
+    })();
+    /** For the time being, root content types have no stored order, so trying to move something there is not a real re-order operation. */ const insertingAmongRootContentTypes = parentId === null && next !== undefined && next.node.type === 'contentType' && next.parentId === null;
+    if (insertingAmongRootContentTypes) {
+        return getDropTargetSectionRoot(items, activeId);
+    }
+    return {
+        parentId,
+        index,
+        depth,
+        line
+    };
+}
+function getDropTargetFolderSibling(items, activeId, folderId, side) {
+    const folderIndex = items.findIndex((item)=>item.id === folderId);
+    const active = items.find((item)=>item.id === activeId);
+    if (folderIndex === -1 || !active) {
+        return null;
+    }
+    const folder = items[folderIndex];
+    const { parentId, depth } = folder;
+    if (active.node.type === 'folder' && depth + subtreeFolderHeight(active.node) > MAX_FOLDER_DEPTH) {
+        return null;
+    }
+    const boundary = side === 'before' ? folderIndex : folderIndex + 1;
+    let index = 0;
+    for(let i = 0; i < boundary; i += 1){
+        const item = items[i];
+        if (item.id === activeId) {
+            continue;
+        }
+        if (item.parentId !== parentId || item.depth !== depth) {
+            continue;
+        }
+        if (parentId === null && item.node.type !== 'folder') {
+            continue;
+        }
+        index += 1;
+    }
+    const line = (()=>{
+        if (side === 'before') {
+            return {
+                anchorId: folder.id,
+                edge: 'top'
+            };
+        }
+        let lastIndex = folderIndex;
+        for(let i = folderIndex + 1; i < items.length; i += 1){
+            if (items[i].depth <= depth) {
+                break;
+            }
+            lastIndex = i;
+        }
+        return {
+            anchorId: items[lastIndex].id,
+            edge: 'bottom'
+        };
+    })();
+    return {
+        parentId,
+        index,
+        depth,
+        line
+    };
+}
+/**
+ * This resolved the destination for a drag-and-drop operation in the contentStructure tree. It takes into account the active item being dragged, the item it is being dropped over, the horizontal offset of the drag, and optionally which side of the target item the drop is intended for.
+ * It returns a DropTarget object that describes where the active item should be placed in relation to its siblings and parent in the tree structure.
+ *
+ * When the dragged row is over a non-folder row, the drop target is always a sibling of that row (and its destination is based on which half of the row the pointer is over).
+ *
+ * When the dragged row is over a folder row, the drop target can be either a sibling of that folder (if the pointer is over the top or bottom third of the row) or a child of that folder (if the pointer is over the middle third of the row).
+ * If the folder is collapsed, dropping into it will expand it and place the active row inside it.
+ *
+ * If the destination is nested such that the destination could be one of several depths, the depth is determined by the horizontal offset of the pointer.
+ *
+ * This allows for a user to position a row at the end of a folder, even if there are several expanded folders above the destination. Otherwise, this would be a multi-step operation.
+ *
+ */ function resolveDropTarget(items, dragState) {
+    const { activeId, overId, offsetX, pointer, overRect } = dragState;
+    if (overId === activeId) {
+        return null;
+    }
+    const itemHoveredByCursor = items.find((item)=>item.id === overId);
+    // If item is valid FoldeRNode
+    if (itemHoveredByCursor && itemHoveredByCursor.node.type === 'folder' && pointer && overRect) {
+        const folderNode = itemHoveredByCursor.node;
+        const nextItem = items[items.indexOf(itemHoveredByCursor) + 1];
+        const hasVisibleChildren = nextItem != null && nextItem.depth > itemHoveredByCursor.depth;
+        // Determine which zone of the folder row the pointer is in (top, middle, bottom).
+        const zone = calculateFolderDropZone({
+            itemBoundingBox: overRect,
+            pointerY: pointer.y,
+            hasVisibleChildren
+        });
+        if (zone === 'nest') {
+            const activeNode = items.find(({ id })=>id === activeId)?.node;
+            const nestIsValid = activeNode == null || activeNode.type !== 'folder' || canNestFolderAt(activeNode, folderNode);
+            if (!nestIsValid) {
+                return null;
+            }
+            return {
+                kind: 'nest',
+                folderId: folderNode.id,
+                depth: itemHoveredByCursor.depth + 1
+            };
+        }
+        const sibling = getDropTargetFolderSibling(items, activeId, overId, zone);
+        if (sibling) {
+            return {
+                kind: 'insert',
+                ...sibling
+            };
+        }
+    }
+    const side = (()=>{
+        if (!pointer || !overRect) {
+            return undefined;
+        }
+        return pointer.y < overRect.top + overRect.height / 2 ? 'before' : 'after';
+    })();
+    const insert = getDropTargetBetweenRows(items, activeId, overId, offsetX, side);
+    return insert ? {
+        kind: 'insert',
+        ...insert
+    } : null;
+}
+/**
+ * Configuration for the folder drop zones.
+ *
+ * There are three zones and several possible behaviors:
+ *  1. The top zone of the folder row ("beore"). This drops the the dragged row above the folder row.
+ *  2. The bottom zone of the folder row ("after"). This drops the dragged row below the folder row.
+ *  If the folder is expanded:
+ *    3. The middle zone of the folder row ("nest"). This drops the dragged row inside the folder row.
+ *  If the folder is collapsed:
+ *   3A. The middle zone of the folder row ("nest"). This drops the dragged row inside the folder row.
+ *   3B. If the folder is held over the middle zone for a certain amount of time, the folder will expand and the dragged row can be dropped inside the folder row.
+ */ const NEST_ZONE_BOTTOM = 0.8;
+const NEST_ZONE_TOP = 0.2;
+function calculateFolderDropZone({ hasVisibleChildren, itemBoundingBox, pointerY }) {
+    if (pointerY < itemBoundingBox.top + itemBoundingBox.height * NEST_ZONE_TOP) {
+        return 'before';
+    }
+    if (!hasVisibleChildren && pointerY > itemBoundingBox.top + itemBoundingBox.height * NEST_ZONE_BOTTOM) {
+        return 'after';
+    }
+    return 'nest';
+}
+
+export { INDENT_WIDTH, calculateFolderDropZone, resolveDropTarget };
+//# sourceMappingURL=dropProjection.mjs.map

package/dist/admin/components/ContentTypeBuilderNav/lib/dropProjection.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"dropProjection.mjs","sources":["../../../../../admin/src/components/ContentTypeBuilderNav/lib/dropProjection.ts"],"sourcesContent":["import { arrayMove } from '@dnd-kit/sortable';\n\nimport { MAX_FOLDER_DEPTH } from '../../DataManager/utils/contentStructure';\n\nimport { canNestFolderAt, subtreeFolderHeight } from './buildFolderTree';\n\nimport type { FlatItem } from './flatModel';\n\nexport const INDENT_WIDTH = 24; // theme.spaces[6]\n\n/**\n * Temporary flag to disable root content-type reordering.\n */\nconst ROOT_CONTENT_TYPE_REORDER = false;\n\nconst clamp = (value: number, min: number, max: number) => {\n  return Math.min(Math.max(value, min), max);\n};\n\nexport type DropLine = {\n  edge: 'top' | 'bottom';\n  anchorId: string;\n};\n\nexport type InsertTarget = {\n  parentId: string | null;\n  line: DropLine | null;\n  index: number;\n  depth: number;\n};\n\nexport type DropTarget =\n  | { kind: 'nest'; folderId: string; depth: number }\n  | ({ kind: 'insert' } & InsertTarget);\n\n/**\n * Locates the position for the line indicator given that root-level re-ordering is currently\n * not possible. This is temporary measure until root-level re-ordering is implemented.\n */\nfunction getDropTargetSectionRoot(items: FlatItem[], activeId: string): InsertTarget {\n  const rootItems = items.filter((item) => item.depth === 0 && item.id !== activeId);\n\n  const lastRootLeaf = [...rootItems].reverse().find((item) => item.node.type === 'contentType');\n  const firstRootFolder = rootItems.find((item) => item.node.type === 'folder');\n\n  const line: DropLine | null = (() => {\n    if (firstRootFolder) {\n      return { anchorId: firstRootFolder.id, edge: 'top' };\n    }\n\n    if (lastRootLeaf) {\n      return { anchorId: lastRootLeaf.id, edge: 'bottom' };\n    }\n\n    return null;\n  })();\n\n  return { parentId: null, index: 0, depth: 0, line };\n}\n\nfunction getDropTargetBetweenRows(\n  items: FlatItem[],\n  activeId: string,\n  overId: string,\n  offsetX: number,\n  side?: 'before' | 'after'\n): InsertTarget | null {\n  const activeIndex = items.findIndex((item) => item.id === activeId);\n  const overIndex = items.findIndex((item) => item.id === overId);\n\n  if (overIndex === -1 || activeIndex === -1) {\n    return null;\n  }\n\n  const active = items[activeIndex];\n\n  const { rowsBeforeSlot, previous, next } = (() => {\n    if (side) {\n      const withoutActive = items.filter((item) => item.id !== activeId);\n      const overPos = withoutActive.findIndex((item) => item.id === overId);\n      const insertPos = side === 'before' ? overPos : overPos + 1;\n\n      return {\n        rowsBeforeSlot: withoutActive.slice(0, insertPos),\n        previous: withoutActive[insertPos - 1],\n        next: withoutActive[insertPos],\n      };\n    }\n\n    const reordered = arrayMove(items, activeIndex, overIndex);\n\n    return {\n      rowsBeforeSlot: reordered.slice(0, overIndex),\n      previous: reordered[overIndex - 1],\n      next: reordered[overIndex + 1],\n    };\n  })();\n\n  const dragDepth = Math.round(offsetX / INDENT_WIDTH);\n  const projectedDepth = active.depth + dragDepth;\n\n  const minDepth = next ? next.depth : 0;\n\n  let maxDepth: number;\n  if (!previous) {\n    maxDepth = 0;\n  } else if (previous.node.type === 'folder' && !previous.collapsed) {\n    maxDepth = previous.depth + 1;\n  } else {\n    maxDepth = previous.depth;\n  }\n\n  if (active.node.type === 'folder') {\n    const folderCeiling = MAX_FOLDER_DEPTH - subtreeFolderHeight(active.node);\n    maxDepth = Math.min(maxDepth, folderCeiling);\n  }\n\n  if (maxDepth < minDepth) {\n    return null;\n  }\n  const depth = clamp(projectedDepth, minDepth, maxDepth);\n\n  const parentId = ((): string | null => {\n    if (depth === 0 || !previous) {\n      return null;\n    }\n\n    if (depth === previous.depth) {\n      return previous.parentId;\n    }\n\n    if (depth > previous.depth) {\n      return previous.node.type === 'folder' ? previous.node.id : previous.parentId;\n    }\n\n    const ancestor = [...rowsBeforeSlot].reverse().find((item) => item.depth === depth);\n\n    return ancestor ? ancestor.parentId : null;\n  })();\n\n  let index = 0;\n\n  for (const item of rowsBeforeSlot) {\n    if (item.parentId !== parentId || item.depth !== depth) {\n      continue;\n    }\n\n    if (parentId === null && item.node.type !== 'folder') {\n      continue;\n    }\n\n    index += 1;\n  }\n\n  const line: DropLine | null = (() => {\n    if (next) {\n      return { anchorId: next.id, edge: 'top' };\n    }\n\n    if (previous) {\n      return { anchorId: previous.id, edge: 'bottom' };\n    }\n\n    return null;\n  })();\n\n  /** For the time being, root content types have no stored order, so trying to move something there is not a real re-order operation. */\n  const insertingAmongRootContentTypes =\n    parentId === null &&\n    next !== undefined &&\n    next.node.type === 'contentType' &&\n    next.parentId === null;\n\n  if (!ROOT_CONTENT_TYPE_REORDER && insertingAmongRootContentTypes) {\n    return getDropTargetSectionRoot(items, activeId);\n  }\n\n  return { parentId, index, depth, line };\n}\n\nfunction getDropTargetFolderSibling(\n  items: FlatItem[],\n  activeId: string,\n  folderId: string,\n  side: 'before' | 'after'\n): InsertTarget | null {\n  const folderIndex = items.findIndex((item) => item.id === folderId);\n  const active = items.find((item) => item.id === activeId);\n\n  if (folderIndex === -1 || !active) {\n    return null;\n  }\n\n  const folder = items[folderIndex];\n  const { parentId, depth } = folder;\n\n  if (\n    active.node.type === 'folder' &&\n    depth + subtreeFolderHeight(active.node) > MAX_FOLDER_DEPTH\n  ) {\n    return null;\n  }\n\n  const boundary = side === 'before' ? folderIndex : folderIndex + 1;\n  let index = 0;\n\n  for (let i = 0; i < boundary; i += 1) {\n    const item = items[i];\n\n    if (item.id === activeId) {\n      continue;\n    }\n\n    if (item.parentId !== parentId || item.depth !== depth) {\n      continue;\n    }\n\n    if (parentId === null && item.node.type !== 'folder') {\n      continue;\n    }\n\n    index += 1;\n  }\n\n  const line: DropLine = (() => {\n    if (side === 'before') {\n      return { anchorId: folder.id, edge: 'top' };\n    }\n\n    let lastIndex = folderIndex;\n\n    for (let i = folderIndex + 1; i < items.length; i += 1) {\n      if (items[i].depth <= depth) {\n        break;\n      }\n\n      lastIndex = i;\n    }\n\n    return { anchorId: items[lastIndex].id, edge: 'bottom' };\n  })();\n\n  return { parentId, index, depth, line };\n}\n\ntype DragState = {\n  activeId: string;\n  overId: string;\n  offsetX: number;\n  pointer?: { x: number; y: number };\n  overRect?: { top: number; height: number };\n};\n\n/**\n * This resolved the destination for a drag-and-drop operation in the contentStructure tree. It takes into account the active item being dragged, the item it is being dropped over, the horizontal offset of the drag, and optionally which side of the target item the drop is intended for.\n * It returns a DropTarget object that describes where the active item should be placed in relation to its siblings and parent in the tree structure.\n *\n * When the dragged row is over a non-folder row, the drop target is always a sibling of that row (and its destination is based on which half of the row the pointer is over).\n *\n * When the dragged row is over a folder row, the drop target can be either a sibling of that folder (if the pointer is over the top or bottom third of the row) or a child of that folder (if the pointer is over the middle third of the row).\n * If the folder is collapsed, dropping into it will expand it and place the active row inside it.\n *\n * If the destination is nested such that the destination could be one of several depths, the depth is determined by the horizontal offset of the pointer.\n *\n * This allows for a user to position a row at the end of a folder, even if there are several expanded folders above the destination. Otherwise, this would be a multi-step operation.\n *\n */\nexport function resolveDropTarget(items: FlatItem[], dragState: DragState): DropTarget | null {\n  const { activeId, overId, offsetX, pointer, overRect } = dragState;\n\n  if (overId === activeId) {\n    return null;\n  }\n\n  const itemHoveredByCursor = items.find((item) => item.id === overId);\n\n  // If item is valid FoldeRNode\n  if (itemHoveredByCursor && itemHoveredByCursor.node.type === 'folder' && pointer && overRect) {\n    const folderNode = itemHoveredByCursor.node;\n\n    const nextItem = items[items.indexOf(itemHoveredByCursor) + 1];\n    const hasVisibleChildren = nextItem != null && nextItem.depth > itemHoveredByCursor.depth;\n\n    // Determine which zone of the folder row the pointer is in (top, middle, bottom).\n    const zone = calculateFolderDropZone({\n      itemBoundingBox: overRect,\n      pointerY: pointer.y,\n      hasVisibleChildren,\n    });\n\n    if (zone === 'nest') {\n      const activeNode = items.find(({ id }) => id === activeId)?.node;\n      const nestIsValid =\n        activeNode == null ||\n        activeNode.type !== 'folder' ||\n        canNestFolderAt(activeNode, folderNode);\n\n      if (!nestIsValid) {\n        return null;\n      }\n\n      return { kind: 'nest', folderId: folderNode.id, depth: itemHoveredByCursor.depth + 1 };\n    }\n\n    const sibling = getDropTargetFolderSibling(items, activeId, overId, zone);\n    if (sibling) {\n      return { kind: 'insert', ...sibling };\n    }\n  }\n\n  const side = (() => {\n    if (!pointer || !overRect) {\n      return undefined;\n    }\n\n    return pointer.y < overRect.top + overRect.height / 2 ? 'before' : 'after';\n  })();\n\n  const insert = getDropTargetBetweenRows(items, activeId, overId, offsetX, side);\n\n  return insert ? { kind: 'insert', ...insert } : null;\n}\n\nexport type FolderDropZone = 'before' | 'nest' | 'after';\n\n/**\n * Configuration for the folder drop zones.\n *\n * There are three zones and several possible behaviors:\n *  1. The top zone of the folder row (\"beore\"). This drops the the dragged row above the folder row.\n *  2. The bottom zone of the folder row (\"after\"). This drops the dragged row below the folder row.\n *  If the folder is expanded:\n *    3. The middle zone of the folder row (\"nest\"). This drops the dragged row inside the folder row.\n *  If the folder is collapsed:\n *   3A. The middle zone of the folder row (\"nest\"). This drops the dragged row inside the folder row.\n *   3B. If the folder is held over the middle zone for a certain amount of time, the folder will expand and the dragged row can be dropped inside the folder row.\n */\n\nconst NEST_ZONE_BOTTOM = 0.8;\nconst NEST_ZONE_TOP = 0.2;\n\ntype CalculateFolderDropZoneProps = {\n  itemBoundingBox: { top: number; height: number };\n  hasVisibleChildren: boolean;\n  pointerY: number;\n};\n\nexport function calculateFolderDropZone({\n  hasVisibleChildren,\n  itemBoundingBox,\n  pointerY,\n}: CalculateFolderDropZoneProps): FolderDropZone {\n  if (pointerY < itemBoundingBox.top + itemBoundingBox.height * NEST_ZONE_TOP) {\n    return 'before';\n  }\n\n  if (\n    !hasVisibleChildren &&\n    pointerY > itemBoundingBox.top + itemBoundingBox.height * NEST_ZONE_BOTTOM\n  ) {\n    return 'after';\n  }\n\n  return 'nest';\n}\n"],"names":["INDENT_WIDTH","clamp","value","min","max","Math","getDropTargetSectionRoot","items","activeId","rootItems","filter","item","depth","id","lastRootLeaf","reverse","find","node","type","firstRootFolder","line","anchorId","edge","parentId","index","getDropTargetBetweenRows","overId","offsetX","side","activeIndex","findIndex","overIndex","active","rowsBeforeSlot","previous","next","withoutActive","overPos","insertPos","slice","reordered","arrayMove","dragDepth","round","projectedDepth","minDepth","maxDepth","collapsed","folderCeiling","MAX_FOLDER_DEPTH","subtreeFolderHeight","ancestor","insertingAmongRootContentTypes","undefined","getDropTargetFolderSibling","folderId","folderIndex","folder","boundary","i","lastIndex","length","resolveDropTarget","dragState","pointer","overRect","itemHoveredByCursor","folderNode","nextItem","indexOf","hasVisibleChildren","zone","calculateFolderDropZone","itemBoundingBox","pointerY","y","activeNode","nestIsValid","canNestFolderAt","kind","sibling","top","height","insert","NEST_ZONE_BOTTOM","NEST_ZONE_TOP"],"mappings":";;;;AAQO,MAAMA,YAAAA,GAAe,GAAG;AAO/B,MAAMC,KAAAA,GAAQ,CAACC,KAAAA,EAAeC,GAAAA,EAAaC,GAAAA,GAAAA;AACzC,IAAA,OAAOC,KAAKF,GAAG,CAACE,KAAKD,GAAG,CAACF,OAAOC,GAAAA,CAAAA,EAAMC,GAAAA,CAAAA;AACxC,CAAA;AAkBA;;;AAGC,IACD,SAASE,wBAAAA,CAAyBC,KAAiB,EAAEC,QAAgB,EAAA;AACnE,IAAA,MAAMC,SAAAA,GAAYF,KAAAA,CAAMG,MAAM,CAAC,CAACC,IAAAA,GAASA,IAAAA,CAAKC,KAAK,KAAK,CAAA,IAAKD,IAAAA,CAAKE,EAAE,KAAKL,QAAAA,CAAAA;AAEzE,IAAA,MAAMM,YAAAA,GAAe;AAAIL,QAAAA,GAAAA;KAAU,CAACM,OAAO,EAAA,CAAGC,IAAI,CAAC,CAACL,OAASA,IAAAA,CAAKM,IAAI,CAACC,IAAI,KAAK,aAAA,CAAA;IAChF,MAAMC,eAAAA,GAAkBV,SAAAA,CAAUO,IAAI,CAAC,CAACL,OAASA,IAAAA,CAAKM,IAAI,CAACC,IAAI,KAAK,QAAA,CAAA;IAEpE,MAAME,IAAAA,GAAwB,CAAC,IAAA;AAC7B,QAAA,IAAID,eAAAA,EAAiB;YACnB,OAAO;AAAEE,gBAAAA,QAAAA,EAAUF,gBAAgBN,EAAE;gBAAES,IAAAA,EAAM;AAAM,aAAA;AACrD,QAAA;AAEA,QAAA,IAAIR,YAAAA,EAAc;YAChB,OAAO;AAAEO,gBAAAA,QAAAA,EAAUP,aAAaD,EAAE;gBAAES,IAAAA,EAAM;AAAS,aAAA;AACrD,QAAA;QAEA,OAAO,IAAA;IACT,CAAA,GAAA;IAEA,OAAO;QAAEC,QAAAA,EAAU,IAAA;QAAMC,KAAAA,EAAO,CAAA;QAAGZ,KAAAA,EAAO,CAAA;AAAGQ,QAAAA;AAAK,KAAA;AACpD;AAEA,SAASK,wBAAAA,CACPlB,KAAiB,EACjBC,QAAgB,EAChBkB,MAAc,EACdC,OAAe,EACfC,IAAyB,EAAA;IAEzB,MAAMC,WAAAA,GAActB,MAAMuB,SAAS,CAAC,CAACnB,IAAAA,GAASA,IAAAA,CAAKE,EAAE,KAAKL,QAAAA,CAAAA;IAC1D,MAAMuB,SAAAA,GAAYxB,MAAMuB,SAAS,CAAC,CAACnB,IAAAA,GAASA,IAAAA,CAAKE,EAAE,KAAKa,MAAAA,CAAAA;AAExD,IAAA,IAAIK,SAAAA,KAAc,EAAC,IAAKF,WAAAA,KAAgB,EAAC,EAAG;QAC1C,OAAO,IAAA;AACT,IAAA;IAEA,MAAMG,MAAAA,GAASzB,KAAK,CAACsB,WAAAA,CAAY;IAEjC,MAAM,EAAEI,cAAc,EAAEC,QAAQ,EAAEC,IAAI,EAAE,GAAI,CAAA,IAAA;AAC1C,QAAA,IAAIP,IAAAA,EAAM;YACR,MAAMQ,aAAAA,GAAgB7B,MAAMG,MAAM,CAAC,CAACC,IAAAA,GAASA,IAAAA,CAAKE,EAAE,KAAKL,QAAAA,CAAAA;YACzD,MAAM6B,OAAAA,GAAUD,cAAcN,SAAS,CAAC,CAACnB,IAAAA,GAASA,IAAAA,CAAKE,EAAE,KAAKa,MAAAA,CAAAA;AAC9D,YAAA,MAAMY,SAAAA,GAAYV,IAAAA,KAAS,QAAA,GAAWS,OAAAA,GAAUA,OAAAA,GAAU,CAAA;YAE1D,OAAO;gBACLJ,cAAAA,EAAgBG,aAAAA,CAAcG,KAAK,CAAC,CAAA,EAAGD,SAAAA,CAAAA;gBACvCJ,QAAAA,EAAUE,aAAa,CAACE,SAAAA,GAAY,CAAA,CAAE;gBACtCH,IAAAA,EAAMC,aAAa,CAACE,SAAAA;AACtB,aAAA;AACF,QAAA;QAEA,MAAME,SAAAA,GAAYC,SAAAA,CAAUlC,KAAAA,EAAOsB,WAAAA,EAAaE,SAAAA,CAAAA;QAEhD,OAAO;YACLE,cAAAA,EAAgBO,SAAAA,CAAUD,KAAK,CAAC,CAAA,EAAGR,SAAAA,CAAAA;YACnCG,QAAAA,EAAUM,SAAS,CAACT,SAAAA,GAAY,CAAA,CAAE;YAClCI,IAAAA,EAAMK,SAAS,CAACT,SAAAA,GAAY,CAAA;AAC9B,SAAA;IACF,CAAA,GAAA;AAEA,IAAA,MAAMW,SAAAA,GAAYrC,IAAAA,CAAKsC,KAAK,CAAChB,OAAAA,GAAU3B,YAAAA,CAAAA;IACvC,MAAM4C,cAAAA,GAAiBZ,MAAAA,CAAOpB,KAAK,GAAG8B,SAAAA;AAEtC,IAAA,MAAMG,QAAAA,GAAWV,IAAAA,GAAOA,IAAAA,CAAKvB,KAAK,GAAG,CAAA;IAErC,IAAIkC,QAAAA;AACJ,IAAA,IAAI,CAACZ,QAAAA,EAAU;QACbY,QAAAA,GAAW,CAAA;IACb,CAAA,MAAO,IAAIZ,QAAAA,CAASjB,IAAI,CAACC,IAAI,KAAK,QAAA,IAAY,CAACgB,QAAAA,CAASa,SAAS,EAAE;QACjED,QAAAA,GAAWZ,QAAAA,CAAStB,KAAK,GAAG,CAAA;IAC9B,CAAA,MAAO;AACLkC,QAAAA,QAAAA,GAAWZ,SAAStB,KAAK;AAC3B,IAAA;AAEA,IAAA,IAAIoB,MAAAA,CAAOf,IAAI,CAACC,IAAI,KAAK,QAAA,EAAU;AACjC,QAAA,MAAM8B,aAAAA,GAAgBC,gBAAAA,GAAmBC,mBAAAA,CAAoBlB,MAAAA,CAAOf,IAAI,CAAA;QACxE6B,QAAAA,GAAWzC,IAAAA,CAAKF,GAAG,CAAC2C,QAAAA,EAAUE,aAAAA,CAAAA;AAChC,IAAA;AAEA,IAAA,IAAIF,WAAWD,QAAAA,EAAU;QACvB,OAAO,IAAA;AACT,IAAA;IACA,MAAMjC,KAAAA,GAAQX,KAAAA,CAAM2C,cAAAA,EAAgBC,QAAAA,EAAUC,QAAAA,CAAAA;IAE9C,MAAMvB,QAAAA,GAAW,CAAC,IAAA;QAChB,IAAIX,KAAAA,KAAU,CAAA,IAAK,CAACsB,QAAAA,EAAU;YAC5B,OAAO,IAAA;AACT,QAAA;QAEA,IAAItB,KAAAA,KAAUsB,QAAAA,CAAStB,KAAK,EAAE;AAC5B,YAAA,OAAOsB,SAASX,QAAQ;AAC1B,QAAA;QAEA,IAAIX,KAAAA,GAAQsB,QAAAA,CAAStB,KAAK,EAAE;AAC1B,YAAA,OAAOsB,QAAAA,CAASjB,IAAI,CAACC,IAAI,KAAK,QAAA,GAAWgB,QAAAA,CAASjB,IAAI,CAACJ,EAAE,GAAGqB,QAAAA,CAASX,QAAQ;AAC/E,QAAA;AAEA,QAAA,MAAM4B,QAAAA,GAAW;AAAIlB,YAAAA,GAAAA;SAAe,CAAClB,OAAO,GAAGC,IAAI,CAAC,CAACL,IAAAA,GAASA,IAAAA,CAAKC,KAAK,KAAKA,KAAAA,CAAAA;QAE7E,OAAOuC,QAAAA,GAAWA,QAAAA,CAAS5B,QAAQ,GAAG,IAAA;IACxC,CAAA,GAAA;AAEA,IAAA,IAAIC,KAAAA,GAAQ,CAAA;IAEZ,KAAK,MAAMb,QAAQsB,cAAAA,CAAgB;AACjC,QAAA,IAAItB,KAAKY,QAAQ,KAAKA,YAAYZ,IAAAA,CAAKC,KAAK,KAAKA,KAAAA,EAAO;AACtD,YAAA;AACF,QAAA;AAEA,QAAA,IAAIW,aAAa,IAAA,IAAQZ,IAAAA,CAAKM,IAAI,CAACC,IAAI,KAAK,QAAA,EAAU;AACpD,YAAA;AACF,QAAA;QAEAM,KAAAA,IAAS,CAAA;AACX,IAAA;IAEA,MAAMJ,IAAAA,GAAwB,CAAC,IAAA;AAC7B,QAAA,IAAIe,IAAAA,EAAM;YACR,OAAO;AAAEd,gBAAAA,QAAAA,EAAUc,KAAKtB,EAAE;gBAAES,IAAAA,EAAM;AAAM,aAAA;AAC1C,QAAA;AAEA,QAAA,IAAIY,QAAAA,EAAU;YACZ,OAAO;AAAEb,gBAAAA,QAAAA,EAAUa,SAASrB,EAAE;gBAAES,IAAAA,EAAM;AAAS,aAAA;AACjD,QAAA;QAEA,OAAO,IAAA;IACT,CAAA,GAAA;AAEA,4IACA,MAAM8B,8BAAAA,GACJ7B,QAAAA,KAAa,QACbY,IAAAA,KAASkB,SAAAA,IACTlB,IAAAA,CAAKlB,IAAI,CAACC,IAAI,KAAK,aAAA,IACnBiB,IAAAA,CAAKZ,QAAQ,KAAK,IAAA;IAEpB,IAAkC6B,8BAAAA,EAAgC;AAChE,QAAA,OAAO9C,yBAAyBC,KAAAA,EAAOC,QAAAA,CAAAA;AACzC,IAAA;IAEA,OAAO;AAAEe,QAAAA,QAAAA;AAAUC,QAAAA,KAAAA;AAAOZ,QAAAA,KAAAA;AAAOQ,QAAAA;AAAK,KAAA;AACxC;AAEA,SAASkC,2BACP/C,KAAiB,EACjBC,QAAgB,EAChB+C,QAAgB,EAChB3B,IAAwB,EAAA;IAExB,MAAM4B,WAAAA,GAAcjD,MAAMuB,SAAS,CAAC,CAACnB,IAAAA,GAASA,IAAAA,CAAKE,EAAE,KAAK0C,QAAAA,CAAAA;IAC1D,MAAMvB,MAAAA,GAASzB,MAAMS,IAAI,CAAC,CAACL,IAAAA,GAASA,IAAAA,CAAKE,EAAE,KAAKL,QAAAA,CAAAA;AAEhD,IAAA,IAAIgD,WAAAA,KAAgB,EAAC,IAAK,CAACxB,MAAAA,EAAQ;QACjC,OAAO,IAAA;AACT,IAAA;IAEA,MAAMyB,MAAAA,GAASlD,KAAK,CAACiD,WAAAA,CAAY;AACjC,IAAA,MAAM,EAAEjC,QAAQ,EAAEX,KAAK,EAAE,GAAG6C,MAAAA;IAE5B,IACEzB,MAAAA,CAAOf,IAAI,CAACC,IAAI,KAAK,QAAA,IACrBN,KAAAA,GAAQsC,mBAAAA,CAAoBlB,MAAAA,CAAOf,IAAI,CAAA,GAAIgC,gBAAAA,EAC3C;QACA,OAAO,IAAA;AACT,IAAA;AAEA,IAAA,MAAMS,QAAAA,GAAW9B,IAAAA,KAAS,QAAA,GAAW4B,WAAAA,GAAcA,WAAAA,GAAc,CAAA;AACjE,IAAA,IAAIhC,KAAAA,GAAQ,CAAA;AAEZ,IAAA,IAAK,IAAImC,CAAAA,GAAI,CAAA,EAAGA,CAAAA,GAAID,QAAAA,EAAUC,KAAK,CAAA,CAAG;QACpC,MAAMhD,IAAAA,GAAOJ,KAAK,CAACoD,CAAAA,CAAE;QAErB,IAAIhD,IAAAA,CAAKE,EAAE,KAAKL,QAAAA,EAAU;AACxB,YAAA;AACF,QAAA;AAEA,QAAA,IAAIG,KAAKY,QAAQ,KAAKA,YAAYZ,IAAAA,CAAKC,KAAK,KAAKA,KAAAA,EAAO;AACtD,YAAA;AACF,QAAA;AAEA,QAAA,IAAIW,aAAa,IAAA,IAAQZ,IAAAA,CAAKM,IAAI,CAACC,IAAI,KAAK,QAAA,EAAU;AACpD,YAAA;AACF,QAAA;QAEAM,KAAAA,IAAS,CAAA;AACX,IAAA;IAEA,MAAMJ,IAAAA,GAAiB,CAAC,IAAA;AACtB,QAAA,IAAIQ,SAAS,QAAA,EAAU;YACrB,OAAO;AAAEP,gBAAAA,QAAAA,EAAUoC,OAAO5C,EAAE;gBAAES,IAAAA,EAAM;AAAM,aAAA;AAC5C,QAAA;AAEA,QAAA,IAAIsC,SAAAA,GAAYJ,WAAAA;QAEhB,IAAK,IAAIG,IAAIH,WAAAA,GAAc,CAAA,EAAGG,IAAIpD,KAAAA,CAAMsD,MAAM,EAAEF,CAAAA,IAAK,CAAA,CAAG;AACtD,YAAA,IAAIpD,KAAK,CAACoD,CAAAA,CAAE,CAAC/C,KAAK,IAAIA,KAAAA,EAAO;AAC3B,gBAAA;AACF,YAAA;YAEAgD,SAAAA,GAAYD,CAAAA;AACd,QAAA;QAEA,OAAO;AAAEtC,YAAAA,QAAAA,EAAUd,KAAK,CAACqD,SAAAA,CAAU,CAAC/C,EAAE;YAAES,IAAAA,EAAM;AAAS,SAAA;IACzD,CAAA,GAAA;IAEA,OAAO;AAAEC,QAAAA,QAAAA;AAAUC,QAAAA,KAAAA;AAAOZ,QAAAA,KAAAA;AAAOQ,QAAAA;AAAK,KAAA;AACxC;AAUA;;;;;;;;;;;;;AAaC,IACM,SAAS0C,iBAAAA,CAAkBvD,KAAiB,EAAEwD,SAAoB,EAAA;IACvE,MAAM,EAAEvD,QAAQ,EAAEkB,MAAM,EAAEC,OAAO,EAAEqC,OAAO,EAAEC,QAAQ,EAAE,GAAGF,SAAAA;AAEzD,IAAA,IAAIrC,WAAWlB,QAAAA,EAAU;QACvB,OAAO,IAAA;AACT,IAAA;IAEA,MAAM0D,mBAAAA,GAAsB3D,MAAMS,IAAI,CAAC,CAACL,IAAAA,GAASA,IAAAA,CAAKE,EAAE,KAAKa,MAAAA,CAAAA;;IAG7D,IAAIwC,mBAAAA,IAAuBA,oBAAoBjD,IAAI,CAACC,IAAI,KAAK,QAAA,IAAY8C,WAAWC,QAAAA,EAAU;QAC5F,MAAME,UAAAA,GAAaD,oBAAoBjD,IAAI;AAE3C,QAAA,MAAMmD,WAAW7D,KAAK,CAACA,MAAM8D,OAAO,CAACH,uBAAuB,CAAA,CAAE;AAC9D,QAAA,MAAMI,qBAAqBF,QAAAA,IAAY,IAAA,IAAQA,SAASxD,KAAK,GAAGsD,oBAAoBtD,KAAK;;AAGzF,QAAA,MAAM2D,OAAOC,uBAAAA,CAAwB;YACnCC,eAAAA,EAAiBR,QAAAA;AACjBS,YAAAA,QAAAA,EAAUV,QAAQW,CAAC;AACnBL,YAAAA;AACF,SAAA,CAAA;AAEA,QAAA,IAAIC,SAAS,MAAA,EAAQ;YACnB,MAAMK,UAAAA,GAAarE,KAAAA,CAAMS,IAAI,CAAC,CAAC,EAAEH,EAAE,EAAE,GAAKA,EAAAA,KAAOL,QAAAA,CAAAA,EAAWS,IAAAA;YAC5D,MAAM4D,WAAAA,GACJD,cAAc,IAAA,IACdA,UAAAA,CAAW1D,IAAI,KAAK,QAAA,IACpB4D,gBAAgBF,UAAAA,EAAYT,UAAAA,CAAAA;AAE9B,YAAA,IAAI,CAACU,WAAAA,EAAa;gBAChB,OAAO,IAAA;AACT,YAAA;YAEA,OAAO;gBAAEE,IAAAA,EAAM,MAAA;AAAQxB,gBAAAA,QAAAA,EAAUY,WAAWtD,EAAE;gBAAED,KAAAA,EAAOsD,mBAAAA,CAAoBtD,KAAK,GAAG;AAAE,aAAA;AACvF,QAAA;AAEA,QAAA,MAAMoE,OAAAA,GAAU1B,0BAAAA,CAA2B/C,KAAAA,EAAOC,QAAAA,EAAUkB,MAAAA,EAAQ6C,IAAAA,CAAAA;AACpE,QAAA,IAAIS,OAAAA,EAAS;YACX,OAAO;gBAAED,IAAAA,EAAM,QAAA;AAAU,gBAAA,GAAGC;AAAQ,aAAA;AACtC,QAAA;AACF,IAAA;IAEA,MAAMpD,IAAAA,GAAO,CAAC,IAAA;QACZ,IAAI,CAACoC,OAAAA,IAAW,CAACC,QAAAA,EAAU;YACzB,OAAOZ,SAAAA;AACT,QAAA;QAEA,OAAOW,OAAAA,CAAQW,CAAC,GAAGV,QAAAA,CAASgB,GAAG,GAAGhB,QAAAA,CAASiB,MAAM,GAAG,CAAA,GAAI,QAAA,GAAW,OAAA;IACrE,CAAA,GAAA;AAEA,IAAA,MAAMC,MAAAA,GAAS1D,wBAAAA,CAAyBlB,KAAAA,EAAOC,QAAAA,EAAUkB,QAAQC,OAAAA,EAASC,IAAAA,CAAAA;AAE1E,IAAA,OAAOuD,MAAAA,GAAS;QAAEJ,IAAAA,EAAM,QAAA;AAAU,QAAA,GAAGI;KAAO,GAAI,IAAA;AAClD;AAIA;;;;;;;;;;;AAWC,IAED,MAAMC,gBAAAA,GAAmB,GAAA;AACzB,MAAMC,aAAAA,GAAgB,GAAA;AAQf,SAASb,wBAAwB,EACtCF,kBAAkB,EAClBG,eAAe,EACfC,QAAQ,EACqB,EAAA;AAC7B,IAAA,IAAIA,WAAWD,eAAAA,CAAgBQ,GAAG,GAAGR,eAAAA,CAAgBS,MAAM,GAAGG,aAAAA,EAAe;QAC3E,OAAO,QAAA;AACT,IAAA;IAEA,IACE,CAACf,sBACDI,QAAAA,GAAWD,eAAAA,CAAgBQ,GAAG,GAAGR,eAAAA,CAAgBS,MAAM,GAAGE,gBAAAA,EAC1D;QACA,OAAO,OAAA;AACT,IAAA;IAEA,OAAO,MAAA;AACT;;;;"}