@dextinity/cms-admin 2.0.0-canary-20260729062014

package/lib/pages/pageTree/treemap/TreeMapUtils.js

@@ -0,0 +1,236 @@
+function _typeof(o) { "@babel/helpers - typeof"; return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o; }, _typeof(o); }
+function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
+function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
+function _defineProperty(e, r, t) { return (r = _toPropertyKey(r)) in e ? Object.defineProperty(e, r, { value: t, enumerable: !0, configurable: !0, writable: !0 }) : e[r] = t, e; }
+function _toConsumableArray(r) { return _arrayWithoutHoles(r) || _iterableToArray(r) || _unsupportedIterableToArray(r) || _nonIterableSpread(); }
+function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
+function _unsupportedIterableToArray(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }
+function _iterableToArray(r) { if ("undefined" != typeof Symbol && null != r[Symbol.iterator] || null != r["@@iterator"]) return Array.from(r); }
+function _arrayWithoutHoles(r) { if (Array.isArray(r)) return _arrayLikeToArray(r); }
+function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
+function _defineProperties(e, r) { for (var t = 0; t < r.length; t++) { var o = r[t]; o.enumerable = o.enumerable || !1, o.configurable = !0, "value" in o && (o.writable = !0), Object.defineProperty(e, _toPropertyKey(o.key), o); } }
+function _createClass(e, r, t) { return r && _defineProperties(e.prototype, r), t && _defineProperties(e, t), Object.defineProperty(e, "prototype", { writable: !1 }), e; }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == _typeof(i) ? i : i + ""; }
+function _toPrimitive(t, r) { if ("object" != _typeof(t) || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != _typeof(i)) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
+function _classCallCheck(a, n) { if (!(a instanceof n)) throw new TypeError("Cannot call a class as a function"); }
+function _callSuper(t, o, e) { return o = _getPrototypeOf(o), _possibleConstructorReturn(t, _isNativeReflectConstruct() ? Reflect.construct(o, e || [], _getPrototypeOf(t).constructor) : o.apply(t, e)); }
+function _possibleConstructorReturn(t, e) { if (e && ("object" == _typeof(e) || "function" == typeof e)) return e; if (void 0 !== e) throw new TypeError("Derived constructors may only return object or undefined"); return _assertThisInitialized(t); }
+function _assertThisInitialized(e) { if (void 0 === e) throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); return e; }
+function _inherits(t, e) { if ("function" != typeof e && null !== e) throw new TypeError("Super expression must either be null or a function"); t.prototype = Object.create(e && e.prototype, { constructor: { value: t, writable: !0, configurable: !0 } }), Object.defineProperty(t, "prototype", { writable: !1 }), e && _setPrototypeOf(t, e); }
+function _wrapNativeSuper(t) { var r = "function" == typeof Map ? new Map() : void 0; return _wrapNativeSuper = function _wrapNativeSuper(t) { if (null === t || !_isNativeFunction(t)) return t; if ("function" != typeof t) throw new TypeError("Super expression must either be null or a function"); if (void 0 !== r) { if (r.has(t)) return r.get(t); r.set(t, Wrapper); } function Wrapper() { return _construct(t, arguments, _getPrototypeOf(this).constructor); } return Wrapper.prototype = Object.create(t.prototype, { constructor: { value: Wrapper, enumerable: !1, writable: !0, configurable: !0 } }), _setPrototypeOf(Wrapper, t); }, _wrapNativeSuper(t); }
+function _construct(t, e, r) { if (_isNativeReflectConstruct()) return Reflect.construct.apply(null, arguments); var o = [null]; o.push.apply(o, e); var p = new (t.bind.apply(t, o))(); return r && _setPrototypeOf(p, r.prototype), p; }
+function _isNativeReflectConstruct() { try { var t = !Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); } catch (t) {} return (_isNativeReflectConstruct = function _isNativeReflectConstruct() { return !!t; })(); }
+function _isNativeFunction(t) { try { return -1 !== Function.toString.call(t).indexOf("[native code]"); } catch (n) { return "function" == typeof t; } }
+function _setPrototypeOf(t, e) { return _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function (t, e) { return t.__proto__ = e, t; }, _setPrototypeOf(t, e); }
+function _getPrototypeOf(t) { return _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function (t) { return t.__proto__ || Object.getPrototypeOf(t); }, _getPrototypeOf(t); }
+/**
+ * Minimal requirements that a TreeMapNode must specify
+ */
+
+/**
+ * TreeMap is a class that can store a tree like structure in a map data structure. The root nodes are stored with in the key = "root"
+ *
+ * Sample Map Structure (key : value)
+
+ *      root: [{ id: "1", parentId: null },{ id: "2", parentId: null },{ id: "3", parentId: null }]
+ *      1: [{ id: "11", parentId: "1" },{ id: "12", parentId: "1" }, { id: "13", parentId: "1" }]
+ *      2: [{ id: "21", parentId: "2" },{ id: "22", parentId: "2" }]
+ *      3: [{ id: "31", parentId: "3" },{ id: "32", parentId: "3" },{ id: "33", parentId: "3" }]
+ *      32: "32", [{ id: "321", parentId: "32" },{ id: "322", parentId: "32" }]
+ *
+ *
+ * key: parentId
+ * value: child nodes of a node
+ *
+ */
+export var TreeMap = /*#__PURE__*/function (_Map) {
+  function TreeMap() {
+    _classCallCheck(this, TreeMap);
+    return _callSuper(this, TreeMap, arguments);
+  }
+  _inherits(TreeMap, _Map);
+  return _createClass(TreeMap);
+}(/*#__PURE__*/_wrapNativeSuper(Map));
+export var traverse = function traverse(tree, onTraverse) {
+  var traverseMode = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : "pre-order";
+  if (traverseMode === "pre-order") {
+    traversePreOrder(tree, onTraverse);
+  } else if (traverseMode === "post-order") {
+    traversePostOrder(tree, onTraverse);
+  } else {
+    throw Error("Unknown traverse mode");
+  }
+};
+export var traversePreOrder = function traversePreOrder(tree, onTraverse) {
+  var _traverse = function traverse(parentId) {
+    var level = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 1;
+    var children = tree.get(parentId) || [];
+    children.forEach(function (child) {
+      onTraverse(child, level);
+      if (tree.get(parentId)) {
+        _traverse(child.id, level + 1);
+      }
+    });
+  };
+  _traverse("root", 1);
+};
+var traversePostOrder = function traversePostOrder(tree, onTraverse) {
+  var _traverse2 = function traverse(parentId) {
+    var level = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 1;
+    var children = tree.get(parentId) || [];
+    children.forEach(function (child) {
+      if (tree.get(parentId)) {
+        _traverse2(child.id, level + 1);
+      }
+      onTraverse(child, level);
+    });
+  };
+  _traverse2("root", 1);
+};
+
+/**
+ * This functions converts an array to a TreeMap data structure
+ * @param nodes
+ */
+export var arrayToTreeMap = function arrayToTreeMap(nodes) {
+  var childrenMap = new TreeMap();
+  nodes.forEach(function (node) {
+    var parentId = node.parentId || "root";
+    var children = childrenMap.get(parentId) || [];
+    childrenMap.set(parentId, [].concat(_toConsumableArray(children), [node]));
+  });
+  return childrenMap;
+};
+
+/**
+ * This function converts a treeMap to an array
+ * @param tree tree to convert
+ * @param root Key where the root nodes are stored in
+ */
+export var treeMapToArray = function treeMapToArray(tree) {
+  var root = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : "root";
+  var _buildFlatTreeForParent = function buildFlatTreeForParent() {
+    var parentId = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : "root";
+    var nodes = tree.get(parentId) || [];
+    return nodes.reduce(function (acc, nodeData) {
+      if (parentId === root) {
+        return [].concat(_toConsumableArray(acc), [_objectSpread(_objectSpread({}, nodeData), {}, {
+          parentId: null
+        })], _toConsumableArray(_buildFlatTreeForParent(nodeData.id)));
+      } else {
+        return [].concat(_toConsumableArray(acc), [nodeData], _toConsumableArray(_buildFlatTreeForParent(nodeData.id)));
+      }
+    }, []);
+  };
+  return _buildFlatTreeForParent();
+};
+
+/**
+ * This functions returns a subtree of the tree. The new start tree will start from node
+ * @param node New subtree will start (inclusive) this node
+ * @param tree
+ */
+export var subTreeFromNode = function subTreeFromNode(node, tree) {
+  return subTreeFromId(node.id, tree);
+};
+export var subTreeFromId = function subTreeFromId(id, tree) {
+  var _subTreeForParent = function subTreeForParent(nodeId) {
+    var map = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : new TreeMap();
+    var parentId = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : "root";
+    var pageFound = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : false;
+    var children = tree.get(parentId) || [];
+    children.forEach(function (child) {
+      if (pageFound) {
+        var presentChildren = map.get(parentId);
+        if (presentChildren) {
+          map.set(parentId, [].concat(_toConsumableArray(presentChildren), [child]));
+        } else {
+          map.set(parentId, [child]);
+        }
+        _subTreeForParent(nodeId, map, child.id, true);
+      } else if (child.id === nodeId) {
+        map.set("root", [child]);
+        _subTreeForParent(nodeId, map, child.id, true);
+      } else {
+        _subTreeForParent(nodeId, map, child.id, false);
+      }
+    });
+    return map;
+  };
+  return _subTreeForParent(id);
+};
+
+/**
+ *
+ * Calculates a new subtree based on passed nodeIds. If a parent is not select, child gets attached to closest selected parent.
+ * The resulting tree is a subtree only with the passed id's
+ *
+ *
+ * SampleTree:
+ *               - 1
+ *                   - 11
+ *                   - 12
+ *                   - 13
+ *               - 2
+ *                   - 21
+ *                   - 22
+ *               - 3
+ *                   - 31
+ *                   - 32
+ *                       - 321
+ *                       - 322
+ *                   - 33
+ *
+ *
+ * Sample:
+ *
+ * subTreeFromNodes([1,2], tree)
+ *
+ * Result Tree:
+ *
+ *              - 1
+ *              - 2
+ *
+ * Sample:
+ *
+ * subTreeFromNodes([1,2], tree)
+ *
+ * Result Tree:
+ *
+ *             - 11
+ *             - 2
+ *                  - 21
+ *             - 3
+ *                  - 321
+ *
+ * @param nodeIds all nodeIds which should be in new subtree
+ * @param tree
+ */
+export var subTreeFromNodes = function subTreeFromNodes(nodeIds, tree) {
+  var _subTreeForParent2 = function subTreeForParent(nodeIds) {
+    var map = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : new TreeMap();
+    var parentId = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : "root";
+    var lastPickedParent = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : "root";
+    var level = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : "-";
+    var children = tree.get(parentId) || [];
+    children.forEach(function (child) {
+      if (nodeIds.includes(child.id)) {
+        var presentChildren = map.get(lastPickedParent);
+        if (presentChildren) {
+          map.set(lastPickedParent, [].concat(_toConsumableArray(presentChildren), [_objectSpread(_objectSpread({}, child), {}, {
+            parentId: lastPickedParent
+          })]));
+        } else {
+          map.set(lastPickedParent, [_objectSpread(_objectSpread({}, child), {}, {
+            parentId: lastPickedParent
+          })]);
+        }
+        _subTreeForParent2(nodeIds, map, child.id, child.id, "".concat(level, "-"));
+      } else {
+        _subTreeForParent2(nodeIds, map, child.id, lastPickedParent, "".concat(level, "-"));
+      }
+    });
+    return map;
+  };
+  return _subTreeForParent2(nodeIds);
+};

