@sanity/hierarchical-document-list 1.1.0 → 2.0.0

package/lib/utils/treePatches.js

@@ -1,171 +0,0 @@
-"use strict";
-var __assign = (this && this.__assign) || function () {
-    __assign = Object.assign || function(t) {
-        for (var s, i = 1, n = arguments.length; i < n; i++) {
-            s = arguments[i];
-            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p))
-                t[p] = s[p];
-        }
-        return t;
-    };
-    return __assign.apply(this, arguments);
-};
-var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
-    Object.defineProperty(o, "default", { enumerable: true, value: v });
-}) : function(o, v) {
-    o["default"] = v;
-});
-var __importStar = (this && this.__importStar) || function (mod) {
-    if (mod && mod.__esModule) return mod;
-    var result = {};
-    if (mod != null) for (var k in mod) if (k !== "default" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);
-    __setModuleDefault(result, mod);
-    return result;
-};
-var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
-    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
-        if (ar || !(i in from)) {
-            if (!ar) ar = Array.prototype.slice.call(from, 0, i);
-            ar[i] = from[i];
-        }
-    }
-    return to.concat(ar || Array.prototype.slice.call(from));
-};
-var __importDefault = (this && this.__importDefault) || function (mod) {
-    return (mod && mod.__esModule) ? mod : { "default": mod };
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getMoveItemPatch = exports.getMovedNodePatch = exports.getRemoveItemPatch = exports.getDuplicateItemPatch = exports.getAddItemPatch = void 0;
-var Patch = __importStar(require("@sanity/form-builder/lib/patch/patches"));
-var content_1 = require("@sanity/util/content");
-var react_sortable_tree_1 = require("react-sortable-tree");
-var getAdjescentNodes_1 = __importDefault(require("./getAdjescentNodes"));
-var moveItemInArray_1 = __importDefault(require("./moveItemInArray"));
-var treeData_1 = require("./treeData");
-function getAddItemPatch(item) {
-    var normalizedNode = (0, treeData_1.normalizeNodeForStorage)(item);
-    return [
-        // Add the node to the end of the tree
-        Patch.insert([normalizedNode], 'after', [-1])
-    ];
-}
-exports.getAddItemPatch = getAddItemPatch;
-function getDuplicateItemPatch(nodeProps) {
-    var newItem = __assign(__assign({}, nodeProps.node), { _key: (0, content_1.randomKey)(12) });
-    var normalizedNode = (0, treeData_1.normalizeNodeForStorage)(newItem);
-    return [
-        // Add duplicated node before the existing one
-        Patch.insert([normalizedNode], 'before', [{ _key: nodeProps.node._key }])
-    ];
-}
-exports.getDuplicateItemPatch = getDuplicateItemPatch;
-function getRemoveItemPatch(_a) {
-    var node = _a.node;
-    var keyPath = { _key: node._key };
-    var children = getChildrenPaths(node);
-    return __spreadArray([
-        // 1. Unset the removed node
-        Patch.unset([keyPath])
-    ], children.map(function (path) { return Patch.unset([{ _key: path }]); }), true);
-}
-exports.getRemoveItemPatch = getRemoveItemPatch;
-function getMovedNodePatch(data) {
-    var _a, _b;
-    var nextParentNode = data.nextParentNode;
-    var keyPath = { _key: data.node._key };
-    // === REMOVING NODE FROM TREE ===
-    // `nextPath` will be null if the item is removed from tree
-    if (!Array.isArray(data.nextPath)) {
-        return getRemoveItemPatch({ node: data.node });
-    }
-    var nextFlatTree = (0, react_sortable_tree_1.getFlatDataFromTree)({
-        treeData: data.treeData,
-        getNodeKey: function (t) { return t.node._key; }
-    });
-    var normalizedNode = (0, treeData_1.normalizeNodeForStorage)(data.node);
-    var _c = (0, getAdjescentNodes_1.default)({
-        flatTree: nextFlatTree,
-        node: data.node,
-        treeIndex: data.nextTreeIndex
-    }), leadingNode = _c.leadingNode, followingNode = _c.followingNode;
-    return [
-        // 1. Unset the moved node
-        // (will be ignored by Content Lake on new nodes with _key not yet in tree)
-        Patch.unset([keyPath]),
-        // 2. SIBLING-BASED PLACEMENT
-        // If we were to place solely based on nextTreeIndex, concurrent changes from other editors could put the new node in an unexpected position.
-        // Let's instead anchor it to the _key of the sibling coming before or after it.
-        ((_a = leadingNode === null || leadingNode === void 0 ? void 0 : leadingNode.node) === null || _a === void 0 ? void 0 : _a._key)
-            ? // After the sibling before it
-                Patch.insert([normalizedNode], 'after', [{ _key: leadingNode.node._key }])
-            : // Or before the sibling right after it, in case there's no leading sibling node
-                // prettier-ignore
-                Patch.insert([normalizedNode], 'before', [((_b = followingNode === null || followingNode === void 0 ? void 0 : followingNode.node) === null || _b === void 0 ? void 0 : _b._key) ? { _key: followingNode.node._key } : data.nextTreeIndex]),
-        // 3. Patch the new node with its new `parent`
-        nextParentNode
-            ? // If it has a parent node, set that parent's _key
-                Patch.set(nextParentNode._key, [keyPath, 'parent'])
-            : // Else remove the parent key entirely
-                Patch.unset([keyPath, 'parent'])
-    ];
-}
-exports.getMovedNodePatch = getMovedNodePatch;
-function getChildrenPaths(node) {
-    if (!Array.isArray(node.children)) {
-        return [];
-    }
-    return node.children
-        .reduce(function (keyPaths, child) { return __spreadArray(__spreadArray(__spreadArray([], keyPaths, true), [child._key], false), getChildrenPaths(child), true); }, [])
-        .filter(Boolean);
-}
-function getMoveItemPatch(_a) {
-    var _b, _c;
-    var _d = _a.nodeProps, node = _d.node, treeIndex = _d.treeIndex, localTree = _a.localTree, _e = _a.direction, direction = _e === void 0 ? 'up' : _e;
-    var keyPath = { _key: node._key };
-    var nextTreeIndex = treeIndex + (direction === 'up' ? -1 : 1);
-    var flatTree = (0, react_sortable_tree_1.getFlatDataFromTree)({
-        treeData: localTree,
-        getNodeKey: function (t) { return t.node._key; }
-    });
-    var nextFlatTree = (0, moveItemInArray_1.default)({
-        array: flatTree,
-        fromIndex: treeIndex,
-        toIndex: nextTreeIndex
-    });
-    var _f = (0, getAdjescentNodes_1.default)({
-        flatTree: nextFlatTree,
-        node: node,
-        treeIndex: nextTreeIndex
-    }), leadingNode = _f.leadingNode, followingNode = _f.followingNode;
-    var normalizedNode = (0, treeData_1.normalizeNodeForStorage)(node);
-    // When moving up, look at following node to figure out what is the next parent.
-    var nodeToInheritParent = direction === 'up' ? followingNode : leadingNode;
-    var nextParentNode = nodeToInheritParent === null || nodeToInheritParent === void 0 ? void 0 : nodeToInheritParent.parentNode;
-    return [
-        // 1. Unset the moved node
-        // (will be ignored by Content Lake on new nodes with _key not yet in tree)
-        Patch.unset([keyPath]),
-        // 2. SIBLING-BASED PLACEMENT
-        ((_b = leadingNode === null || leadingNode === void 0 ? void 0 : leadingNode.node) === null || _b === void 0 ? void 0 : _b._key)
-            ? // After the sibling before it
-                Patch.insert([normalizedNode], 'after', [{ _key: leadingNode.node._key }])
-            : // Or before the sibling right after it, in case there's no leading sibling node
-                Patch.insert([normalizedNode], 'before', [
-                    ((_c = followingNode === null || followingNode === void 0 ? void 0 : followingNode.node) === null || _c === void 0 ? void 0 : _c._key) ? { _key: followingNode.node._key } : nextTreeIndex
-                ]),
-        // 3. Patch the new node with its new `parent`
-        nextParentNode
-            ? // If it has a parent node, set that parent's _key
-                Patch.set(nextParentNode._key, [keyPath, 'parent'])
-            : // Else remove the parent key entirely
-                Patch.unset([keyPath, 'parent'])
-    ];
-}
-exports.getMoveItemPatch = getMoveItemPatch;

package/lint-staged.config.js

@@ -1,4 +0,0 @@
-module.exports = {
-  '**/*.{js,jsx}': ['eslint'],
-  '**/*.{ts,tsx}': ['eslint', () => 'tsc --noEmit'],
-}

package/tsconfig.json

@@ -1,20 +0,0 @@
-{
-  "compilerOptions": {
-    "target": "es5",
-    "useDefineForClassFields": true,
-    "lib": ["DOM", "DOM.Iterable", "ESNext"],
-    "allowJs": false,
-    "skipLibCheck": true,
-    "esModuleInterop": true,
-    "allowSyntheticDefaultImports": false,
-    "strict": true,
-    "forceConsistentCasingInFileNames": true,
-    "module": "CommonJS",
-    "moduleResolution": "Node",
-    "resolveJsonModule": true,
-    "isolatedModules": true,
-    "jsx": "react-jsx",
-    "outDir": "lib"
-  },
-  "include": ["./src"]
-}