@strapi/content-type-builder 5.53.0 → 5.55.0

package/dist/admin/components/ContentTypeBuilderNav/hooks/useSortableTree.mjs

@@ -0,0 +1,143 @@
+import { useState, useRef, useCallback } from 'react';
+import { pointerWithin, closestCenter, useSensors, useSensor, PointerSensor } from '@dnd-kit/core';
+import { resolveDropTarget } from '../lib/dropProjection.mjs';
+import { removeSubtree } from '../lib/flatModel.mjs';
+
+// How long the pointer must dwell over a closed folder's nest zone before it
+// springs open, letting you drop deeper.
+const SPRING_OPEN_MS = 700;
+const useHoverFolderOpen = (onExpandFolder)=>{
+    const springRef = useRef({
+        folderId: null
+    });
+    const cancelFolderOpen = ()=>{
+        clearTimeout(springRef.current.timer);
+        springRef.current = {
+            folderId: null
+        };
+    };
+    // Arm (once per folder) a timer that springs the closed folder open after a
+    // dwell, so the user can drop into a deeper level.
+    const scheduleFolderOpen = (folderId)=>{
+        if (springRef.current.folderId === folderId) {
+            return;
+        }
+        cancelFolderOpen();
+        springRef.current.folderId = folderId;
+        springRef.current.timer = setTimeout(()=>{
+            onExpandFolder(folderId);
+            springRef.current.folderId = null;
+        }, SPRING_OPEN_MS);
+    };
+    return {
+        scheduleFolderOpen,
+        cancelFolderOpen
+    };
+};
+/**
+ * The drag-and-drop engine for a flattened folder tree: it owns the drag state
+ * machine, pointer-vs-row geometry, spring-open timers and drop projection, and
+ * returns the props a `DndContext` + `SortableContext` need plus the resolved
+ * drop indicator. It carries no domain logic — nesting rules, the move itself,
+ * and expansion are supplied by the caller through {@link UseSortableTreeOptions}.
+ */ const useSortableTree = ({ onExpandFolder, collapsed, disabled, onDrop, canDrop = ()=>true, items })=>{
+    const [projected, setProjected] = useState(null);
+    const [activeId, setActiveId] = useState(null);
+    const pointerRef = useRef(null);
+    const { scheduleFolderOpen, cancelFolderOpen } = useHoverFolderOpen(onExpandFolder);
+    const collisionDetection = useCallback((args)=>{
+        // Captured here (onDragMove has no pointer position) to decide whether the
+        // pointer sits over a folder's nest zone (its middle third).
+        pointerRef.current = args.pointerCoordinates;
+        // Resolve `over` from the pointer, NOT the drag overlay's centre. dnd-kit
+        // keeps the grab point under the cursor, so the overlay centre sits up to
+        // half a row from the pointer depending on where the row was picked up; with
+        // closest-centre, `over` and the pointer-based nest-zone check then disagree
+        // and nesting into a folder misfires. Fall back to closest-centre only when
+        // the pointer is outside every row (the list's padding / edges). A static
+        // list keeps both results stable, so no hysteresis is needed.
+        const withinPointer = pointerWithin(args);
+        return withinPointer.length > 0 ? withinPointer : closestCenter(args);
+    }, []);
+    // While dragging a folder, its descendents are hidden so it cannot nest in itself.
+    const renderedItems = activeId ? removeSubtree(items, activeId) : items;
+    const activeItem = items.find((item)=>item.id === activeId) ?? null;
+    const sensors = useSensors(useSensor(PointerSensor, {
+        activationConstraint: {
+            distance: 8
+        }
+    }));
+    const onDragStart = (event)=>{
+        if (disabled) {
+            return;
+        }
+        cancelFolderOpen();
+        setActiveId(String(event.active.id));
+        setProjected(null);
+    };
+    const onDragCancel = ()=>{
+        resetDrag();
+    };
+    const onDragMove = (event)=>{
+        if (!activeId || !event.over) {
+            return;
+        }
+        const target = resolveDropTarget(renderedItems, {
+            pointer: pointerRef.current ?? undefined,
+            overId: String(event.over.id),
+            overRect: event.over.rect,
+            offsetX: event.delta.x,
+            activeId
+        });
+        if (target && activeItem && !canDrop(activeItem.node, target)) {
+            setProjected(null);
+            cancelFolderOpen();
+            return;
+        }
+        setProjected(target);
+        if (target?.kind === 'nest' && collapsed.has(target.folderId)) {
+            scheduleFolderOpen(target.folderId);
+        } else {
+            cancelFolderOpen();
+        }
+    };
+    const resetDrag = ()=>{
+        cancelFolderOpen();
+        setActiveId(null);
+        setProjected(null);
+    };
+    const onDragEnd = ()=>{
+        if (disabled) {
+            return;
+        }
+        const item = activeItem;
+        const target = projected;
+        resetDrag();
+        if (!item || !target) {
+            return;
+        }
+        onDrop(item.node, target);
+    };
+    const dropLine = projected?.kind === 'insert' && projected.line ? {
+        ...projected.line,
+        depth: projected.depth
+    } : null;
+    const dropTargetId = projected?.kind === 'nest' ? `folder:${projected.folderId}` : null;
+    const sortingStrategy = ()=>null;
+    return {
+        collisionDetection,
+        sortingStrategy,
+        renderedItems,
+        dropTargetId,
+        activeItem,
+        dropLine,
+        sensors,
+        onDragCancel,
+        onDragStart,
+        onDragMove,
+        onDragEnd
+    };
+};
+
+export { useSortableTree };
+//# sourceMappingURL=useSortableTree.mjs.map