package/lib/pages/pageTree/useButtonHoverStates.d.ts

@@ -0,0 +1,11 @@
+import { type Dispatch, type MouseEvent, type SetStateAction } from "react";
+interface InsertInBetweenButtonHoverStatesApi {
+    top: boolean;
+    bottom: boolean;
+    setTop: Dispatch<SetStateAction<boolean>>;
+    setBottom: Dispatch<SetStateAction<boolean>>;
+    defaultHandler: Record<"mouseOverTop" | "mouseOutTop" | "mouseOverBottom" | "mouseOutBottom", (event: MouseEvent<HTMLButtonElement>) => void>;
+}
+export declare function useButtonHoverStates(): InsertInBetweenButtonHoverStatesApi;
+export {};
+//# sourceMappingURL=useButtonHoverStates.d.ts.map

package/lib/pages/pageTree/useButtonHoverStates.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"useButtonHoverStates.d.ts","sourceRoot":"","sources":["../../../src/pages/pageTree/useButtonHoverStates.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,QAAQ,EAAE,KAAK,UAAU,EAAE,KAAK,cAAc,EAAY,MAAM,OAAO,CAAC;AAEtF,UAAU,mCAAmC;IACzC,GAAG,EAAE,OAAO,CAAC;IACb,MAAM,EAAE,OAAO,CAAC;IAChB,MAAM,EAAE,QAAQ,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC;IAC1C,SAAS,EAAE,QAAQ,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC;IAC7C,cAAc,EAAE,MAAM,CAAC,cAAc,GAAG,aAAa,GAAG,iBAAiB,GAAG,gBAAgB,EAAE,CAAC,KAAK,EAAE,UAAU,CAAC,iBAAiB,CAAC,KAAK,IAAI,CAAC,CAAC;CACjJ;AAED,wBAAgB,oBAAoB,IAAI,mCAAmC,CAyB1E"}

