@pisell/materials 2.2.48 → 2.2.49

package/es/components/pisellDraggable/index.d.ts

@@ -0,0 +1,32 @@
+/**
+ * 可拖拽树形组件
+ * 基于@dnd-kit库实现，支持拖拽排序、展开折叠、删除等功能
+ */
+import React from 'react';
+import type { TreeItem, TreeItems } from './types';
+import type { Props as TreeItemProps } from './components/TreeItem/TreeItem';
+interface Props {
+    /** 是否支持折叠功能 */
+    collapsible?: boolean;
+    /** 初始树形数据，默认使用 initialItems */
+    value?: TreeItems;
+    /** 缩进宽度，控制子节点的缩进距离 */
+    indentationWidth?: number;
+    /** 是否显示拖拽指示器 */
+    indicator?: boolean;
+    /** 是否支持删除节点功能 */
+    removable?: boolean;
+    /** 自定义渲染树节点 */
+    renderItem?: (item: TreeItemProps, ref: React.RefObject<HTMLDivElement>) => React.ReactNode;
+    /** 树形数据变化回调 */
+    onChange?: (items: TreeItems) => void;
+    /** 删除节点前 */
+    onRemoveBefore?: (item: TreeItem) => Promise<boolean>;
+    /** 设计模式 */
+    __designMode?: string;
+    /** 最大层级 */
+    maxLevel?: number;
+}
+export declare function SortableTree({ collapsible, value, indicator, indentationWidth, removable, renderItem, onChange, onRemoveBefore, __designMode, maxLevel, }: Props): JSX.Element;
+declare const Demo: (props: Props) => JSX.Element;
+export default Demo;

package/es/components/pisellDraggable/index.js