package/dist/admin/components/ContentTypeBuilderNav/hooks/useSortableTree.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"useSortableTree.mjs","sources":["../../../../../admin/src/components/ContentTypeBuilderNav/hooks/useSortableTree.ts"],"sourcesContent":["import { useCallback, useRef, useState } from 'react';\n\nimport { closestCenter, PointerSensor, pointerWithin, useSensor, useSensors } from '@dnd-kit/core';\n\nimport { resolveDropTarget } from '../lib/dropProjection';\nimport { removeSubtree } from '../lib/flatModel';\n\nimport type { FolderTreeNode } from '../lib/buildFolderTree';\nimport type { DropTarget } from '../lib/dropProjection';\nimport type { FlatItem } from '../lib/flatModel';\nimport type {\n  CollisionDetection,\n  DragMoveEvent,\n  DragStartEvent,\n  SensorDescriptor,\n} from '@dnd-kit/core';\nimport type { SortingStrategy } from '@dnd-kit/sortable';\n\n// How long the pointer must dwell over a closed folder's nest zone before it\n// springs open, letting you drop deeper.\nconst SPRING_OPEN_MS = 700;\n\n/** The insertion line to paint, plus the depth its left edge indents to. */\nexport type DropLine = { anchorId: string; edge: 'top' | 'bottom'; depth: number };\n\ninterface UseSortableTreeOptions {\n  /** Commit a drop. Called only for a real move, with the node and its resolved target. */\n  onDrop: (activeNode: FolderTreeNode, target: DropTarget) => void;\n  /**\n   * Function which determines whether the dragged node may land on the resolved target.\n   */\n  canDrop?: (activeNode: FolderTreeNode, target: DropTarget) => boolean;\n  /** Spring-open a closed folder held under the pointer, so the user can drop deeper. */\n  onExpandFolder: (folderId: string) => void;\n  /** Ids of collapsed folders — used to tell a closed folder (springs open) from an empty one. */\n  collapsed: Set<string>;\n  /** When true the contentStructure tree is read-only. */\n  disabled: boolean;\n  /** The full flattened, visible tree (descendants of collapsed folders omitted). */\n  items: FlatItem[];\n}\n\nexport interface UseSortableTreeResult {\n  collisionDetection: CollisionDetection;\n  sensors: SensorDescriptor<object>[];\n  sortingStrategy: SortingStrategy;\n  /** The items to render (the dragged folder's descendants are hidden mid-drag). */\n  renderedItems: FlatItem[];\n  /** The row being dragged, or null. */\n  activeItem: FlatItem | null;\n  /** Folder row (by dnd id) to highlight as the nest target — no line is drawn for it. */\n  dropTargetId: string | null;\n  /** The insertion line to paint, or null when nesting into a highlighted folder. */\n  dropLine: DropLine | null;\n  onDragStart: (event: DragStartEvent) => void;\n  onDragMove: (event: DragMoveEvent) => void;\n  onDragCancel: () => void;\n  onDragEnd: () => void;\n}\n\ntype SpringRef = { folderId: string | null; timer?: ReturnType<typeof setTimeout> };\n\nconst useHoverFolderOpen = (onExpandFolder: (folderId: string) => void) => {\n  const springRef = useRef<SpringRef>({ folderId: null });\n\n  const cancelFolderOpen = () => {\n    clearTimeout(springRef.current.timer);\n    springRef.current = { folderId: null };\n  };\n\n  // Arm (once per folder) a timer that springs the closed folder open after a\n  // dwell, so the user can drop into a deeper level.\n  const scheduleFolderOpen = (folderId: string) => {\n    if (springRef.current.folderId === folderId) {\n      return;\n    }\n\n    cancelFolderOpen();\n    springRef.current.folderId = folderId;\n\n    springRef.current.timer = setTimeout(() => {\n      onExpandFolder(folderId);\n      springRef.current.folderId = null;\n    }, SPRING_OPEN_MS);\n  };\n\n  return { scheduleFolderOpen, cancelFolderOpen };\n};\n\n/**\n * The drag-and-drop engine for a flattened folder tree: it owns the drag state\n * machine, pointer-vs-row geometry, spring-open timers and drop projection, and\n * returns the props a `DndContext` + `SortableContext` need plus the resolved\n * drop indicator. It carries no domain logic — nesting rules, the move itself,\n * and expansion are supplied by the caller through {@link UseSortableTreeOptions}.\n */\nexport const useSortableTree = ({\n  onExpandFolder,\n  collapsed,\n  disabled,\n  onDrop,\n  canDrop = () => true,\n  items,\n}: UseSortableTreeOptions): UseSortableTreeResult => {\n  const [projected, setProjected] = useState<DropTarget | null>(null);\n  const [activeId, setActiveId] = useState<string | null>(null);\n\n  const pointerRef = useRef<{ x: number; y: number } | null>(null);\n  const { scheduleFolderOpen, cancelFolderOpen } = useHoverFolderOpen(onExpandFolder);\n\n  const collisionDetection = useCallback<CollisionDetection>((args) => {\n    // Captured here (onDragMove has no pointer position) to decide whether the\n    // pointer sits over a folder's nest zone (its middle third).\n    pointerRef.current = args.pointerCoordinates;\n\n    // Resolve `over` from the pointer, NOT the drag overlay's centre. dnd-kit\n    // keeps the grab point under the cursor, so the overlay centre sits up to\n    // half a row from the pointer depending on where the row was picked up; with\n    // closest-centre, `over` and the pointer-based nest-zone check then disagree\n    // and nesting into a folder misfires. Fall back to closest-centre only when\n    // the pointer is outside every row (the list's padding / edges). A static\n    // list keeps both results stable, so no hysteresis is needed.\n    const withinPointer = pointerWithin(args);\n    return withinPointer.length > 0 ? withinPointer : closestCenter(args);\n  }, []);\n\n  // While dragging a folder, its descendents are hidden so it cannot nest in itself.\n  const renderedItems = activeId ? removeSubtree(items, activeId) : items;\n  const activeItem = items.find((item) => item.id === activeId) ?? null;\n\n  const sensors = useSensors(useSensor(PointerSensor, { activationConstraint: { distance: 8 } }));\n\n  const onDragStart = (event: DragStartEvent) => {\n    if (disabled) {\n      return;\n    }\n\n    cancelFolderOpen();\n    setActiveId(String(event.active.id));\n    setProjected(null);\n  };\n\n  const onDragCancel = () => {\n    resetDrag();\n  };\n\n  const onDragMove = (event: DragMoveEvent) => {\n    if (!activeId || !event.over) {\n      return;\n    }\n\n    const target = resolveDropTarget(renderedItems, {\n      pointer: pointerRef.current ?? undefined,\n      overId: String(event.over.id),\n      overRect: event.over.rect,\n      offsetX: event.delta.x,\n      activeId,\n    });\n\n    if (target && activeItem && !canDrop(activeItem.node, target)) {\n      setProjected(null);\n      cancelFolderOpen();\n      return;\n    }\n\n    setProjected(target);\n\n    if (target?.kind === 'nest' && collapsed.has(target.folderId)) {\n      scheduleFolderOpen(target.folderId);\n    } else {\n      cancelFolderOpen();\n    }\n  };\n\n  const resetDrag = () => {\n    cancelFolderOpen();\n    setActiveId(null);\n    setProjected(null);\n  };\n\n  const onDragEnd = () => {\n    if (disabled) {\n      return;\n    }\n\n    const item = activeItem;\n    const target = projected;\n\n    resetDrag();\n\n    if (!item || !target) {\n      return;\n    }\n\n    onDrop(item.node, target);\n  };\n\n  const dropLine =\n    projected?.kind === 'insert' && projected.line\n      ? { ...projected.line, depth: projected.depth }\n      : null;\n\n  const dropTargetId = projected?.kind === 'nest' ? `folder:${projected.folderId}` : null;\n\n  const sortingStrategy: SortingStrategy = () => null;\n\n  return {\n    collisionDetection,\n    sortingStrategy,\n    renderedItems,\n    dropTargetId,\n    activeItem,\n    dropLine,\n    sensors,\n    onDragCancel,\n    onDragStart,\n    onDragMove,\n    onDragEnd,\n  };\n};\n"],"names":["SPRING_OPEN_MS","useHoverFolderOpen","onExpandFolder","springRef","useRef","folderId","cancelFolderOpen","clearTimeout","current","timer","scheduleFolderOpen","setTimeout","useSortableTree","collapsed","disabled","onDrop","canDrop","items","projected","setProjected","useState","activeId","setActiveId","pointerRef","collisionDetection","useCallback","args","pointerCoordinates","withinPointer","pointerWithin","length","closestCenter","renderedItems","removeSubtree","activeItem","find","item","id","sensors","useSensors","useSensor","PointerSensor","activationConstraint","distance","onDragStart","event","String","active","onDragCancel","resetDrag","onDragMove","over","target","resolveDropTarget","pointer","undefined","overId","overRect","rect","offsetX","delta","x","node","kind","has","onDragEnd","dropLine","line","depth","dropTargetId","sortingStrategy"],"mappings":";;;;;AAkBA;AACA;AACA,MAAMA,cAAAA,GAAiB,GAAA;AA0CvB,MAAMC,qBAAqB,CAACC,cAAAA,GAAAA;AAC1B,IAAA,MAAMC,YAAYC,MAAAA,CAAkB;QAAEC,QAAAA,EAAU;AAAK,KAAA,CAAA;AAErD,IAAA,MAAMC,gBAAAA,GAAmB,IAAA;QACvBC,YAAAA,CAAaJ,SAAAA,CAAUK,OAAO,CAACC,KAAK,CAAA;AACpCN,QAAAA,SAAAA,CAAUK,OAAO,GAAG;YAAEH,QAAAA,EAAU;AAAK,SAAA;AACvC,IAAA,CAAA;;;AAIA,IAAA,MAAMK,qBAAqB,CAACL,QAAAA,GAAAA;AAC1B,QAAA,IAAIF,SAAAA,CAAUK,OAAO,CAACH,QAAQ,KAAKA,QAAAA,EAAU;AAC3C,YAAA;AACF,QAAA;AAEAC,QAAAA,gBAAAA,EAAAA;QACAH,SAAAA,CAAUK,OAAO,CAACH,QAAQ,GAAGA,QAAAA;AAE7BF,QAAAA,SAAAA,CAAUK,OAAO,CAACC,KAAK,GAAGE,UAAAA,CAAW,IAAA;YACnCT,cAAAA,CAAeG,QAAAA,CAAAA;YACfF,SAAAA,CAAUK,OAAO,CAACH,QAAQ,GAAG,IAAA;QAC/B,CAAA,EAAGL,cAAAA,CAAAA;AACL,IAAA,CAAA;IAEA,OAAO;AAAEU,QAAAA,kBAAAA;AAAoBJ,QAAAA;AAAiB,KAAA;AAChD,CAAA;AAEA;;;;;;AAMC,IACM,MAAMM,eAAAA,GAAkB,CAAC,EAC9BV,cAAc,EACdW,SAAS,EACTC,QAAQ,EACRC,MAAM,EACNC,OAAAA,GAAU,IAAM,IAAI,EACpBC,KAAK,EACkB,GAAA;AACvB,IAAA,MAAM,CAACC,SAAAA,EAAWC,YAAAA,CAAa,GAAGC,QAAAA,CAA4B,IAAA,CAAA;AAC9D,IAAA,MAAM,CAACC,QAAAA,EAAUC,WAAAA,CAAY,GAAGF,QAAAA,CAAwB,IAAA,CAAA;AAExD,IAAA,MAAMG,aAAanB,MAAAA,CAAwC,IAAA,CAAA;AAC3D,IAAA,MAAM,EAAEM,kBAAkB,EAAEJ,gBAAgB,EAAE,GAAGL,kBAAAA,CAAmBC,cAAAA,CAAAA;IAEpE,MAAMsB,kBAAAA,GAAqBC,YAAgC,CAACC,IAAAA,GAAAA;;;QAG1DH,UAAAA,CAAWf,OAAO,GAAGkB,IAAAA,CAAKC,kBAAkB;;;;;;;;AAS5C,QAAA,MAAMC,gBAAgBC,aAAAA,CAAcH,IAAAA,CAAAA;AACpC,QAAA,OAAOE,aAAAA,CAAcE,MAAM,GAAG,CAAA,GAAIF,gBAAgBG,aAAAA,CAAcL,IAAAA,CAAAA;AAClE,IAAA,CAAA,EAAG,EAAE,CAAA;;AAGL,IAAA,MAAMM,aAAAA,GAAgBX,QAAAA,GAAWY,aAAAA,CAAchB,KAAAA,EAAOI,QAAAA,CAAAA,GAAYJ,KAAAA;IAClE,MAAMiB,UAAAA,GAAajB,MAAMkB,IAAI,CAAC,CAACC,IAAAA,GAASA,IAAAA,CAAKC,EAAE,KAAKhB,QAAAA,CAAAA,IAAa,IAAA;IAEjE,MAAMiB,OAAAA,GAAUC,UAAAA,CAAWC,SAAAA,CAAUC,aAAAA,EAAe;QAAEC,oBAAAA,EAAsB;YAAEC,QAAAA,EAAU;AAAE;AAAE,KAAA,CAAA,CAAA;AAE5F,IAAA,MAAMC,cAAc,CAACC,KAAAA,GAAAA;AACnB,QAAA,IAAI/B,QAAAA,EAAU;AACZ,YAAA;AACF,QAAA;AAEAR,QAAAA,gBAAAA,EAAAA;AACAgB,QAAAA,WAAAA,CAAYwB,MAAAA,CAAOD,KAAAA,CAAME,MAAM,CAACV,EAAE,CAAA,CAAA;QAClClB,YAAAA,CAAa,IAAA,CAAA;AACf,IAAA,CAAA;AAEA,IAAA,MAAM6B,YAAAA,GAAe,IAAA;AACnBC,QAAAA,SAAAA,EAAAA;AACF,IAAA,CAAA;AAEA,IAAA,MAAMC,aAAa,CAACL,KAAAA,GAAAA;AAClB,QAAA,IAAI,CAACxB,QAAAA,IAAY,CAACwB,KAAAA,CAAMM,IAAI,EAAE;AAC5B,YAAA;AACF,QAAA;QAEA,MAAMC,MAAAA,GAASC,kBAAkBrB,aAAAA,EAAe;YAC9CsB,OAAAA,EAAS/B,UAAAA,CAAWf,OAAO,IAAI+C,SAAAA;AAC/BC,YAAAA,MAAAA,EAAQV,MAAAA,CAAOD,KAAAA,CAAMM,IAAI,CAACd,EAAE,CAAA;YAC5BoB,QAAAA,EAAUZ,KAAAA,CAAMM,IAAI,CAACO,IAAI;YACzBC,OAAAA,EAASd,KAAAA,CAAMe,KAAK,CAACC,CAAC;AACtBxC,YAAAA;AACF,SAAA,CAAA;AAEA,QAAA,IAAI+B,UAAUlB,UAAAA,IAAc,CAAClB,QAAQkB,UAAAA,CAAW4B,IAAI,EAAEV,MAAAA,CAAAA,EAAS;YAC7DjC,YAAAA,CAAa,IAAA,CAAA;AACbb,YAAAA,gBAAAA,EAAAA;AACA,YAAA;AACF,QAAA;QAEAa,YAAAA,CAAaiC,MAAAA,CAAAA;QAEb,IAAIA,MAAAA,EAAQW,SAAS,MAAA,IAAUlD,SAAAA,CAAUmD,GAAG,CAACZ,MAAAA,CAAO/C,QAAQ,CAAA,EAAG;AAC7DK,YAAAA,kBAAAA,CAAmB0C,OAAO/C,QAAQ,CAAA;QACpC,CAAA,MAAO;AACLC,YAAAA,gBAAAA,EAAAA;AACF,QAAA;AACF,IAAA,CAAA;AAEA,IAAA,MAAM2C,SAAAA,GAAY,IAAA;AAChB3C,QAAAA,gBAAAA,EAAAA;QACAgB,WAAAA,CAAY,IAAA,CAAA;QACZH,YAAAA,CAAa,IAAA,CAAA;AACf,IAAA,CAAA;AAEA,IAAA,MAAM8C,SAAAA,GAAY,IAAA;AAChB,QAAA,IAAInD,QAAAA,EAAU;AACZ,YAAA;AACF,QAAA;AAEA,QAAA,MAAMsB,IAAAA,GAAOF,UAAAA;AACb,QAAA,MAAMkB,MAAAA,GAASlC,SAAAA;AAEf+B,QAAAA,SAAAA,EAAAA;QAEA,IAAI,CAACb,IAAAA,IAAQ,CAACgB,MAAAA,EAAQ;AACpB,YAAA;AACF,QAAA;QAEArC,MAAAA,CAAOqB,IAAAA,CAAK0B,IAAI,EAAEV,MAAAA,CAAAA;AACpB,IAAA,CAAA;AAEA,IAAA,MAAMc,WACJhD,SAAAA,EAAW6C,IAAAA,KAAS,QAAA,IAAY7C,SAAAA,CAAUiD,IAAI,GAC1C;AAAE,QAAA,GAAGjD,UAAUiD,IAAI;AAAEC,QAAAA,KAAAA,EAAOlD,UAAUkD;KAAM,GAC5C,IAAA;IAEN,MAAMC,YAAAA,GAAenD,SAAAA,EAAW6C,IAAAA,KAAS,MAAA,GAAS,CAAC,OAAO,EAAE7C,SAAAA,CAAUb,QAAQ,CAAA,CAAE,GAAG,IAAA;AAEnF,IAAA,MAAMiE,kBAAmC,IAAM,IAAA;IAE/C,OAAO;AACL9C,QAAAA,kBAAAA;AACA8C,QAAAA,eAAAA;AACAtC,QAAAA,aAAAA;AACAqC,QAAAA,YAAAA;AACAnC,QAAAA,UAAAA;AACAgC,QAAAA,QAAAA;AACA5B,QAAAA,OAAAA;AACAU,QAAAA,YAAAA;AACAJ,QAAAA,WAAAA;AACAM,QAAAA,UAAAA;AACAe,QAAAA;AACF,KAAA;AACF;;;;"}

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