package/lib/pages/pageTree/useButtonHoverStates.js

@@ -0,0 +1,39 @@
+function _slicedToArray(r, e) { return _arrayWithHoles(r) || _iterableToArrayLimit(r, e) || _unsupportedIterableToArray(r, e) || _nonIterableRest(); }
+function _nonIterableRest() { throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
+function _unsupportedIterableToArray(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }
+function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
+function _iterableToArrayLimit(r, l) { var t = null == r ? null : "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (null != t) { var e, n, i, u, a = [], f = !0, o = !1; try { if (i = (t = t.call(r)).next, 0 === l) { if (Object(t) !== t) return; f = !1; } else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0); } catch (r) { o = !0, n = r; } finally { try { if (!f && null != t["return"] && (u = t["return"](), Object(u) !== u)) return; } finally { if (o) throw n; } } return a; } }
+function _arrayWithHoles(r) { if (Array.isArray(r)) return r; }
+import { useState } from "react";
+// convinience hook to have a nicer api
+export function useButtonHoverStates() {
+  var _useState = useState(false),
+    _useState2 = _slicedToArray(_useState, 2),
+    top = _useState2[0],
+    setTop = _useState2[1];
+  var _useState3 = useState(false),
+    _useState4 = _slicedToArray(_useState3, 2),
+    bottom = _useState4[0],
+    setBottom = _useState4[1];
+  var defaultHandler = {
+    mouseOverTop: function mouseOverTop() {
+      setTop(true);
+    },
+    mouseOutTop: function mouseOutTop() {
+      setTop(false);
+    },
+    mouseOverBottom: function mouseOverBottom() {
+      setBottom(true);
+    },
+    mouseOutBottom: function mouseOutBottom() {
+      setBottom(false);
+    }
+  };
+  return {
+    top: top,
+    bottom: bottom,
+    setTop: setTop,
+    setBottom: setBottom,
+    defaultHandler: defaultHandler
+  };
+}

package/lib/pages/pageTree/useCopyPastePages/createInboxFolder.d.ts

@@ -0,0 +1,10 @@
+import { type ApolloClient } from "@apollo/client";
+export declare const createInboxFolder: ({ client, targetScope, sourceScopes, }: {
+    client: ApolloClient<unknown>;
+    targetScope: Record<string, unknown>;
+    sourceScopes: Record<string, unknown>[];
+}) => Promise<{
+    __typename?: "DamFolder";
+    id: string;
+}>;
+//# sourceMappingURL=createInboxFolder.d.ts.map

package/lib/pages/pageTree/useCopyPastePages/createInboxFolder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"createInboxFolder.d.ts","sourceRoot":"","sources":["../../../../src/pages/pageTree/useCopyPastePages/createInboxFolder.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,YAAY,EAAO,MAAM,gBAAgB,CAAC;AAMxD,eAAO,MAAM,iBAAiB,GAAU,wCAIrC;IACC,MAAM,EAAE,YAAY,CAAC,OAAO,CAAC,CAAC;IAC9B,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACrC,YAAY,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC;CAC3C;;;EAyBA,CAAC"}

package/lib/pages/pageTree/useCopyPastePages/createInboxFolder.generated.d.ts

@@ -0,0 +1,18 @@
+import * as Types from '../../../graphql.generated';
+export declare const namedOperations: {
+    Mutation: {
+        CreateInboxFolder: string;
+    };
+};
+export type GQLCreateInboxFolderMutationVariables = Types.Exact<{
+    input: Types.GQLCreateDamFolderInput;
+    contentScope: Types.GQLDamScopeInput;
+}>;
+export type GQLCreateInboxFolderMutation = {
+    __typename?: 'Mutation';
+    createDamFolder: {
+        __typename?: 'DamFolder';
+        id: string;
+    };
+};
+//# sourceMappingURL=createInboxFolder.generated.d.ts.map

package/lib/pages/pageTree/useCopyPastePages/createInboxFolder.generated.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"createInboxFolder.generated.d.ts","sourceRoot":"","sources":["../../../../src/pages/pageTree/useCopyPastePages/createInboxFolder.generated.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,KAAK,MAAM,4BAA4B,CAAC;AAEpD,eAAO,MAAM,eAAe;;;;CAI3B,CAAA;AACD,MAAM,MAAM,qCAAqC,GAAG,KAAK,CAAC,KAAK,CAAC;IAC9D,KAAK,EAAE,KAAK,CAAC,uBAAuB,CAAC;IACrC,YAAY,EAAE,KAAK,CAAC,gBAAgB,CAAC;CACtC,CAAC,CAAC;AAGH,MAAM,MAAM,4BAA4B,GAAG;IAAE,UAAU,CAAC,EAAE,UAAU,CAAC;IAAC,eAAe,EAAE;QAAE,UAAU,CAAC,EAAE,WAAW,CAAC;QAAC,EAAE,EAAE,MAAM,CAAA;KAAE,CAAA;CAAE,CAAC"}

package/lib/pages/pageTree/useCopyPastePages/createInboxFolder.generated.js

@@ -0,0 +1,5 @@
+export var namedOperations = {
+  Mutation: {
+    CreateInboxFolder: 'CreateInboxFolder'
+  }
+};

package/lib/pages/pageTree/useCopyPastePages/createInboxFolder.js

@@ -0,0 +1,44 @@
+var _templateObject;
+function _regenerator() { /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/babel/babel/blob/main/packages/babel-helpers/LICENSE */ var e, t, r = "function" == typeof Symbol ? Symbol : {}, n = r.iterator || "@@iterator", o = r.toStringTag || "@@toStringTag"; function i(r, n, o, i) { var c = n && n.prototype instanceof Generator ? n : Generator, u = Object.create(c.prototype); return _regeneratorDefine2(u, "_invoke", function (r, n, o) { var i, c, u, f = 0, p = o || [], y = !1, G = { p: 0, n: 0, v: e, a: d, f: d.bind(e, 4), d: function d(t, r) { return i = t, c = 0, u = e, G.n = r, a; } }; function d(r, n) { for (c = r, u = n, t = 0; !y && f && !o && t < p.length; t++) { var o, i = p[t], d = G.p, l = i[2]; r > 3 ? (o = l === n) && (u = i[(c = i[4]) ? 5 : (c = 3, 3)], i[4] = i[5] = e) : i[0] <= d && ((o = r < 2 && d < i[1]) ? (c = 0, G.v = n, G.n = i[1]) : d < l && (o = r < 3 || i[0] > n || n > l) && (i[4] = r, i[5] = n, G.n = l, c = 0)); } if (o || r > 1) return a; throw y = !0, n; } return function (o, p, l) { if (f > 1) throw TypeError("Generator is already running"); for (y && 1 === p && d(p, l), c = p, u = l; (t = c < 2 ? e : u) || !y;) { i || (c ? c < 3 ? (c > 1 && (G.n = -1), d(c, u)) : G.n = u : G.v = u); try { if (f = 2, i) { if (c || (o = "next"), t = i[o]) { if (!(t = t.call(i, u))) throw TypeError("iterator result is not an object"); if (!t.done) return t; u = t.value, c < 2 && (c = 0); } else 1 === c && (t = i["return"]) && t.call(i), c < 2 && (u = TypeError("The iterator does not provide a '" + o + "' method"), c = 1); i = e; } else if ((t = (y = G.n < 0) ? u : r.call(n, G)) !== a) break; } catch (t) { i = e, c = 1, u = t; } finally { f = 1; } } return { value: t, done: y }; }; }(r, o, i), !0), u; } var a = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} t = Object.getPrototypeOf; var c = [][n] ? t(t([][n]())) : (_regeneratorDefine2(t = {}, n, function () { return this; }), t), u = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(c); function f(e) { return Object.setPrototypeOf ? Object.setPrototypeOf(e, GeneratorFunctionPrototype) : (e.__proto__ = GeneratorFunctionPrototype, _regeneratorDefine2(e, o, "GeneratorFunction")), e.prototype = Object.create(u), e; } return GeneratorFunction.prototype = GeneratorFunctionPrototype, _regeneratorDefine2(u, "constructor", GeneratorFunctionPrototype), _regeneratorDefine2(GeneratorFunctionPrototype, "constructor", GeneratorFunction), GeneratorFunction.displayName = "GeneratorFunction", _regeneratorDefine2(GeneratorFunctionPrototype, o, "GeneratorFunction"), _regeneratorDefine2(u), _regeneratorDefine2(u, o, "Generator"), _regeneratorDefine2(u, n, function () { return this; }), _regeneratorDefine2(u, "toString", function () { return "[object Generator]"; }), (_regenerator = function _regenerator() { return { w: i, m: f }; })(); }
+function _regeneratorDefine2(e, r, n, t) { var i = Object.defineProperty; try { i({}, "", {}); } catch (e) { i = 0; } _regeneratorDefine2 = function _regeneratorDefine(e, r, n, t) { function o(r, n) { _regeneratorDefine2(e, r, function (e) { return this._invoke(r, n, e); }); } r ? i ? i(e, r, { value: n, enumerable: !t, configurable: !t, writable: !t }) : e[r] = n : (o("next", 0), o("throw", 1), o("return", 2)); }, _regeneratorDefine2(e, r, n, t); }
+function _taggedTemplateLiteral(e, t) { return t || (t = e.slice(0)), Object.freeze(Object.defineProperties(e, { raw: { value: Object.freeze(t) } })); }
+function asyncGeneratorStep(n, t, e, r, o, a, c) { try { var i = n[a](c), u = i.value; } catch (n) { return void e(n); } i.done ? t(u) : Promise.resolve(u).then(r, o); }
+function _asyncToGenerator(n) { return function () { var t = this, e = arguments; return new Promise(function (r, o) { var a = n.apply(t, e); function _next(n) { asyncGeneratorStep(a, r, o, _next, _throw, "next", n); } function _throw(n) { asyncGeneratorStep(a, r, o, _next, _throw, "throw", n); } _next(void 0); }); }; }
+import { gql } from "@apollo/client";
+import { LocalErrorScopeApolloContext } from "@dextinity/admin";
+import { format } from "date-fns";
+export var createInboxFolder = /*#__PURE__*/function () {
+  var _ref2 = _asyncToGenerator(/*#__PURE__*/_regenerator().m(function _callee(_ref) {
+    var client, targetScope, sourceScopes, scopeString, date, name, _yield$client$mutate, data;
+    return _regenerator().w(function (_context) {
+      while (1) switch (_context.n) {
+        case 0:
+          client = _ref.client, targetScope = _ref.targetScope, sourceScopes = _ref.sourceScopes;
+          scopeString = sourceScopes.length === 0 ? "unknown" : sourceScopes.map(function (scope) {
+            return Object.values(scope).join("-");
+          }).join(", ");
+          date = new Date();
+          name = "Copy from ".concat(scopeString, " ").concat(format(date, "dd.MM.yyyy"), ", ").concat(format(date, "HH:mm:ss"));
+          _context.n = 1;
+          return client.mutate({
+            mutation: gql(_templateObject || (_templateObject = _taggedTemplateLiteral(["\n            mutation CreateInboxFolder($input: CreateDamFolderInput!, $contentScope: DamScopeInput!) {\n                createDamFolder(input: $input, scope: $contentScope) {\n                    id\n                }\n            }\n        "]))),
+            variables: {
+              input: {
+                name: name,
+                isInboxFromOtherScope: true
+              },
+              contentScope: targetScope
+            },
+            context: LocalErrorScopeApolloContext
+          });
+        case 1:
+          _yield$client$mutate = _context.v;
+          data = _yield$client$mutate.data;
+          return _context.a(2, data.createDamFolder);
+      }
+    }, _callee);
+  }));
+  return function createInboxFolder(_x) {
+    return _ref2.apply(this, arguments);
+  };
+}();

package/lib/pages/pageTree/useCopyPastePages/sendPages.d.ts

@@ -0,0 +1,40 @@
+import { type ApolloClient } from "@apollo/client";
+import type { ReactNode } from "react";
+import type { ContentScope } from "../../../contentScope/Provider";
+import type { PageTreeConfig } from "../../pageTreeConfig";
+import type { PagesClipboard } from "../useCopyPastePages";
+export interface SendPagesOptions {
+    /**
+     * The position where the new page(s) should be pasted.
+     * If undefined, the page(s) are added at the very end
+     * */
+    targetPos?: number;
+    updateProgress?: (progress: number, message: ReactNode) => void;
+}
+interface SendPagesDependencies {
+    client: ApolloClient<unknown>;
+    scope: ContentScope;
+    documentTypes: PageTreeConfig["documentTypes"];
+    apiUrl: string;
+    damScope: Record<string, unknown>;
+    currentCategory: string;
+    damBasePath: string;
+}
+/**
+ * Iterates over passed pages synchronous and creates data with mutations
+ *
+ * Process:
+ *      1. find all source scopes of file dependencies, to create an dam inbox folder if needed
+ *      2. traverses the tree with top-down strategy and create page tree nodes
+ *          2a. Generate unique slug by adding "{slug}-{uniqueNumber}" to the slug
+ *          2b. Create new PageTreeNode with new name "{name} {uniqueNumber}" and new parent
+ *      3. create documents (and copy files if required) and attach them to the page tree nodes
+ *          3a. Copy all files used on page to target scope
+ *          3b.  Replace unhandled dependencies with undefined (when copying to another scope)
+ *          3c. Create new document and attach it to new page tree node
+ *      4. Refetch Pages query
+ *
+ **/
+export declare function sendPages(parentId: string | null, { pages, scope: sourceContentScope }: PagesClipboard, options: SendPagesOptions, { client, scope: targetContentScope, documentTypes, apiUrl, damScope: targetDamScope, currentCategory, damBasePath }: SendPagesDependencies, updateProgress: (progress: number, message: ReactNode) => void): Promise<void>;
+export {};
+//# sourceMappingURL=sendPages.d.ts.map

package/lib/pages/pageTree/useCopyPastePages/sendPages.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sendPages.d.ts","sourceRoot":"","sources":["../../../../src/pages/pageTree/useCopyPastePages/sendPages.tsx"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,YAAY,EAAO,MAAM,gBAAgB,CAAC;AAGxD,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,OAAO,CAAC;AAKvC,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,gCAAgC,CAAC;AAGnE,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAG3D,OAAO,KAAK,EAAiB,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAkC1E,MAAM,WAAW,gBAAgB;IAC7B;;;SAGK;IACL,SAAS,CAAC,EAAE,MAAM,CAAC;IAEnB,cAAc,CAAC,EAAE,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,KAAK,IAAI,CAAC;CACnE;AAED,UAAU,qBAAqB;IAC3B,MAAM,EAAE,YAAY,CAAC,OAAO,CAAC,CAAC;IAC9B,KAAK,EAAE,YAAY,CAAC;IACpB,aAAa,EAAE,cAAc,CAAC,eAAe,CAAC,CAAC;IAC/C,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAClC,eAAe,EAAE,MAAM,CAAC;IACxB,WAAW,EAAE,MAAM,CAAC;CACvB;AAED;;;;;;;;;;;;;;IAcI;AACJ,wBAAsB,SAAS,CAC3B,QAAQ,EAAE,MAAM,GAAG,IAAI,EACvB,EAAE,KAAK,EAAE,KAAK,EAAE,kBAAkB,EAAE,EAAE,cAAc,EACpD,OAAO,EAAE,gBAAgB,EACzB,EAAE,MAAM,EAAE,KAAK,EAAE,kBAAkB,EAAE,aAAa,EAAE,MAAM,EAAE,QAAQ,EAAE,cAAc,EAAE,eAAe,EAAE,WAAW,EAAE,EAAE,qBAAqB,EAC3I,cAAc,EAAE,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,KAAK,IAAI,GAC/D,OAAO,CAAC,IAAI,CAAC,CAuOf"}