@@ -0,0 +1,463 @@
+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 _regeneratorRuntime() { "use strict"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */ _regeneratorRuntime = function _regeneratorRuntime() { return e; }; var t, e = {}, r = Object.prototype, n = r.hasOwnProperty, o = Object.defineProperty || function (t, e, r) { t[e] = r.value; }, i = "function" == typeof Symbol ? Symbol : {}, a = i.iterator || "@@iterator", c = i.asyncIterator || "@@asyncIterator", u = i.toStringTag || "@@toStringTag"; function define(t, e, r) { return Object.defineProperty(t, e, { value: r, enumerable: !0, configurable: !0, writable: !0 }), t[e]; } try { define({}, ""); } catch (t) { define = function define(t, e, r) { return t[e] = r; }; } function wrap(t, e, r, n) { var i = e && e.prototype instanceof Generator ? e : Generator, a = Object.create(i.prototype), c = new Context(n || []); return o(a, "_invoke", { value: makeInvokeMethod(t, r, c) }), a; } function tryCatch(t, e, r) { try { return { type: "normal", arg: t.call(e, r) }; } catch (t) { return { type: "throw", arg: t }; } } e.wrap = wrap; var h = "suspendedStart", l = "suspendedYield", f = "executing", s = "completed", y = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} var p = {}; define(p, a, function () { return this; }); var d = Object.getPrototypeOf, v = d && d(d(values([]))); v && v !== r && n.call(v, a) && (p = v); var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p); function defineIteratorMethods(t) { ["next", "throw", "return"].forEach(function (e) { define(t, e, function (t) { return this._invoke(e, t); }); }); } function AsyncIterator(t, e) { function invoke(r, o, i, a) { var c = tryCatch(t[r], t, o); if ("throw" !== c.type) { var u = c.arg, h = u.value; return h && "object" == _typeof(h) && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) { invoke("next", t, i, a); }, function (t) { invoke("throw", t, i, a); }) : e.resolve(h).then(function (t) { u.value = t, i(u); }, function (t) { return invoke("throw", t, i, a); }); } a(c.arg); } var r; o(this, "_invoke", { value: function value(t, n) { function callInvokeWithMethodAndArg() { return new e(function (e, r) { invoke(t, n, e, r); }); } return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg(); } }); } function makeInvokeMethod(e, r, n) { var o = h; return function (i, a) { if (o === f) throw new Error("Generator is already running"); if (o === s) { if ("throw" === i) throw a; return { value: t, done: !0 }; } for (n.method = i, n.arg = a;;) { var c = n.delegate; if (c) { var u = maybeInvokeDelegate(c, n); if (u) { if (u === y) continue; return u; } } if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) { if (o === h) throw o = s, n.arg; n.dispatchException(n.arg); } else "return" === n.method && n.abrupt("return", n.arg); o = f; var p = tryCatch(e, r, n); if ("normal" === p.type) { if (o = n.done ? s : l, p.arg === y) continue; return { value: p.arg, done: n.done }; } "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg); } }; } function maybeInvokeDelegate(e, r) { var n = r.method, o = e.iterator[n]; if (o === t) return r.delegate = null, "throw" === n && e.iterator.return && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y; var i = tryCatch(o, e.iterator, r.arg); if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y; var a = i.arg; return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y); } function pushTryEntry(t) { var e = { tryLoc: t[0] }; 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e); } function resetTryEntry(t) { var e = t.completion || {}; e.type = "normal", delete e.arg, t.completion = e; } function Context(t) { this.tryEntries = [{ tryLoc: "root" }], t.forEach(pushTryEntry, this), this.reset(!0); } function values(e) { if (e || "" === e) { var r = e[a]; if (r) return r.call(e); if ("function" == typeof e.next) return e; if (!isNaN(e.length)) { var o = -1, i = function next() { for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next; return next.value = t, next.done = !0, next; }; return i.next = i; } } throw new TypeError(_typeof(e) + " is not iterable"); } return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", { value: GeneratorFunctionPrototype, configurable: !0 }), o(GeneratorFunctionPrototype, "constructor", { value: GeneratorFunction, configurable: !0 }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) { var e = "function" == typeof t && t.constructor; return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name)); }, e.mark = function (t) { return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t; }, e.awrap = function (t) { return { __await: t }; }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () { return this; }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) { void 0 === i && (i = Promise); var a = new AsyncIterator(wrap(t, r, n, o), i); return e.isGeneratorFunction(r) ? a : a.next().then(function (t) { return t.done ? t.value : a.next(); }); }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () { return this; }), define(g, "toString", function () { return "[object Generator]"; }), e.keys = function (t) { var e = Object(t), r = []; for (var n in e) r.push(n); return r.reverse(), function next() { for (; r.length;) { var t = r.pop(); if (t in e) return next.value = t, next.done = !1, next; } return next.done = !0, next; }; }, e.values = values, Context.prototype = { constructor: Context, reset: function reset(e) { if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t); }, stop: function stop() { this.done = !0; var t = this.tryEntries[0].completion; if ("throw" === t.type) throw t.arg; return this.rval; }, dispatchException: function dispatchException(e) { if (this.done) throw e; var r = this; function handle(n, o) { return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o; } for (var o = this.tryEntries.length - 1; o >= 0; --o) { var i = this.tryEntries[o], a = i.completion; if ("root" === i.tryLoc) return handle("end"); if (i.tryLoc <= this.prev) { var c = n.call(i, "catchLoc"), u = n.call(i, "finallyLoc"); if (c && u) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } else if (c) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); } else { if (!u) throw new Error("try statement without catch or finally"); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } } } }, abrupt: function abrupt(t, e) { for (var r = this.tryEntries.length - 1; r >= 0; --r) { var o = this.tryEntries[r]; if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) { var i = o; break; } } i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null); var a = i ? i.completion : {}; return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a); }, complete: function complete(t, e) { if ("throw" === t.type) throw t.arg; return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y; }, finish: function finish(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y; } }, catch: function _catch(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.tryLoc === t) { var n = r.completion; if ("throw" === n.type) { var o = n.arg; resetTryEntry(r); } return o; } } throw new Error("illegal catch attempt"); }, delegateYield: function delegateYield(e, r, n) { return this.delegate = { iterator: values(e), resultName: r, nextLoc: n }, "next" === this.method && (this.arg = t), y; } }, e; }
+function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) { try { var info = gen[key](arg); var value = info.value; } catch (error) { reject(error); return; } if (info.done) { resolve(value); } else { Promise.resolve(value).then(_next, _throw); } }
+function _asyncToGenerator(fn) { return function () { var self = this, args = arguments; return new Promise(function (resolve, reject) { var gen = fn.apply(self, args); function _next(value) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "next", value); } function _throw(err) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "throw", err); } _next(undefined); }); }; }
+function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _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 _iterableToArray(iter) { if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter); }
+function _arrayWithoutHoles(arr) { if (Array.isArray(arr)) return _arrayLikeToArray(arr); }
+function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _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(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
+function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }
+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(arr) { if (Array.isArray(arr)) return arr; }
+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(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == _typeof(i) ? i : String(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); }
+/**
+ * 可拖拽树形组件
+ * 基于@dnd-kit库实现，支持拖拽排序、展开折叠、删除等功能
+ */
+
+import { DndContext, DragOverlay, MeasuringStrategy, PointerSensor, closestCenter, defaultDropAnimation, useSensor, useSensors } from '@dnd-kit/core';
+import { SortableContext, arrayMove, verticalListSortingStrategy } from '@dnd-kit/sortable';
+import React, { useEffect, useMemo, useRef, useState } from 'react';
+import { createPortal } from 'react-dom';
+import { CSS } from '@dnd-kit/utilities';
+import { SortableTreeItem } from "./components";
+import { buildTree, flattenTree, getChildCount, getProjection, removeChildrenOf, removeItem, setProperty } from "./utilities";
+
+/**
+ * 初始化树形数据结构
+ * 包含了基本的导航菜单结构：首页、商品集合、关于我们、我的账户等
+ */
+var initialItems = [{
+  id: 'Home',
+  children: []
+}, {
+  id: 'Collections',
+  children: [{
+    id: 'Spring',
+    children: []
+  }, {
+    id: 'Summer',
+    children: []
+  }, {
+    id: 'Fall',
+    children: []
+  }, {
+    id: 'Winter',
+    children: [],
+    disabledDrop: true
+  }]
+}, {
+  id: 'About Us',
+  children: []
+}, {
+  id: 'My Account',
+  children: [{
+    id: 'Addresses',
+    children: []
+  }, {
+    id: 'Order History',
+    children: []
+  }]
+}];
+
+/**
+ * 测量策略配置
+ * strategy: MeasuringStrategy.Always - 始终测量可放置区域的尺寸
+ */
+var measuring = {
+  droppable: {
+    strategy: MeasuringStrategy.Always
+  }
+};
+
+/**
+ * 拖拽动画配置
+ * 定义了拖拽时的动画效果，包括透明度变化和位置移动
+ */
+var dropAnimationConfig = {
+  keyframes: function keyframes(_ref) {
+    var transform = _ref.transform;
+    return [{
+      opacity: 1,
+      transform: CSS.Transform.toString(transform.initial)
+    }, {
+      opacity: 0,
+      transform: CSS.Transform.toString(_objectSpread(_objectSpread({}, transform.final), {}, {
+        x: transform.final.x + 5,
+        y: transform.final.y + 5
+      }))
+    }];
+  },
+  easing: 'ease-out',
+  sideEffects: function sideEffects(_ref2) {
+    var active = _ref2.active;
+    active.node.animate([{
+      opacity: 0
+    }, {
+      opacity: 1
+    }], {
+      duration: defaultDropAnimation.duration,
+      easing: defaultDropAnimation.easing
+    });
+  }
+};
+export function SortableTree(_ref3) {
+  var _ref3$collapsible = _ref3.collapsible,
+    collapsible = _ref3$collapsible === void 0 ? true : _ref3$collapsible,
+    _ref3$value = _ref3.value,
+    value = _ref3$value === void 0 ? initialItems : _ref3$value,
+    _ref3$indicator = _ref3.indicator,
+    indicator = _ref3$indicator === void 0 ? false : _ref3$indicator,
+    _ref3$indentationWidt = _ref3.indentationWidth,
+    indentationWidth = _ref3$indentationWidt === void 0 ? 50 : _ref3$indentationWidt,
+    _ref3$removable = _ref3.removable,
+    removable = _ref3$removable === void 0 ? true : _ref3$removable,
+    renderItem = _ref3.renderItem,
+    onChange = _ref3.onChange,
+    onRemoveBefore = _ref3.onRemoveBefore,
+    __designMode = _ref3.__designMode,
+    _ref3$maxLevel = _ref3.maxLevel,
+    maxLevel = _ref3$maxLevel === void 0 ? 3 : _ref3$maxLevel;
+  // 状态管理
+  /** 当前树形数据 */
+  var _useState = useState([]),
+    _useState2 = _slicedToArray(_useState, 2),
+    items = _useState2[0],
+    setItems = _useState2[1];
+  /** 当前正在拖拽的节点ID */
+  var _useState3 = useState(null),
+    _useState4 = _slicedToArray(_useState3, 2),
+    activeId = _useState4[0],
+    setActiveId = _useState4[1];
+  /** 当前拖拽悬停的节点ID */
+  var _useState5 = useState(null),
+    _useState6 = _slicedToArray(_useState5, 2),
+    overId = _useState6[0],
+    setOverId = _useState6[1];
+  /** 水平偏移量，用于确定拖拽时的层级变化 */
+  var _useState7 = useState(0),
+    _useState8 = _slicedToArray(_useState7, 2),
+    offsetLeft = _useState8[0],
+    setOffsetLeft = _useState8[1];
+  useEffect(function () {
+    console.log('初始化', value);
+    setItems(value);
+  }, [value]);
+  var flattenTreeData = useMemo(function () {
+    return flattenTree(items);
+  }, [items]);
+
+  /**
+   * 扁平化处理树形数据
+   * 1. 将树形结构转换为扁平数组
+   * 2. 处理折叠状态
+   * 3. 移除被折叠节点的子节点
+   */
+  var flattenedItems = useMemo(function () {
+    var collapsedItems = flattenTreeData.reduce(function (acc, _ref4) {
+      var _ref4$children = _ref4.children,
+        children = _ref4$children === void 0 ? [] : _ref4$children,
+        collapsed = _ref4.collapsed,
+        id = _ref4.id;
+      return collapsed && children.length ? [].concat(_toConsumableArray(acc), [id]) : acc;
+    }, []);
+    return removeChildrenOf(flattenTreeData, activeId != null ? [activeId].concat(_toConsumableArray(collapsedItems)) : collapsedItems);
+  }, [activeId, flattenTreeData]);
+  console.log('flattenedItems', flattenedItems);
+  /**
+   * 计算拖拽投影
+   * 根据当前拖拽状态计算目标位置和深度
+   */
+  var projected = activeId && overId ? getProjection(flattenedItems, activeId, overId, offsetLeft, indentationWidth) : null;
+
+  /**
+   * 传感器上下文
+   * 存储扁平化的节点数据和偏移量信息
+   */
+  var sensorContext = useRef({
+    items: flattenedItems,
+    offset: offsetLeft
+  });
+  var sensors = useSensors(useSensor(PointerSensor));
+  var sortedIds = useMemo(function () {
+    return flattenedItems.map(function (_ref5) {
+      var id = _ref5.id;
+      return id;
+    });
+  }, [flattenedItems]);
+  var activeItem = activeId ? flattenedItems.find(function (_ref6) {
+    var id = _ref6.id;
+    return id === activeId;
+  }) : null;
+  useEffect(function () {
+    sensorContext.current = {
+      items: flattenedItems,
+      offset: offsetLeft
+    };
+  }, [flattenedItems, offsetLeft]);
+  useEffect(function () {
+    document.body.id = 'body';
+  }, []);
+
+  /**
+   * 检查子树是否超过最大深度限制
+   * @param items 当前项目列表
+   * @param itemId 要检查的项目ID
+   * @param baseDepth 基础深度
+   * @returns 是否超过限制
+   */
+  function checkSubtreeDepth(items, itemId, baseDepth) {
+    var item = items.find(function (i) {
+      return i.id === itemId;
+    });
+    if (!item) return false;
+
+    // 首先检查目标位置的深度
+    if (baseDepth >= maxLevel) return true;
+
+    // 获取所有子节点
+    var children = items.filter(function (i) {
+      return i.parentId === itemId;
+    });
+
+    // 如果当前节点已经是最大深度，且尝试添加子节点，则返回 true
+    if (baseDepth >= maxLevel - 1 && children.length > 0) return true;
+
+    // 递归检查所有子节点
+    return children.some(function (child) {
+      // 计算子节点在新位置的深度
+      var childNewDepth = baseDepth + 1;
+      // 如果子节点深度超过限制，或者子节点的子树超过限制，则返回 true
+      return childNewDepth >= maxLevel || checkSubtreeDepth(items, child.id, childNewDepth);
+    });
+  }
+  return /*#__PURE__*/React.createElement(DndContext, {
+    sensors: sensors,
+    collisionDetection: closestCenter,
+    measuring: measuring,
+    onDragStart: handleDragStart,
+    onDragMove: handleDragMove,
+    onDragOver: handleDragOver,
+    onDragEnd: handleDragEnd,
+    onDragCancel: handleDragCancel
+  }, /*#__PURE__*/React.createElement(SortableContext, {
+    items: sortedIds,
+    strategy: verticalListSortingStrategy
+  }, flattenedItems.map(function (item) {
+    var id = item.id,
+      children = item.children,
+      collapsed = item.collapsed,
+      depth = item.depth;
+    return /*#__PURE__*/React.createElement(SortableTreeItem, {
+      key: id,
+      id: id,
+      item: item,
+      depth: id === activeId && projected ? projected.depth : depth,
+      indentationWidth: indentationWidth,
+      indicator: indicator,
+      collapsed: Boolean(collapsed && (children === null || children === void 0 ? void 0 : children.length)),
+      onCollapse: collapsible && children !== null && children !== void 0 && children.length ? function () {
+        return handleCollapse(id);
+      } : undefined,
+      onRemove: removable ? function () {
+        return handleRemove(item);
+      } : undefined,
+      renderItem: renderItem,
+      __designMode: __designMode
+    });
+  }), /*#__PURE__*/createPortal( /*#__PURE__*/React.createElement(DragOverlay, {
+    dropAnimation: dropAnimationConfig,
+    modifiers: indicator ? [adjustTranslate] : undefined
+  }, activeId && activeItem ? /*#__PURE__*/React.createElement(SortableTreeItem, {
+    id: activeId,
+    depth: activeItem.depth,
+    clone: true,
+    childCount: getChildCount(items, activeId) + 1,
+    item: activeItem,
+    indentationWidth: indentationWidth,
+    renderItem: renderItem
+  }) : null), document.body)));
+
+  /**
+   * 处理拖拽开始事件
+   * 设置当前拖拽项和初始状态
+   */
+  function handleDragStart(_ref7) {
+    var activeId = _ref7.active.id;
+    setActiveId(activeId);
+    setOverId(activeId);
+    document.body.style.setProperty('cursor', 'grabbing');
+  }
+
+  /**
+   * 处理拖拽移动事件
+   * 更新水平偏移量
+   */
+  function handleDragMove(_ref8) {
+    var delta = _ref8.delta;
+    setOffsetLeft(delta.x);
+  }
+  function handleDragOver(_ref9) {
+    var over = _ref9.over;
+    if (!projected || !over) {
+      var _over$id;
+      setOverId((_over$id = over === null || over === void 0 ? void 0 : over.id) !== null && _over$id !== void 0 ? _over$id : null);
+      return;
+    }
+
+    // 检查目标父节点是否禁止拖入
+    var targetParent = projected.parentId ? flattenedItems.find(function (item) {
+      return item.id === projected.parentId;
+    }) : null;
+    if (targetParent !== null && targetParent !== void 0 && targetParent.disabledDrop) {
+      return;
+    }
+
+    // 检查目标深度是否超过最大层级限制
+    if (projected.depth >= maxLevel) {
+      return;
+    }
+
+    // 检查整个子树的深度是否会超过限制
+    var willExceedLimit = checkSubtreeDepth(flattenTreeData, activeId, projected.depth);
+    if (willExceedLimit) {
+      return;
+    }
+    setOverId(over.id);
+  }
+
+  /**
+   * 处理拖拽结束事件
+   * 1. 重置状态
+   * 2. 更新节点位置和层级
+   * 3. 重建树形结构
+   */
+  function handleDragEnd(_ref10) {
+    var active = _ref10.active,
+      over = _ref10.over;
+    resetState();
+    if (projected && over) {
+      var depth = projected.depth,
+        parentId = projected.parentId;
+
+      // 检查目标父节点是否禁止拖入
+      var targetParent = parentId ? flattenedItems.find(function (item) {
+        return item.id === parentId;
+      }) : null;
+      if (targetParent !== null && targetParent !== void 0 && targetParent.disabledDrop) {
+        return;
+      }
+
+      // 检查是否超过最大层级限制
+      if (depth >= maxLevel) {
+        return;
+      }
+
+      // 检查整个子树的深度是否会超过限制
+      var willExceedLimit = checkSubtreeDepth(flattenTreeData, active.id, depth);
+      if (willExceedLimit) {
+        return;
+      }
+      var clonedItems = JSON.parse(JSON.stringify(flattenTree(items)));
+      var overIndex = clonedItems.findIndex(function (_ref11) {
+        var id = _ref11.id;
+        return id === over.id;
+      });
+      var activeIndex = clonedItems.findIndex(function (_ref12) {
+        var id = _ref12.id;
+        return id === active.id;
+      });
+      var activeTreeItem = clonedItems[activeIndex];
+      clonedItems[activeIndex] = _objectSpread(_objectSpread({}, activeTreeItem), {}, {
+        depth: depth,
+        parentId: parentId
+      });
+      var sortedItems = arrayMove(clonedItems, activeIndex, overIndex);
+      var newItems = buildTree(sortedItems);
+      setItems(newItems);
+      onChange === null || onChange === void 0 || onChange(newItems);
+    }
+  }
+  function handleDragCancel() {
+    resetState();
+  }
+  function resetState() {
+    setOverId(null);
+    setActiveId(null);
+    setOffsetLeft(0);
+    document.body.style.setProperty('cursor', '');
+  }
+
+  /**
+   * 处理节点删除
+   * 从树形结构中移除指定节点
+   */
+  function handleRemove(_x) {
+    return _handleRemove.apply(this, arguments);
+  }
+  /**
+   * 处理节点折叠/展开
+   * 切换指定节点的折叠状态
+   */
+  function _handleRemove() {
+    _handleRemove = _asyncToGenerator( /*#__PURE__*/_regeneratorRuntime().mark(function _callee(item) {
+      var res;
+      return _regeneratorRuntime().wrap(function _callee$(_context) {
+        while (1) switch (_context.prev = _context.next) {
+          case 0:
+            if (!onRemoveBefore) {
+              _context.next = 6;
+              break;
+            }
+            _context.next = 3;
+            return onRemoveBefore === null || onRemoveBefore === void 0 ? void 0 : onRemoveBefore(item);
+          case 3:
+            res = _context.sent;
+            if (res) {
+              _context.next = 6;
+              break;
+            }
+            return _context.abrupt("return");
+          case 6:
+            setItems(function (items) {
+              return removeItem(items, item.id);
+            });
+            onChange === null || onChange === void 0 || onChange(items);
+          case 8:
+          case "end":
+            return _context.stop();
+        }
+      }, _callee);
+    }));
+    return _handleRemove.apply(this, arguments);
+  }
+  function handleCollapse(id) {
+    setItems(function (items) {
+      return setProperty(items, id, 'collapsed', function (value) {
+        return !value;
+      });
+    });
+  }
+}
+
+/**
+ * 调整拖拽项的位置
+ * 对拖拽时的位置进行微调，提升视觉效果
+ */
+var adjustTranslate = function adjustTranslate(_ref13) {
+  var transform = _ref13.transform;
+  return _objectSpread(_objectSpread({}, transform), {}, {
+    y: transform.y - 25
+  });
+};
+var Demo = function Demo(props) {
+  return /*#__PURE__*/React.createElement(SortableTree, props);
+};
+export default Demo;