@@ -0,0 +1,176 @@
+'use strict';
+
+var contentStructure = require('../../DataManager/utils/contentStructure.js');
+
+function buildSectionTree(section, links, compareTitle) {
+    const groups = section.groups;
+    const groupById = new Map(groups.map((group)=>[
+            group.id,
+            group
+        ]));
+    const linkByUid = new Map(links.map((link)=>[
+            link.uid,
+            link
+        ]));
+    const childGroupIds = new Set();
+    for (const group of groups){
+        for (const child of group.children){
+            if (child.type === 'group') {
+                childGroupIds.add(child.id);
+            }
+        }
+    }
+    const grouped = new Set();
+    const buildFolder = (group, depth)=>{
+        const children = [];
+        for (const child of group.children){
+            if (child.type === 'group') {
+                const subGroup = groupById.get(child.id);
+                if (!subGroup) {
+                    continue;
+                }
+                children.push(buildFolder(subGroup, depth + 1));
+                continue;
+            }
+            const link = linkByUid.get(child.uid);
+            if (!link) {
+                continue;
+            }
+            grouped.add(child.uid);
+            children.push({
+                type: 'contentType',
+                status: link.status,
+                parentId: group.id,
+                title: link.title,
+                depth: depth + 1,
+                uid: link.uid,
+                to: link.to
+            });
+        }
+        return {
+            type: 'folder',
+            parentId: group.parent,
+            status: group.status,
+            name: group.name,
+            id: group.id,
+            children,
+            depth
+        };
+    };
+    const rootFolders = groups.filter((group)=>!childGroupIds.has(group.id)).map((group)=>buildFolder(group, 0));
+    const ungrouped = links.filter((link)=>!grouped.has(link.uid)).sort((a, b)=>compareTitle(a.title, b.title)).map((link)=>({
+            type: 'contentType',
+            status: link.status,
+            title: link.title,
+            parentId: null,
+            uid: link.uid,
+            to: link.to,
+            depth: 0
+        }));
+    return [
+        ...ungrouped,
+        ...rootFolders
+    ];
+}
+function filterTree(nodes, matches) {
+    const result = [];
+    for (const node of nodes){
+        if (node.type === 'contentType') {
+            if (matches(node.title) || matches(node.uid)) {
+                result.push(node);
+            }
+            continue;
+        }
+        if (matches(node.name)) {
+            result.push(node);
+            continue;
+        }
+        const filteredChildren = filterTree(node.children, matches);
+        if (filteredChildren.length > 0) {
+            result.push({
+                ...node,
+                children: filteredChildren
+            });
+        }
+    }
+    return result;
+}
+function subtreeFolderHeight(folder) {
+    let deepestChild = 0;
+    for (const child of folder.children){
+        if (child.type === 'folder') {
+            deepestChild = Math.max(deepestChild, subtreeFolderHeight(child));
+        }
+    }
+    return 1 + deepestChild;
+}
+/**
+ * Whether moving `folder` under a target (a folder, or `null` for the section
+ * root) would keep the resulting subtree within {@link MAX_FOLDER_DEPTH}.
+ */ function canNestFolderAt(folder, target) {
+    const targetDomainDepth = target ? target.depth + 1 : 0;
+    const deepestResult = targetDomainDepth + subtreeFolderHeight(folder);
+    return deepestResult <= contentStructure.MAX_FOLDER_DEPTH;
+}
+function countSubtree(section, folderId, countableUids) {
+    const groupById = new Map(section.groups.map((group)=>[
+            group.id,
+            group
+        ]));
+    let contentTypes = 0;
+    let subfolders = 0;
+    const walk = (group)=>{
+        for (const child of group.children){
+            if (child.type === 'contentType') {
+                if (countableUids.has(child.uid)) {
+                    contentTypes += 1;
+                }
+                continue;
+            }
+            const childGroup = groupById.get(child.id);
+            if (!childGroup) {
+                continue;
+            }
+            subfolders += 1;
+            walk(childGroup);
+        }
+    };
+    const root = groupById.get(folderId);
+    if (root) {
+        walk(root);
+    }
+    return {
+        contentTypes,
+        subfolders
+    };
+}
+function collectSubtreeContentTypeUids(section, folderId) {
+    const groupById = new Map(section.groups.map((group)=>[
+            group.id,
+            group
+        ]));
+    const uids = [];
+    const walk = (id)=>{
+        const group = groupById.get(id);
+        if (!group) {
+            return;
+        }
+        for (const child of group.children){
+            if (child.type === 'contentType') {
+                uids.push(child.uid);
+                continue;
+            }
+            walk(child.id);
+        }
+    };
+    walk(folderId);
+    return uids;
+}
+
+exports.buildSectionTree = buildSectionTree;
+exports.canNestFolderAt = canNestFolderAt;
+exports.collectSubtreeContentTypeUids = collectSubtreeContentTypeUids;
+exports.countSubtree = countSubtree;
+exports.filterTree = filterTree;
+exports.subtreeFolderHeight = subtreeFolderHeight;
+//# sourceMappingURL=buildFolderTree.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"buildFolderTree.js","sources":["../../../../../admin/src/components/ContentTypeBuilderNav/lib/buildFolderTree.ts"],"sourcesContent":["import { MAX_FOLDER_DEPTH } from '../../DataManager/utils/contentStructure';\n\nimport type { Status } from '../../../types';\nimport type {\n  ContentStructureSection,\n  GroupStatus,\n} from '../../DataManager/utils/contentStructure';\nimport type { UID } from '@strapi/types';\n\nexport type ContentTypeLink = {\n  uid: UID.ContentType;\n  to: string;\n  title: string;\n  status: Status;\n};\n\nexport type FolderNode = {\n  type: 'folder';\n  id: string;\n  name: string;\n  status: GroupStatus;\n  depth: number;\n  parentId: string | null;\n  children: FolderTreeNode[];\n};\n\nexport type ContentTypeNode = {\n  type: 'contentType';\n  uid: UID.ContentType;\n  to: string;\n  title: string;\n  status: Status;\n  depth: number;\n  parentId: string | null;\n};\n\nexport type FolderTreeNode = FolderNode | ContentTypeNode;\n\nexport function buildSectionTree(\n  section: ContentStructureSection,\n  links: ContentTypeLink[],\n  compareTitle: (a: string, b: string) => number\n): FolderTreeNode[] {\n  const groups = section.groups;\n\n  const groupById = new Map(groups.map((group) => [group.id, group]));\n  const linkByUid = new Map(links.map((link) => [link.uid, link]));\n\n  const childGroupIds = new Set<string>();\n\n  for (const group of groups) {\n    for (const child of group.children) {\n      if (child.type === 'group') {\n        childGroupIds.add(child.id);\n      }\n    }\n  }\n\n  const grouped = new Set<UID.ContentType>();\n\n  const buildFolder = (\n    group: ContentStructureSection['groups'][number],\n    depth: number\n  ): FolderNode => {\n    const children: FolderTreeNode[] = [];\n\n    for (const child of group.children) {\n      if (child.type === 'group') {\n        const subGroup = groupById.get(child.id);\n\n        if (!subGroup) {\n          continue;\n        }\n\n        children.push(buildFolder(subGroup, depth + 1));\n        continue;\n      }\n\n      const link = linkByUid.get(child.uid);\n\n      if (!link) {\n        continue;\n      }\n\n      grouped.add(child.uid);\n\n      children.push({\n        type: 'contentType',\n        status: link.status,\n        parentId: group.id,\n        title: link.title,\n        depth: depth + 1,\n        uid: link.uid,\n        to: link.to,\n      });\n    }\n\n    return {\n      type: 'folder',\n      parentId: group.parent,\n      status: group.status,\n      name: group.name,\n      id: group.id,\n      children,\n      depth,\n    };\n  };\n\n  const rootFolders = groups\n    .filter((group) => !childGroupIds.has(group.id))\n    .map((group) => buildFolder(group, 0));\n\n  const ungrouped = links\n    .filter((link) => !grouped.has(link.uid))\n    .sort((a, b) => compareTitle(a.title, b.title))\n    .map(\n      (link): ContentTypeNode => ({\n        type: 'contentType',\n        status: link.status,\n        title: link.title,\n        parentId: null,\n        uid: link.uid,\n        to: link.to,\n        depth: 0,\n      })\n    );\n\n  return [...ungrouped, ...rootFolders];\n}\n\nexport function filterTree(\n  nodes: FolderTreeNode[],\n  matches: (text: string) => boolean\n): FolderTreeNode[] {\n  const result: FolderTreeNode[] = [];\n\n  for (const node of nodes) {\n    if (node.type === 'contentType') {\n      if (matches(node.title) || matches(node.uid)) {\n        result.push(node);\n      }\n\n      continue;\n    }\n\n    if (matches(node.name)) {\n      result.push(node);\n      continue;\n    }\n\n    const filteredChildren = filterTree(node.children, matches);\n\n    if (filteredChildren.length > 0) {\n      result.push({ ...node, children: filteredChildren });\n    }\n  }\n\n  return result;\n}\n\nexport function subtreeFolderHeight(folder: FolderNode): number {\n  let deepestChild = 0;\n\n  for (const child of folder.children) {\n    if (child.type === 'folder') {\n      deepestChild = Math.max(deepestChild, subtreeFolderHeight(child));\n    }\n  }\n\n  return 1 + deepestChild;\n}\n\n/**\n * Whether moving `folder` under a target (a folder, or `null` for the section\n * root) would keep the resulting subtree within {@link MAX_FOLDER_DEPTH}.\n */\nexport function canNestFolderAt(folder: FolderNode, target: FolderNode | null): boolean {\n  const targetDomainDepth = target ? target.depth + 1 : 0;\n  const deepestResult = targetDomainDepth + subtreeFolderHeight(folder);\n\n  return deepestResult <= MAX_FOLDER_DEPTH;\n}\n\nexport function countSubtree(\n  section: ContentStructureSection,\n  folderId: string,\n  countableUids: ReadonlySet<UID.ContentType>\n): { contentTypes: number; subfolders: number } {\n  const groupById = new Map(section.groups.map((group) => [group.id, group]));\n\n  let contentTypes = 0;\n  let subfolders = 0;\n\n  const walk = (group: ContentStructureSection['groups'][number]) => {\n    for (const child of group.children) {\n      if (child.type === 'contentType') {\n        if (countableUids.has(child.uid)) {\n          contentTypes += 1;\n        }\n\n        continue;\n      }\n\n      const childGroup = groupById.get(child.id);\n\n      if (!childGroup) {\n        continue;\n      }\n\n      subfolders += 1;\n      walk(childGroup);\n    }\n  };\n\n  const root = groupById.get(folderId);\n\n  if (root) {\n    walk(root);\n  }\n\n  return { contentTypes, subfolders };\n}\n\nexport function collectSubtreeContentTypeUids(\n  section: ContentStructureSection,\n  folderId: string\n): UID.ContentType[] {\n  const groupById = new Map(section.groups.map((group) => [group.id, group]));\n  const uids: UID.ContentType[] = [];\n\n  const walk = (id: string) => {\n    const group = groupById.get(id);\n\n    if (!group) {\n      return;\n    }\n\n    for (const child of group.children) {\n      if (child.type === 'contentType') {\n        uids.push(child.uid);\n        continue;\n      }\n\n      walk(child.id);\n    }\n  };\n\n  walk(folderId);\n\n  return uids;\n}\n\nexport function indexFolders(nodes: FolderTreeNode[]): Map<string, FolderNode> {\n  const index = new Map<string, FolderNode>();\n\n  const walk = (node: FolderTreeNode) => {\n    if (node.type !== 'folder') {\n      return;\n    }\n\n    index.set(node.id, node);\n    node.children.forEach(walk);\n  };\n\n  nodes.forEach(walk);\n\n  return index;\n}\n"],"names":["buildSectionTree","section","links","compareTitle","groups","groupById","Map","map","group","id","linkByUid","link","uid","childGroupIds","Set","child","children","type","add","grouped","buildFolder","depth","subGroup","get","push","status","parentId","title","to","parent","name","rootFolders","filter","has","ungrouped","sort","a","b","filterTree","nodes","matches","result","node","filteredChildren","length","subtreeFolderHeight","folder","deepestChild","Math","max","canNestFolderAt","target","targetDomainDepth","deepestResult","MAX_FOLDER_DEPTH","countSubtree","folderId","countableUids","contentTypes","subfolders","walk","childGroup","root","collectSubtreeContentTypeUids","uids"],"mappings":";;;;AAsCO,SAASA,gBAAAA,CACdC,OAAgC,EAChCC,KAAwB,EACxBC,YAA8C,EAAA;IAE9C,MAAMC,MAAAA,GAASH,QAAQG,MAAM;AAE7B,IAAA,MAAMC,YAAY,IAAIC,GAAAA,CAAIF,OAAOG,GAAG,CAAC,CAACC,KAAAA,GAAU;AAACA,YAAAA,KAAAA,CAAMC,EAAE;AAAED,YAAAA;AAAM,SAAA,CAAA,CAAA;AACjE,IAAA,MAAME,YAAY,IAAIJ,GAAAA,CAAIJ,MAAMK,GAAG,CAAC,CAACI,IAAAA,GAAS;AAACA,YAAAA,IAAAA,CAAKC,GAAG;AAAED,YAAAA;AAAK,SAAA,CAAA,CAAA;AAE9D,IAAA,MAAME,gBAAgB,IAAIC,GAAAA,EAAAA;IAE1B,KAAK,MAAMN,SAASJ,MAAAA,CAAQ;AAC1B,QAAA,KAAK,MAAMW,KAAAA,IAASP,KAAAA,CAAMQ,QAAQ,CAAE;YAClC,IAAID,KAAAA,CAAME,IAAI,KAAK,OAAA,EAAS;gBAC1BJ,aAAAA,CAAcK,GAAG,CAACH,KAAAA,CAAMN,EAAE,CAAA;AAC5B,YAAA;AACF,QAAA;AACF,IAAA;AAEA,IAAA,MAAMU,UAAU,IAAIL,GAAAA,EAAAA;IAEpB,MAAMM,WAAAA,GAAc,CAClBZ,KAAAA,EACAa,KAAAA,GAAAA;AAEA,QAAA,MAAML,WAA6B,EAAE;AAErC,QAAA,KAAK,MAAMD,KAAAA,IAASP,KAAAA,CAAMQ,QAAQ,CAAE;YAClC,IAAID,KAAAA,CAAME,IAAI,KAAK,OAAA,EAAS;AAC1B,gBAAA,MAAMK,QAAAA,GAAWjB,SAAAA,CAAUkB,GAAG,CAACR,MAAMN,EAAE,CAAA;AAEvC,gBAAA,IAAI,CAACa,QAAAA,EAAU;AACb,oBAAA;AACF,gBAAA;AAEAN,gBAAAA,QAAAA,CAASQ,IAAI,CAACJ,WAAAA,CAAYE,QAAAA,EAAUD,KAAAA,GAAQ,CAAA,CAAA,CAAA;AAC5C,gBAAA;AACF,YAAA;AAEA,YAAA,MAAMV,IAAAA,GAAOD,SAAAA,CAAUa,GAAG,CAACR,MAAMH,GAAG,CAAA;AAEpC,YAAA,IAAI,CAACD,IAAAA,EAAM;AACT,gBAAA;AACF,YAAA;YAEAQ,OAAAA,CAAQD,GAAG,CAACH,KAAAA,CAAMH,GAAG,CAAA;AAErBI,YAAAA,QAAAA,CAASQ,IAAI,CAAC;gBACZP,IAAAA,EAAM,aAAA;AACNQ,gBAAAA,MAAAA,EAAQd,KAAKc,MAAM;AACnBC,gBAAAA,QAAAA,EAAUlB,MAAMC,EAAE;AAClBkB,gBAAAA,KAAAA,EAAOhB,KAAKgB,KAAK;AACjBN,gBAAAA,KAAAA,EAAOA,KAAAA,GAAQ,CAAA;AACfT,gBAAAA,GAAAA,EAAKD,KAAKC,GAAG;AACbgB,gBAAAA,EAAAA,EAAIjB,KAAKiB;AACX,aAAA,CAAA;AACF,QAAA;QAEA,OAAO;YACLX,IAAAA,EAAM,QAAA;AACNS,YAAAA,QAAAA,EAAUlB,MAAMqB,MAAM;AACtBJ,YAAAA,MAAAA,EAAQjB,MAAMiB,MAAM;AACpBK,YAAAA,IAAAA,EAAMtB,MAAMsB,IAAI;AAChBrB,YAAAA,EAAAA,EAAID,MAAMC,EAAE;AACZO,YAAAA,QAAAA;AACAK,YAAAA;AACF,SAAA;AACF,IAAA,CAAA;AAEA,IAAA,MAAMU,cAAc3B,MAAAA,CACjB4B,MAAM,CAAC,CAACxB,KAAAA,GAAU,CAACK,aAAAA,CAAcoB,GAAG,CAACzB,KAAAA,CAAMC,EAAE,CAAA,CAAA,CAC7CF,GAAG,CAAC,CAACC,KAAAA,GAAUY,YAAYZ,KAAAA,EAAO,CAAA,CAAA,CAAA;AAErC,IAAA,MAAM0B,SAAAA,GAAYhC,KAAAA,CACf8B,MAAM,CAAC,CAACrB,IAAAA,GAAS,CAACQ,OAAAA,CAAQc,GAAG,CAACtB,IAAAA,CAAKC,GAAG,CAAA,CAAA,CACtCuB,IAAI,CAAC,CAACC,CAAAA,EAAGC,CAAAA,GAAMlC,YAAAA,CAAaiC,CAAAA,CAAET,KAAK,EAAEU,CAAAA,CAAEV,KAAK,CAAA,CAAA,CAC5CpB,GAAG,CACF,CAACI,QAA2B;YAC1BM,IAAAA,EAAM,aAAA;AACNQ,YAAAA,MAAAA,EAAQd,KAAKc,MAAM;AACnBE,YAAAA,KAAAA,EAAOhB,KAAKgB,KAAK;YACjBD,QAAAA,EAAU,IAAA;AACVd,YAAAA,GAAAA,EAAKD,KAAKC,GAAG;AACbgB,YAAAA,EAAAA,EAAIjB,KAAKiB,EAAE;YACXP,KAAAA,EAAO;SACT,CAAA,CAAA;IAGJ,OAAO;AAAIa,QAAAA,GAAAA,SAAAA;AAAcH,QAAAA,GAAAA;AAAY,KAAA;AACvC;AAEO,SAASO,UAAAA,CACdC,KAAuB,EACvBC,OAAkC,EAAA;AAElC,IAAA,MAAMC,SAA2B,EAAE;IAEnC,KAAK,MAAMC,QAAQH,KAAAA,CAAO;QACxB,IAAIG,IAAAA,CAAKzB,IAAI,KAAK,aAAA,EAAe;AAC/B,YAAA,IAAIuB,QAAQE,IAAAA,CAAKf,KAAK,KAAKa,OAAAA,CAAQE,IAAAA,CAAK9B,GAAG,CAAA,EAAG;AAC5C6B,gBAAAA,MAAAA,CAAOjB,IAAI,CAACkB,IAAAA,CAAAA;AACd,YAAA;AAEA,YAAA;AACF,QAAA;QAEA,IAAIF,OAAAA,CAAQE,IAAAA,CAAKZ,IAAI,CAAA,EAAG;AACtBW,YAAAA,MAAAA,CAAOjB,IAAI,CAACkB,IAAAA,CAAAA;AACZ,YAAA;AACF,QAAA;AAEA,QAAA,MAAMC,gBAAAA,GAAmBL,UAAAA,CAAWI,IAAAA,CAAK1B,QAAQ,EAAEwB,OAAAA,CAAAA;QAEnD,IAAIG,gBAAAA,CAAiBC,MAAM,GAAG,CAAA,EAAG;AAC/BH,YAAAA,MAAAA,CAAOjB,IAAI,CAAC;AAAE,gBAAA,GAAGkB,IAAI;gBAAE1B,QAAAA,EAAU2B;AAAiB,aAAA,CAAA;AACpD,QAAA;AACF,IAAA;IAEA,OAAOF,MAAAA;AACT;AAEO,SAASI,oBAAoBC,MAAkB,EAAA;AACpD,IAAA,IAAIC,YAAAA,GAAe,CAAA;AAEnB,IAAA,KAAK,MAAMhC,KAAAA,IAAS+B,MAAAA,CAAO9B,QAAQ,CAAE;QACnC,IAAID,KAAAA,CAAME,IAAI,KAAK,QAAA,EAAU;AAC3B8B,YAAAA,YAAAA,GAAeC,IAAAA,CAAKC,GAAG,CAACF,YAAAA,EAAcF,mBAAAA,CAAoB9B,KAAAA,CAAAA,CAAAA;AAC5D,QAAA;AACF,IAAA;AAEA,IAAA,OAAO,CAAA,GAAIgC,YAAAA;AACb;AAEA;;;AAGC,IACM,SAASG,eAAAA,CAAgBJ,MAAkB,EAAEK,MAAyB,EAAA;AAC3E,IAAA,MAAMC,iBAAAA,GAAoBD,MAAAA,GAASA,MAAAA,CAAO9B,KAAK,GAAG,CAAA,GAAI,CAAA;IACtD,MAAMgC,aAAAA,GAAgBD,oBAAoBP,mBAAAA,CAAoBC,MAAAA,CAAAA;AAE9D,IAAA,OAAOO,aAAAA,IAAiBC,iCAAAA;AAC1B;AAEO,SAASC,YAAAA,CACdtD,OAAgC,EAChCuD,QAAgB,EAChBC,aAA2C,EAAA;IAE3C,MAAMpD,SAAAA,GAAY,IAAIC,GAAAA,CAAIL,OAAAA,CAAQG,MAAM,CAACG,GAAG,CAAC,CAACC,KAAAA,GAAU;AAACA,YAAAA,KAAAA,CAAMC,EAAE;AAAED,YAAAA;AAAM,SAAA,CAAA,CAAA;AAEzE,IAAA,IAAIkD,YAAAA,GAAe,CAAA;AACnB,IAAA,IAAIC,UAAAA,GAAa,CAAA;AAEjB,IAAA,MAAMC,OAAO,CAACpD,KAAAA,GAAAA;AACZ,QAAA,KAAK,MAAMO,KAAAA,IAASP,KAAAA,CAAMQ,QAAQ,CAAE;YAClC,IAAID,KAAAA,CAAME,IAAI,KAAK,aAAA,EAAe;AAChC,gBAAA,IAAIwC,aAAAA,CAAcxB,GAAG,CAAClB,KAAAA,CAAMH,GAAG,CAAA,EAAG;oBAChC8C,YAAAA,IAAgB,CAAA;AAClB,gBAAA;AAEA,gBAAA;AACF,YAAA;AAEA,YAAA,MAAMG,UAAAA,GAAaxD,SAAAA,CAAUkB,GAAG,CAACR,MAAMN,EAAE,CAAA;AAEzC,YAAA,IAAI,CAACoD,UAAAA,EAAY;AACf,gBAAA;AACF,YAAA;YAEAF,UAAAA,IAAc,CAAA;YACdC,IAAAA,CAAKC,UAAAA,CAAAA;AACP,QAAA;AACF,IAAA,CAAA;IAEA,MAAMC,IAAAA,GAAOzD,SAAAA,CAAUkB,GAAG,CAACiC,QAAAA,CAAAA;AAE3B,IAAA,IAAIM,IAAAA,EAAM;QACRF,IAAAA,CAAKE,IAAAA,CAAAA;AACP,IAAA;IAEA,OAAO;AAAEJ,QAAAA,YAAAA;AAAcC,QAAAA;AAAW,KAAA;AACpC;AAEO,SAASI,6BAAAA,CACd9D,OAAgC,EAChCuD,QAAgB,EAAA;IAEhB,MAAMnD,SAAAA,GAAY,IAAIC,GAAAA,CAAIL,OAAAA,CAAQG,MAAM,CAACG,GAAG,CAAC,CAACC,KAAAA,GAAU;AAACA,YAAAA,KAAAA,CAAMC,EAAE;AAAED,YAAAA;AAAM,SAAA,CAAA,CAAA;AACzE,IAAA,MAAMwD,OAA0B,EAAE;AAElC,IAAA,MAAMJ,OAAO,CAACnD,EAAAA,GAAAA;QACZ,MAAMD,KAAAA,GAAQH,SAAAA,CAAUkB,GAAG,CAACd,EAAAA,CAAAA;AAE5B,QAAA,IAAI,CAACD,KAAAA,EAAO;AACV,YAAA;AACF,QAAA;AAEA,QAAA,KAAK,MAAMO,KAAAA,IAASP,KAAAA,CAAMQ,QAAQ,CAAE;YAClC,IAAID,KAAAA,CAAME,IAAI,KAAK,aAAA,EAAe;gBAChC+C,IAAAA,CAAKxC,IAAI,CAACT,KAAAA,CAAMH,GAAG,CAAA;AACnB,gBAAA;AACF,YAAA;AAEAgD,YAAAA,IAAAA,CAAK7C,MAAMN,EAAE,CAAA;AACf,QAAA;AACF,IAAA,CAAA;IAEAmD,IAAAA,CAAKJ,QAAAA,CAAAA;IAEL,OAAOQ,IAAAA;AACT;;;;;;;;;"}

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