package/lib/pages/pageTree/useCopyPastePages/sendPages.generated.d.ts

@@ -0,0 +1,56 @@
+import * as Types from '../../../graphql.generated';
+export declare const namedOperations: {
+    Query: {
+        FindCopiesOfFileInScope: string;
+    };
+    Mutation: {
+        CreatePageNode: string;
+        CopyFilesToScope: string;
+    };
+};
+export type GQLCreatePageNodeMutationVariables = Types.Exact<{
+    input: Types.GQLPageTreeNodeCreateInput;
+    contentScope: Types.GQLPageTreeNodeScopeInput;
+    category: Types.Scalars['String']['input'];
+}>;
+export type GQLCreatePageNodeMutation = {
+    __typename?: 'Mutation';
+    createPageTreeNode: {
+        __typename?: 'PageTreeNode';
+        id: string;
+    };
+};
+export type GQLCopyFilesToScopeMutationVariables = Types.Exact<{
+    fileIds: Array<Types.Scalars['ID']['input']> | Types.Scalars['ID']['input'];
+    inboxFolderId: Types.Scalars['ID']['input'];
+}>;
+export type GQLCopyFilesToScopeMutation = {
+    __typename?: 'Mutation';
+    copyFilesToScope: {
+        __typename?: 'CopyFilesResponse';
+        mappedFiles: Array<{
+            __typename?: 'MappedFile';
+            rootFile: {
+                __typename?: 'DamFile';
+                id: string;
+            };
+            copy: {
+                __typename?: 'DamFile';
+                id: string;
+            };
+        }>;
+    };
+};
+export type GQLFindCopiesOfFileInScopeQueryVariables = Types.Exact<{
+    id: Types.Scalars['ID']['input'];
+    scope: Types.GQLDamScopeInput;
+    imageCropArea?: Types.InputMaybe<Types.GQLImageCropAreaInput>;
+}>;
+export type GQLFindCopiesOfFileInScopeQuery = {
+    __typename?: 'Query';
+    findCopiesOfFileInScope: Array<{
+        __typename?: 'DamFile';
+        id: string;
+    }>;
+};
+//# sourceMappingURL=sendPages.generated.d.ts.map