package/es/components/pisellDraggable/types.d.ts

@@ -0,0 +1,19 @@
+import type { MutableRefObject } from 'react';
+import type { UniqueIdentifier } from '@dnd-kit/core';
+export interface TreeItem {
+    id: UniqueIdentifier;
+    children: TreeItem[];
+    collapsed?: boolean;
+    disabledDrop?: boolean;
+    [key: string]: any;
+}
+export declare type TreeItems = TreeItem[];
+export interface FlattenedItem extends TreeItem {
+    parentId: UniqueIdentifier | null;
+    depth: number;
+    index: number;
+}
+export declare type SensorContext = MutableRefObject<{
+    items: FlattenedItem[];
+    offset: number;
+}>;

package/es/components/pisellDraggable/types.js

@@ -0,0 +1 @@
+export {};

package/es/components/pisellDraggable/utilities.d.ts

@@ -0,0 +1,17 @@
+import type { UniqueIdentifier } from '@dnd-kit/core';
+import type { FlattenedItem, TreeItem, TreeItems } from './types';
+export declare const iOS: boolean;
+export declare function getProjection(items: FlattenedItem[], activeId: UniqueIdentifier, overId: UniqueIdentifier, dragOffset: number, indentationWidth: number): {
+    depth: number;
+    maxDepth: number;
+    minDepth: number;
+    parentId: UniqueIdentifier | null;
+};
+export declare function flattenTree(items: TreeItems): FlattenedItem[];
+export declare function buildTree(flattenedItems: FlattenedItem[]): TreeItems;
+export declare function findItem(items: TreeItem[], itemId: UniqueIdentifier): TreeItem | undefined;
+export declare function findItemDeep(items: TreeItems, itemId: UniqueIdentifier): TreeItem | undefined;
+export declare function removeItem(items: TreeItems, id: UniqueIdentifier): TreeItem[];
+export declare function setProperty<T extends keyof TreeItem>(items: TreeItems, id: UniqueIdentifier, property: T, setter: (value: TreeItem[T]) => TreeItem[T]): TreeItem[];
+export declare function getChildCount(items: TreeItems, id: UniqueIdentifier): number;
+export declare function removeChildrenOf(items: FlattenedItem[], ids: UniqueIdentifier[]): FlattenedItem[];