@@ -0,0 +1,169 @@
+import { MAX_FOLDER_DEPTH } from '../../DataManager/utils/contentStructure.mjs';
+
+function buildSectionTree(section, links, compareTitle) {
+    const groups = section.groups;
+    const groupById = new Map(groups.map((group)=>[
+            group.id,
+            group
+        ]));
+    const linkByUid = new Map(links.map((link)=>[
+            link.uid,
+            link
+        ]));
+    const childGroupIds = new Set();
+    for (const group of groups){
+        for (const child of group.children){
+            if (child.type === 'group') {
+                childGroupIds.add(child.id);
+            }
+        }
+    }
+    const grouped = new Set();
+    const buildFolder = (group, depth)=>{
+        const children = [];
+        for (const child of group.children){
+            if (child.type === 'group') {
+                const subGroup = groupById.get(child.id);
+                if (!subGroup) {
+                    continue;
+                }
+                children.push(buildFolder(subGroup, depth + 1));
+                continue;
+            }
+            const link = linkByUid.get(child.uid);
+            if (!link) {
+                continue;
+            }
+            grouped.add(child.uid);
+            children.push({
+                type: 'contentType',
+                status: link.status,
+                parentId: group.id,
+                title: link.title,
+                depth: depth + 1,
+                uid: link.uid,
+                to: link.to
+            });
+        }
+        return {
+            type: 'folder',
+            parentId: group.parent,
+            status: group.status,
+            name: group.name,
+            id: group.id,
+            children,
+            depth
+        };
+    };
+    const rootFolders = groups.filter((group)=>!childGroupIds.has(group.id)).map((group)=>buildFolder(group, 0));
+    const ungrouped = links.filter((link)=>!grouped.has(link.uid)).sort((a, b)=>compareTitle(a.title, b.title)).map((link)=>({
+            type: 'contentType',
+            status: link.status,
+            title: link.title,
+            parentId: null,
+            uid: link.uid,
+            to: link.to,
+            depth: 0
+        }));
+    return [
+        ...ungrouped,
+        ...rootFolders
+    ];
+}
+function filterTree(nodes, matches) {
+    const result = [];
+    for (const node of nodes){
+        if (node.type === 'contentType') {
+            if (matches(node.title) || matches(node.uid)) {
+                result.push(node);
+            }
+            continue;
+        }
+        if (matches(node.name)) {
+            result.push(node);
+            continue;
+        }
+        const filteredChildren = filterTree(node.children, matches);
+        if (filteredChildren.length > 0) {
+            result.push({
+                ...node,
+                children: filteredChildren
+            });
+        }
+    }
+    return result;
+}
+function subtreeFolderHeight(folder) {
+    let deepestChild = 0;
+    for (const child of folder.children){
+        if (child.type === 'folder') {
+            deepestChild = Math.max(deepestChild, subtreeFolderHeight(child));
+        }
+    }
+    return 1 + deepestChild;
+}
+/**
+ * Whether moving `folder` under a target (a folder, or `null` for the section
+ * root) would keep the resulting subtree within {@link MAX_FOLDER_DEPTH}.
+ */ function canNestFolderAt(folder, target) {
+    const targetDomainDepth = target ? target.depth + 1 : 0;
+    const deepestResult = targetDomainDepth + subtreeFolderHeight(folder);
+    return deepestResult <= MAX_FOLDER_DEPTH;
+}
+function countSubtree(section, folderId, countableUids) {
+    const groupById = new Map(section.groups.map((group)=>[
+            group.id,
+            group
+        ]));
+    let contentTypes = 0;
+    let subfolders = 0;
+    const walk = (group)=>{
+        for (const child of group.children){
+            if (child.type === 'contentType') {
+                if (countableUids.has(child.uid)) {
+                    contentTypes += 1;
+                }
+                continue;
+            }
+            const childGroup = groupById.get(child.id);
+            if (!childGroup) {
+                continue;
+            }
+            subfolders += 1;
+            walk(childGroup);
+        }
+    };
+    const root = groupById.get(folderId);
+    if (root) {
+        walk(root);
+    }
+    return {
+        contentTypes,
+        subfolders
+    };
+}
+function collectSubtreeContentTypeUids(section, folderId) {
+    const groupById = new Map(section.groups.map((group)=>[
+            group.id,
+            group
+        ]));
+    const uids = [];
+    const walk = (id)=>{
+        const group = groupById.get(id);
+        if (!group) {
+            return;
+        }
+        for (const child of group.children){
+            if (child.type === 'contentType') {
+                uids.push(child.uid);
+                continue;
+            }
+            walk(child.id);
+        }
+    };
+    walk(folderId);
+    return uids;
+}
+
+export { buildSectionTree, canNestFolderAt, collectSubtreeContentTypeUids, countSubtree, filterTree, subtreeFolderHeight };
+//# sourceMappingURL=buildFolderTree.mjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"buildFolderTree.mjs","sources":["../../../../../admin/src/components/ContentTypeBuilderNav/lib/buildFolderTree.ts"],"sourcesContent":["import { MAX_FOLDER_DEPTH } from '../../DataManager/utils/contentStructure';\n\nimport type { Status } from '../../../types';\nimport type {\n  ContentStructureSection,\n  GroupStatus,\n} from '../../DataManager/utils/contentStructure';\nimport type { UID } from '@strapi/types';\n\nexport type ContentTypeLink = {\n  uid: UID.ContentType;\n  to: string;\n  title: string;\n  status: Status;\n};\n\nexport type FolderNode = {\n  type: 'folder';\n  id: string;\n  name: string;\n  status: GroupStatus;\n  depth: number;\n  parentId: string | null;\n  children: FolderTreeNode[];\n};\n\nexport type ContentTypeNode = {\n  type: 'contentType';\n  uid: UID.ContentType;\n  to: string;\n  title: string;\n  status: Status;\n  depth: number;\n  parentId: string | null;\n};\n\nexport type FolderTreeNode = FolderNode | ContentTypeNode;\n\nexport function buildSectionTree(\n  section: ContentStructureSection,\n  links: ContentTypeLink[],\n  compareTitle: (a: string, b: string) => number\n): FolderTreeNode[] {\n  const groups = section.groups;\n\n  const groupById = new Map(groups.map((group) => [group.id, group]));\n  const linkByUid = new Map(links.map((link) => [link.uid, link]));\n\n  const childGroupIds = new Set<string>();\n\n  for (const group of groups) {\n    for (const child of group.children) {\n      if (child.type === 'group') {\n        childGroupIds.add(child.id);\n      }\n    }\n  }\n\n  const grouped = new Set<UID.ContentType>();\n\n  const buildFolder = (\n    group: ContentStructureSection['groups'][number],\n    depth: number\n  ): FolderNode => {\n    const children: FolderTreeNode[] = [];\n\n    for (const child of group.children) {\n      if (child.type === 'group') {\n        const subGroup = groupById.get(child.id);\n\n        if (!subGroup) {\n          continue;\n        }\n\n        children.push(buildFolder(subGroup, depth + 1));\n        continue;\n      }\n\n      const link = linkByUid.get(child.uid);\n\n      if (!link) {\n        continue;\n      }\n\n      grouped.add(child.uid);\n\n      children.push({\n        type: 'contentType',\n        status: link.status,\n        parentId: group.id,\n        title: link.title,\n        depth: depth + 1,\n        uid: link.uid,\n        to: link.to,\n      });\n    }\n\n    return {\n      type: 'folder',\n      parentId: group.parent,\n      status: group.status,\n      name: group.name,\n      id: group.id,\n      children,\n      depth,\n    };\n  };\n\n  const rootFolders = groups\n    .filter((group) => !childGroupIds.has(group.id))\n    .map((group) => buildFolder(group, 0));\n\n  const ungrouped = links\n    .filter((link) => !grouped.has(link.uid))\n    .sort((a, b) => compareTitle(a.title, b.title))\n    .map(\n      (link): ContentTypeNode => ({\n        type: 'contentType',\n        status: link.status,\n        title: link.title,\n        parentId: null,\n        uid: link.uid,\n        to: link.to,\n        depth: 0,\n      })\n    );\n\n  return [...ungrouped, ...rootFolders];\n}\n\nexport function filterTree(\n  nodes: FolderTreeNode[],\n  matches: (text: string) => boolean\n): FolderTreeNode[] {\n  const result: FolderTreeNode[] = [];\n\n  for (const node of nodes) {\n    if (node.type === 'contentType') {\n      if (matches(node.title) || matches(node.uid)) {\n        result.push(node);\n      }\n\n      continue;\n    }\n\n    if (matches(node.name)) {\n      result.push(node);\n      continue;\n    }\n\n    const filteredChildren = filterTree(node.children, matches);\n\n    if (filteredChildren.length > 0) {\n      result.push({ ...node, children: filteredChildren });\n    }\n  }\n\n  return result;\n}\n\nexport function subtreeFolderHeight(folder: FolderNode): number {\n  let deepestChild = 0;\n\n  for (const child of folder.children) {\n    if (child.type === 'folder') {\n      deepestChild = Math.max(deepestChild, subtreeFolderHeight(child));\n    }\n  }\n\n  return 1 + deepestChild;\n}\n\n/**\n * Whether moving `folder` under a target (a folder, or `null` for the section\n * root) would keep the resulting subtree within {@link MAX_FOLDER_DEPTH}.\n */\nexport function canNestFolderAt(folder: FolderNode, target: FolderNode | null): boolean {\n  const targetDomainDepth = target ? target.depth + 1 : 0;\n  const deepestResult = targetDomainDepth + subtreeFolderHeight(folder);\n\n  return deepestResult <= MAX_FOLDER_DEPTH;\n}\n\nexport function countSubtree(\n  section: ContentStructureSection,\n  folderId: string,\n  countableUids: ReadonlySet<UID.ContentType>\n): { contentTypes: number; subfolders: number } {\n  const groupById = new Map(section.groups.map((group) => [group.id, group]));\n\n  let contentTypes = 0;\n  let subfolders = 0;\n\n  const walk = (group: ContentStructureSection['groups'][number]) => {\n    for (const child of group.children) {\n      if (child.type === 'contentType') {\n        if (countableUids.has(child.uid)) {\n          contentTypes += 1;\n        }\n\n        continue;\n      }\n\n      const childGroup = groupById.get(child.id);\n\n      if (!childGroup) {\n        continue;\n      }\n\n      subfolders += 1;\n      walk(childGroup);\n    }\n  };\n\n  const root = groupById.get(folderId);\n\n  if (root) {\n    walk(root);\n  }\n\n  return { contentTypes, subfolders };\n}\n\nexport function collectSubtreeContentTypeUids(\n  section: ContentStructureSection,\n  folderId: string\n): UID.ContentType[] {\n  const groupById = new Map(section.groups.map((group) => [group.id, group]));\n  const uids: UID.ContentType[] = [];\n\n  const walk = (id: string) => {\n    const group = groupById.get(id);\n\n    if (!group) {\n      return;\n    }\n\n    for (const child of group.children) {\n      if (child.type === 'contentType') {\n        uids.push(child.uid);\n        continue;\n      }\n\n      walk(child.id);\n    }\n  };\n\n  walk(folderId);\n\n  return uids;\n}\n\nexport function indexFolders(nodes: FolderTreeNode[]): Map<string, FolderNode> {\n  const index = new Map<string, FolderNode>();\n\n  const walk = (node: FolderTreeNode) => {\n    if (node.type !== 'folder') {\n      return;\n    }\n\n    index.set(node.id, node);\n    node.children.forEach(walk);\n  };\n\n  nodes.forEach(walk);\n\n  return index;\n}\n"],"names":["buildSectionTree","section","links","compareTitle","groups","groupById","Map","map","group","id","linkByUid","link","uid","childGroupIds","Set","child","children","type","add","grouped","buildFolder","depth","subGroup","get","push","status","parentId","title","to","parent","name","rootFolders","filter","has","ungrouped","sort","a","b","filterTree","nodes","matches","result","node","filteredChildren","length","subtreeFolderHeight","folder","deepestChild","Math","max","canNestFolderAt","target","targetDomainDepth","deepestResult","MAX_FOLDER_DEPTH","countSubtree","folderId","countableUids","contentTypes","subfolders","walk","childGroup","root","collectSubtreeContentTypeUids","uids"],"mappings":";;AAsCO,SAASA,gBAAAA,CACdC,OAAgC,EAChCC,KAAwB,EACxBC,YAA8C,EAAA;IAE9C,MAAMC,MAAAA,GAASH,QAAQG,MAAM;AAE7B,IAAA,MAAMC,YAAY,IAAIC,GAAAA,CAAIF,OAAOG,GAAG,CAAC,CAACC,KAAAA,GAAU;AAACA,YAAAA,KAAAA,CAAMC,EAAE;AAAED,YAAAA;AAAM,SAAA,CAAA,CAAA;AACjE,IAAA,MAAME,YAAY,IAAIJ,GAAAA,CAAIJ,MAAMK,GAAG,CAAC,CAACI,IAAAA,GAAS;AAACA,YAAAA,IAAAA,CAAKC,GAAG;AAAED,YAAAA;AAAK,SAAA,CAAA,CAAA;AAE9D,IAAA,MAAME,gBAAgB,IAAIC,GAAAA,EAAAA;IAE1B,KAAK,MAAMN,SAASJ,MAAAA,CAAQ;AAC1B,QAAA,KAAK,MAAMW,KAAAA,IAASP,KAAAA,CAAMQ,QAAQ,CAAE;YAClC,IAAID,KAAAA,CAAME,IAAI,KAAK,OAAA,EAAS;gBAC1BJ,aAAAA,CAAcK,GAAG,CAACH,KAAAA,CAAMN,EAAE,CAAA;AAC5B,YAAA;AACF,QAAA;AACF,IAAA;AAEA,IAAA,MAAMU,UAAU,IAAIL,GAAAA,EAAAA;IAEpB,MAAMM,WAAAA,GAAc,CAClBZ,KAAAA,EACAa,KAAAA,GAAAA;AAEA,QAAA,MAAML,WAA6B,EAAE;AAErC,QAAA,KAAK,MAAMD,KAAAA,IAASP,KAAAA,CAAMQ,QAAQ,CAAE;YAClC,IAAID,KAAAA,CAAME,IAAI,KAAK,OAAA,EAAS;AAC1B,gBAAA,MAAMK,QAAAA,GAAWjB,SAAAA,CAAUkB,GAAG,CAACR,MAAMN,EAAE,CAAA;AAEvC,gBAAA,IAAI,CAACa,QAAAA,EAAU;AACb,oBAAA;AACF,gBAAA;AAEAN,gBAAAA,QAAAA,CAASQ,IAAI,CAACJ,WAAAA,CAAYE,QAAAA,EAAUD,KAAAA,GAAQ,CAAA,CAAA,CAAA;AAC5C,gBAAA;AACF,YAAA;AAEA,YAAA,MAAMV,IAAAA,GAAOD,SAAAA,CAAUa,GAAG,CAACR,MAAMH,GAAG,CAAA;AAEpC,YAAA,IAAI,CAACD,IAAAA,EAAM;AACT,gBAAA;AACF,YAAA;YAEAQ,OAAAA,CAAQD,GAAG,CAACH,KAAAA,CAAMH,GAAG,CAAA;AAErBI,YAAAA,QAAAA,CAASQ,IAAI,CAAC;gBACZP,IAAAA,EAAM,aAAA;AACNQ,gBAAAA,MAAAA,EAAQd,KAAKc,MAAM;AACnBC,gBAAAA,QAAAA,EAAUlB,MAAMC,EAAE;AAClBkB,gBAAAA,KAAAA,EAAOhB,KAAKgB,KAAK;AACjBN,gBAAAA,KAAAA,EAAOA,KAAAA,GAAQ,CAAA;AACfT,gBAAAA,GAAAA,EAAKD,KAAKC,GAAG;AACbgB,gBAAAA,EAAAA,EAAIjB,KAAKiB;AACX,aAAA,CAAA;AACF,QAAA;QAEA,OAAO;YACLX,IAAAA,EAAM,QAAA;AACNS,YAAAA,QAAAA,EAAUlB,MAAMqB,MAAM;AACtBJ,YAAAA,MAAAA,EAAQjB,MAAMiB,MAAM;AACpBK,YAAAA,IAAAA,EAAMtB,MAAMsB,IAAI;AAChBrB,YAAAA,EAAAA,EAAID,MAAMC,EAAE;AACZO,YAAAA,QAAAA;AACAK,YAAAA;AACF,SAAA;AACF,IAAA,CAAA;AAEA,IAAA,MAAMU,cAAc3B,MAAAA,CACjB4B,MAAM,CAAC,CAACxB,KAAAA,GAAU,CAACK,aAAAA,CAAcoB,GAAG,CAACzB,KAAAA,CAAMC,EAAE,CAAA,CAAA,CAC7CF,GAAG,CAAC,CAACC,KAAAA,GAAUY,YAAYZ,KAAAA,EAAO,CAAA,CAAA,CAAA;AAErC,IAAA,MAAM0B,SAAAA,GAAYhC,KAAAA,CACf8B,MAAM,CAAC,CAACrB,IAAAA,GAAS,CAACQ,OAAAA,CAAQc,GAAG,CAACtB,IAAAA,CAAKC,GAAG,CAAA,CAAA,CACtCuB,IAAI,CAAC,CAACC,CAAAA,EAAGC,CAAAA,GAAMlC,YAAAA,CAAaiC,CAAAA,CAAET,KAAK,EAAEU,CAAAA,CAAEV,KAAK,CAAA,CAAA,CAC5CpB,GAAG,CACF,CAACI,QAA2B;YAC1BM,IAAAA,EAAM,aAAA;AACNQ,YAAAA,MAAAA,EAAQd,KAAKc,MAAM;AACnBE,YAAAA,KAAAA,EAAOhB,KAAKgB,KAAK;YACjBD,QAAAA,EAAU,IAAA;AACVd,YAAAA,GAAAA,EAAKD,KAAKC,GAAG;AACbgB,YAAAA,EAAAA,EAAIjB,KAAKiB,EAAE;YACXP,KAAAA,EAAO;SACT,CAAA,CAAA;IAGJ,OAAO;AAAIa,QAAAA,GAAAA,SAAAA;AAAcH,QAAAA,GAAAA;AAAY,KAAA;AACvC;AAEO,SAASO,UAAAA,CACdC,KAAuB,EACvBC,OAAkC,EAAA;AAElC,IAAA,MAAMC,SAA2B,EAAE;IAEnC,KAAK,MAAMC,QAAQH,KAAAA,CAAO;QACxB,IAAIG,IAAAA,CAAKzB,IAAI,KAAK,aAAA,EAAe;AAC/B,YAAA,IAAIuB,QAAQE,IAAAA,CAAKf,KAAK,KAAKa,OAAAA,CAAQE,IAAAA,CAAK9B,GAAG,CAAA,EAAG;AAC5C6B,gBAAAA,MAAAA,CAAOjB,IAAI,CAACkB,IAAAA,CAAAA;AACd,YAAA;AAEA,YAAA;AACF,QAAA;QAEA,IAAIF,OAAAA,CAAQE,IAAAA,CAAKZ,IAAI,CAAA,EAAG;AACtBW,YAAAA,MAAAA,CAAOjB,IAAI,CAACkB,IAAAA,CAAAA;AACZ,YAAA;AACF,QAAA;AAEA,QAAA,MAAMC,gBAAAA,GAAmBL,UAAAA,CAAWI,IAAAA,CAAK1B,QAAQ,EAAEwB,OAAAA,CAAAA;QAEnD,IAAIG,gBAAAA,CAAiBC,MAAM,GAAG,CAAA,EAAG;AAC/BH,YAAAA,MAAAA,CAAOjB,IAAI,CAAC;AAAE,gBAAA,GAAGkB,IAAI;gBAAE1B,QAAAA,EAAU2B;AAAiB,aAAA,CAAA;AACpD,QAAA;AACF,IAAA;IAEA,OAAOF,MAAAA;AACT;AAEO,SAASI,oBAAoBC,MAAkB,EAAA;AACpD,IAAA,IAAIC,YAAAA,GAAe,CAAA;AAEnB,IAAA,KAAK,MAAMhC,KAAAA,IAAS+B,MAAAA,CAAO9B,QAAQ,CAAE;QACnC,IAAID,KAAAA,CAAME,IAAI,KAAK,QAAA,EAAU;AAC3B8B,YAAAA,YAAAA,GAAeC,IAAAA,CAAKC,GAAG,CAACF,YAAAA,EAAcF,mBAAAA,CAAoB9B,KAAAA,CAAAA,CAAAA;AAC5D,QAAA;AACF,IAAA;AAEA,IAAA,OAAO,CAAA,GAAIgC,YAAAA;AACb;AAEA;;;AAGC,IACM,SAASG,eAAAA,CAAgBJ,MAAkB,EAAEK,MAAyB,EAAA;AAC3E,IAAA,MAAMC,iBAAAA,GAAoBD,MAAAA,GAASA,MAAAA,CAAO9B,KAAK,GAAG,CAAA,GAAI,CAAA;IACtD,MAAMgC,aAAAA,GAAgBD,oBAAoBP,mBAAAA,CAAoBC,MAAAA,CAAAA;AAE9D,IAAA,OAAOO,aAAAA,IAAiBC,gBAAAA;AAC1B;AAEO,SAASC,YAAAA,CACdtD,OAAgC,EAChCuD,QAAgB,EAChBC,aAA2C,EAAA;IAE3C,MAAMpD,SAAAA,GAAY,IAAIC,GAAAA,CAAIL,OAAAA,CAAQG,MAAM,CAACG,GAAG,CAAC,CAACC,KAAAA,GAAU;AAACA,YAAAA,KAAAA,CAAMC,EAAE;AAAED,YAAAA;AAAM,SAAA,CAAA,CAAA;AAEzE,IAAA,IAAIkD,YAAAA,GAAe,CAAA;AACnB,IAAA,IAAIC,UAAAA,GAAa,CAAA;AAEjB,IAAA,MAAMC,OAAO,CAACpD,KAAAA,GAAAA;AACZ,QAAA,KAAK,MAAMO,KAAAA,IAASP,KAAAA,CAAMQ,QAAQ,CAAE;YAClC,IAAID,KAAAA,CAAME,IAAI,KAAK,aAAA,EAAe;AAChC,gBAAA,IAAIwC,aAAAA,CAAcxB,GAAG,CAAClB,KAAAA,CAAMH,GAAG,CAAA,EAAG;oBAChC8C,YAAAA,IAAgB,CAAA;AAClB,gBAAA;AAEA,gBAAA;AACF,YAAA;AAEA,YAAA,MAAMG,UAAAA,GAAaxD,SAAAA,CAAUkB,GAAG,CAACR,MAAMN,EAAE,CAAA;AAEzC,YAAA,IAAI,CAACoD,UAAAA,EAAY;AACf,gBAAA;AACF,YAAA;YAEAF,UAAAA,IAAc,CAAA;YACdC,IAAAA,CAAKC,UAAAA,CAAAA;AACP,QAAA;AACF,IAAA,CAAA;IAEA,MAAMC,IAAAA,GAAOzD,SAAAA,CAAUkB,GAAG,CAACiC,QAAAA,CAAAA;AAE3B,IAAA,IAAIM,IAAAA,EAAM;QACRF,IAAAA,CAAKE,IAAAA,CAAAA;AACP,IAAA;IAEA,OAAO;AAAEJ,QAAAA,YAAAA;AAAcC,QAAAA;AAAW,KAAA;AACpC;AAEO,SAASI,6BAAAA,CACd9D,OAAgC,EAChCuD,QAAgB,EAAA;IAEhB,MAAMnD,SAAAA,GAAY,IAAIC,GAAAA,CAAIL,OAAAA,CAAQG,MAAM,CAACG,GAAG,CAAC,CAACC,KAAAA,GAAU;AAACA,YAAAA,KAAAA,CAAMC,EAAE;AAAED,YAAAA;AAAM,SAAA,CAAA,CAAA;AACzE,IAAA,MAAMwD,OAA0B,EAAE;AAElC,IAAA,MAAMJ,OAAO,CAACnD,EAAAA,GAAAA;QACZ,MAAMD,KAAAA,GAAQH,SAAAA,CAAUkB,GAAG,CAACd,EAAAA,CAAAA;AAE5B,QAAA,IAAI,CAACD,KAAAA,EAAO;AACV,YAAA;AACF,QAAA;AAEA,QAAA,KAAK,MAAMO,KAAAA,IAASP,KAAAA,CAAMQ,QAAQ,CAAE;YAClC,IAAID,KAAAA,CAAME,IAAI,KAAK,aAAA,EAAe;gBAChC+C,IAAAA,CAAKxC,IAAI,CAACT,KAAAA,CAAMH,GAAG,CAAA;AACnB,gBAAA;AACF,YAAA;AAEAgD,YAAAA,IAAAA,CAAK7C,MAAMN,EAAE,CAAA;AACf,QAAA;AACF,IAAA,CAAA;IAEAmD,IAAAA,CAAKJ,QAAAA,CAAAA;IAEL,OAAOQ,IAAAA;AACT;;;;"}