package/lib/pages/pageTree/useCopyPastePages/sendPages.generated.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sendPages.generated.d.ts","sourceRoot":"","sources":["../../../../src/pages/pageTree/useCopyPastePages/sendPages.generated.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,KAAK,MAAM,4BAA4B,CAAC;AAEpD,eAAO,MAAM,eAAe;;;;;;;;CAQ3B,CAAA;AACD,MAAM,MAAM,kCAAkC,GAAG,KAAK,CAAC,KAAK,CAAC;IAC3D,KAAK,EAAE,KAAK,CAAC,0BAA0B,CAAC;IACxC,YAAY,EAAE,KAAK,CAAC,yBAAyB,CAAC;IAC9C,QAAQ,EAAE,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC;CAC5C,CAAC,CAAC;AAGH,MAAM,MAAM,yBAAyB,GAAG;IAAE,UAAU,CAAC,EAAE,UAAU,CAAC;IAAC,kBAAkB,EAAE;QAAE,UAAU,CAAC,EAAE,cAAc,CAAC;QAAC,EAAE,EAAE,MAAM,CAAA;KAAE,CAAA;CAAE,CAAC;AAErI,MAAM,MAAM,oCAAoC,GAAG,KAAK,CAAC,KAAK,CAAC;IAC7D,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC;IAC5E,aAAa,EAAE,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC;CAC7C,CAAC,CAAC;AAGH,MAAM,MAAM,2BAA2B,GAAG;IAAE,UAAU,CAAC,EAAE,UAAU,CAAC;IAAC,gBAAgB,EAAE;QAAE,UAAU,CAAC,EAAE,mBAAmB,CAAC;QAAC,WAAW,EAAE,KAAK,CAAC;YAAE,UAAU,CAAC,EAAE,YAAY,CAAC;YAAC,QAAQ,EAAE;gBAAE,UAAU,CAAC,EAAE,SAAS,CAAC;gBAAC,EAAE,EAAE,MAAM,CAAA;aAAE,CAAC;YAAC,IAAI,EAAE;gBAAE,UAAU,CAAC,EAAE,SAAS,CAAC;gBAAC,EAAE,EAAE,MAAM,CAAA;aAAE,CAAA;SAAE,CAAC,CAAA;KAAE,CAAA;CAAE,CAAC;AAEjR,MAAM,MAAM,wCAAwC,GAAG,KAAK,CAAC,KAAK,CAAC;IACjE,EAAE,EAAE,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC;IACjC,KAAK,EAAE,KAAK,CAAC,gBAAgB,CAAC;IAC9B,aAAa,CAAC,EAAE,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,qBAAqB,CAAC,CAAC;CAC/D,CAAC,CAAC;AAGH,MAAM,MAAM,+BAA+B,GAAG;IAAE,UAAU,CAAC,EAAE,OAAO,CAAC;IAAC,uBAAuB,EAAE,KAAK,CAAC;QAAE,UAAU,CAAC,EAAE,SAAS,CAAC;QAAC,EAAE,EAAE,MAAM,CAAA;KAAE,CAAC,CAAA;CAAE,CAAC"}

package/lib/pages/pageTree/useCopyPastePages/sendPages.generated.js

@@ -0,0 +1,9 @@
+export var namedOperations = {
+  Query: {
+    FindCopiesOfFileInScope: 'FindCopiesOfFileInScope'
+  },
+  Mutation: {
+    CreatePageNode: 'CreatePageNode',
+    CopyFilesToScope: 'CopyFilesToScope'
+  }
+};