@qsxy/element-plus-react 1.0.2 → 2.0.0

package/dist/Tree/model/tree-store.js

@@ -0,0 +1,510 @@
+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 _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 _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 _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
+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 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 _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
+function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } }
+function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, "prototype", { writable: false }); return Constructor; }
+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); }
+import { isObject, isPropAbsent, nextTick } from "../../Util";
+import isEqual from 'lodash/isEqual';
+import isNil from 'lodash/isNil';
+import noop from 'lodash/noop';
+import Node from "./node";
+import { getNodeKey } from "./util";
+var TreeStore = /*#__PURE__*/function () {
+  function TreeStore(options) {
+    _classCallCheck(this, TreeStore);
+    _defineProperty(this, "currentNode", void 0);
+    _defineProperty(this, "currentNodeKey", void 0);
+    _defineProperty(this, "nodesMap", void 0);
+    _defineProperty(this, "root", void 0);
+    _defineProperty(this, "data", void 0);
+    _defineProperty(this, "lazy", false);
+    _defineProperty(this, "load", void 0);
+    _defineProperty(this, "filterNodeMethod", void 0);
+    _defineProperty(this, "key", void 0);
+    _defineProperty(this, "defaultCheckedKeys", void 0);
+    _defineProperty(this, "checkStrictly", false);
+    _defineProperty(this, "defaultExpandedKeys", void 0);
+    _defineProperty(this, "autoExpandParent", false);
+    _defineProperty(this, "defaultExpandAll", false);
+    _defineProperty(this, "checkDescendants", false);
+    _defineProperty(this, "props", void 0);
+    _defineProperty(this, "forceUpdate", void 0);
+    this.currentNode = null;
+    this.currentNodeKey = null;
+    for (var option in options) {
+      if (Object.prototype.hasOwnProperty.call(options, option)) {
+        this[option] = options[option];
+      }
+    }
+    this.nodesMap = {};
+  }
+  _createClass(TreeStore, [{
+    key: "initialize",
+    value: function initialize() {
+      var _this = this;
+      this.root = new Node({
+        data: this.data,
+        store: this
+      });
+      this.root.initialize();
+      if (this.lazy && this.load) {
+        var loadFn = this.load;
+        loadFn(this.root, function (data) {
+          _this.root.doCreateChildren(data);
+          _this._initDefaultCheckedNodes();
+          _this.forceUpdate();
+        }, noop);
+      } else {
+        this._initDefaultCheckedNodes();
+      }
+    }
+  }, {
+    key: "filter",
+    value: function filter(value) {
+      var _this2 = this;
+      var filterNodeMethod = this.filterNodeMethod;
+      var lazy = this.lazy;
+      var traverse = /*#__PURE__*/function () {
+        var _ref = _asyncToGenerator( /*#__PURE__*/_regeneratorRuntime().mark(function _callee(node) {
+          var childNodes, _iterator, _step, _step$value, index, child, allHidden;
+          return _regeneratorRuntime().wrap(function _callee$(_context) {
+            while (1) switch (_context.prev = _context.next) {
+              case 0:
+                childNodes = node.root ? node.root.childNodes : node.childNodes;
+                _iterator = _createForOfIteratorHelper(childNodes.entries());
+                _context.prev = 2;
+                _iterator.s();
+              case 4:
+                if ((_step = _iterator.n()).done) {
+                  _context.next = 14;
+                  break;
+                }
+                _step$value = _slicedToArray(_step.value, 2), index = _step$value[0], child = _step$value[1];
+                child.visible = !!(filterNodeMethod !== null && filterNodeMethod !== void 0 && filterNodeMethod.call(child, value, child.data, child));
+                if (!(index % 80 === 0 && index > 0)) {
+                  _context.next = 10;
+                  break;
+                }
+                _context.next = 10;
+                return nextTick();
+              case 10:
+                _context.next = 12;
+                return traverse(child);
+              case 12:
+                _context.next = 4;
+                break;
+              case 14:
+                _context.next = 19;
+                break;
+              case 16:
+                _context.prev = 16;
+                _context.t0 = _context["catch"](2);
+                _iterator.e(_context.t0);
+              case 19:
+                _context.prev = 19;
+                _iterator.f();
+                return _context.finish(19);
+              case 22:
+                if (!node.visible && childNodes.length) {
+                  allHidden = true;
+                  allHidden = !childNodes.some(function (child) {
+                    return child.visible;
+                  });
+                  if (node.root) {
+                    node.root.visible = allHidden === false;
+                  } else {
+                    node.visible = allHidden === false;
+                  }
+                }
+                if (value) {
+                  _context.next = 25;
+                  break;
+                }
+                return _context.abrupt("return");
+              case 25:
+                if (node.visible && !node.isLeaf) {
+                  if (!lazy || node.loaded) {
+                    node.expand();
+                  }
+                }
+              case 26:
+              case "end":
+                return _context.stop();
+            }
+          }, _callee, null, [[2, 16, 19, 22]]);
+        }));
+        return function traverse(_x) {
+          return _ref.apply(this, arguments);
+        };
+      }();
+      traverse(this).then(function () {
+        _this2.forceUpdate();
+      });
+    }
+  }, {
+    key: "setData",
+    value: function setData(newVal) {
+      var instanceChanged = !isEqual(newVal, this.root.data);
+      if (instanceChanged) {
+        this.nodesMap = {};
+        this.root.setData(newVal);
+        this._initDefaultCheckedNodes();
+        this.setCurrentNodeKey(this.currentNodeKey);
+      } else {
+        this.root.updateChildren();
+      }
+    }
+  }, {
+    key: "getNode",
+    value: function getNode(data) {
+      if (data instanceof Node) {
+        return data;
+      }
+      // @ts-ignore
+      var key = isObject(data) ? getNodeKey(this.key, data) : data;
+      return this.nodesMap[key] || null;
+    }
+  }, {
+    key: "insertBefore",
+    value: function insertBefore(data, refData) {
+      var _refNode$parent;
+      var refNode = this.getNode(refData);
+      (_refNode$parent = refNode.parent) === null || _refNode$parent === void 0 || _refNode$parent.insertBefore({
+        data: data
+      }, refNode);
+    }
+  }, {
+    key: "insertAfter",
+    value: function insertAfter(data, refData) {
+      var _refNode$parent2;
+      var refNode = this.getNode(refData);
+      (_refNode$parent2 = refNode.parent) === null || _refNode$parent2 === void 0 || _refNode$parent2.insertAfter({
+        data: data
+      }, refNode);
+    }
+  }, {
+    key: "remove",
+    value: function remove(data) {
+      var node = this.getNode(data);
+      if (node && node.parent) {
+        if (node === this.currentNode) {
+          this.currentNode = null;
+        }
+        node.parent.removeChild(node);
+      }
+    }
+  }, {
+    key: "append",
+    value: function append(data, parentData) {
+      var parentNode = !isPropAbsent(parentData) ? this.getNode(parentData) : this.root;
+      if (parentNode) {
+        parentNode.insertChild({
+          data: data
+        });
+      }
+    }
+  }, {
+    key: "_initDefaultCheckedNodes",
+    value: function _initDefaultCheckedNodes() {
+      var _this3 = this;
+      var defaultCheckedKeys = this.defaultCheckedKeys || [];
+      var nodesMap = this.nodesMap;
+      defaultCheckedKeys.forEach(function (checkedKey) {
+        var node = nodesMap[checkedKey];
+        if (node) {
+          node.setChecked(true, !_this3.checkStrictly);
+        }
+      });
+    }
+  }, {
+    key: "_initDefaultCheckedNode",
+    value: function _initDefaultCheckedNode(node) {
+      var defaultCheckedKeys = this.defaultCheckedKeys || [];
+      if (!isNil(node.key) && defaultCheckedKeys.includes(node.key)) {
+        node.setChecked(true, !this.checkStrictly);
+      }
+    }
+  }, {
+    key: "setDefaultCheckedKey",
+    value: function setDefaultCheckedKey(newVal) {
+      if (newVal !== this.defaultCheckedKeys) {
+        this.defaultCheckedKeys = newVal;
+        this._initDefaultCheckedNodes();
+      }
+    }
+  }, {
+    key: "registerNode",
+    value: function registerNode(node) {
+      var key = this.key;
+      if (!node || !node.data) {
+        return;
+      }
+      if (!key) {
+        this.nodesMap[node.id] = node;
+      } else {
+        var nodeKey = node.key;
+        if (!isNil(nodeKey)) {
+          this.nodesMap[nodeKey] = node;
+        }
+      }
+    }
+  }, {
+    key: "deregisterNode",
+    value: function deregisterNode(node) {
+      var _this4 = this;
+      var key = this.key;
+      if (!key || !node || !node.data) {
+        return;
+      }
+      node.childNodes.forEach(function (child) {
+        _this4.deregisterNode(child);
+      });
+      delete this.nodesMap[node.key];
+    }
+  }, {
+    key: "getCheckedNodes",
+    value: function getCheckedNodes() {
+      var leafOnly = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : false;
+      var includeHalfChecked = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
+      var checkedNodes = [];
+      var traverse = function traverse(node) {
+        var childNodes = node.root ? node.root.childNodes : node.childNodes;
+        childNodes.forEach(function (child) {
+          if ((child.checked || includeHalfChecked && child.indeterminate) && (!leafOnly || leafOnly && child.isLeaf)) {
+            checkedNodes.push(child.data);
+          }
+          traverse(child);
+        });
+      };
+      traverse(this);
+      return checkedNodes;
+    }
+  }, {
+    key: "getCheckedKeys",
+    value: function getCheckedKeys() {
+      var _this5 = this;
+      var leafOnly = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : false;
+      return this.getCheckedNodes(leafOnly).map(function (data) {
+        return (data || {})[_this5.key];
+      });
+    }
+  }, {
+    key: "getHalfCheckedNodes",
+    value: function getHalfCheckedNodes() {
+      var nodes = [];
+      var traverse = function traverse(node) {
+        var childNodes = node.root ? node.root.childNodes : node.childNodes;
+        childNodes.forEach(function (child) {
+          if (child.indeterminate) {
+            nodes.push(child.data);
+          }
+          traverse(child);
+        });
+      };
+      traverse(this);
+      return nodes;
+    }
+  }, {
+    key: "getHalfCheckedKeys",
+    value: function getHalfCheckedKeys() {
+      var _this6 = this;
+      return this.getHalfCheckedNodes().map(function (data) {
+        return (data || {})[_this6.key];
+      });
+    }
+  }, {
+    key: "_getAllNodes",
+    value: function _getAllNodes() {
+      var allNodes = [];
+      var nodesMap = this.nodesMap;
+      for (var nodeKey in nodesMap) {
+        if (Object.prototype.hasOwnProperty.call(nodesMap, nodeKey)) {
+          allNodes.push(nodesMap[nodeKey]);
+        }
+      }
+      return allNodes;
+    }
+  }, {
+    key: "updateChildren",
+    value: function updateChildren(key, data) {
+      var node = this.nodesMap[key];
+      if (!node) {
+        return;
+      }
+      var childNodes = node.childNodes;
+      for (var i = childNodes.length - 1; i >= 0; i--) {
+        var child = childNodes[i];
+        this.remove(child.data);
+      }
+      for (var _i = 0, j = data.length; _i < j; _i++) {
+        var _child = data[_i];
+        this.append(_child, node.data);
+      }
+    }
+  }, {
+    key: "_setCheckedKeys",
+    value: function _setCheckedKeys(key) {
+      var _this7 = this;
+      var leafOnly = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
+      var checkedKeys = arguments.length > 2 ? arguments[2] : undefined;
+      var allNodes = this._getAllNodes().sort(function (a, b) {
+        return a.level - b.level;
+      });
+      var cache = Object.create(null);
+      var keys = Object.keys(checkedKeys);
+      allNodes.forEach(function (node) {
+        return node.setChecked(false, false);
+      });
+      var cacheCheckedChild = function cacheCheckedChild(node) {
+        node.childNodes.forEach(function (child) {
+          var _child$childNodes;
+          cache[child.data[key]] = true;
+          if ((_child$childNodes = child.childNodes) !== null && _child$childNodes !== void 0 && _child$childNodes.length) {
+            cacheCheckedChild(child);
+          }
+        });
+      };
+      var _loop = function _loop() {
+          var node = allNodes[i];
+          var nodeKey = node.data[key].toString();
+          var checked = keys.includes(nodeKey);
+          if (!checked) {
+            if (node.checked && !cache[nodeKey]) {
+              node.setChecked(false, false);
+            }
+            return 0; // continue
+          }
+          if (node.childNodes.length) {
+            cacheCheckedChild(node);
+          }
+          if (node.isLeaf || _this7.checkStrictly) {
+            node.setChecked(true, false);
+            return 0; // continue
+          }
+          node.setChecked(true, true);
+          if (leafOnly) {
+            node.setChecked(false, false);
+            var traverse = function traverse(_node) {
+              var childNodes = _node.childNodes;
+              childNodes.forEach(function (child) {
+                if (!child.isLeaf) {
+                  child.setChecked(false, false);
+                }
+                traverse(child);
+              });
+            };
+            traverse(node);
+          }
+        },
+        _ret;
+      for (var i = 0, j = allNodes.length; i < j; i++) {
+        _ret = _loop();
+        if (_ret === 0) continue;
+      }
+    }
+  }, {
+    key: "setCheckedNodes",
+    value: function setCheckedNodes(array) {
+      var leafOnly = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
+      var key = this.key;
+      var checkedKeys = {};
+      array.forEach(function (item) {
+        checkedKeys[(item || {})[key]] = true;
+      });
+      this._setCheckedKeys(key, leafOnly, checkedKeys);
+    }
+  }, {
+    key: "setCheckedKeys",
+    value: function setCheckedKeys(keys) {
+      var leafOnly = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
+      this.defaultCheckedKeys = keys;
+      var key = this.key;
+      var checkedKeys = {};
+      keys.forEach(function (k) {
+        checkedKeys[k] = true;
+      });
+      this._setCheckedKeys(key, leafOnly, checkedKeys);
+    }
+  }, {
+    key: "setDefaultExpandedKeys",
+    value: function setDefaultExpandedKeys(keys) {
+      var _this8 = this;
+      keys = keys || [];
+      this.defaultExpandedKeys = keys;
+      keys.forEach(function (key) {
+        var node = _this8.getNode(key);
+        if (node) {
+          node.expand(null, _this8.autoExpandParent);
+        }
+      });
+    }
+  }, {
+    key: "setChecked",
+    value: function setChecked(data, checked, deep) {
+      var node = this.getNode(data);
+      if (node) {
+        node.setChecked(!!checked, deep);
+      }
+    }
+  }, {
+    key: "getCurrentNode",
+    value: function getCurrentNode() {
+      return this.currentNode;
+    }
+  }, {
+    key: "setCurrentNode",
+    value: function setCurrentNode(currentNode) {
+      var prevCurrentNode = this.currentNode;
+      if (prevCurrentNode) {
+        prevCurrentNode.isCurrent = false;
+      }
+      this.currentNode = currentNode;
+      this.currentNode.isCurrent = true;
+    }
+  }, {
+    key: "setUserCurrentNode",
+    value: function setUserCurrentNode(node) {
+      var shouldAutoExpandParent = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;
+      var key = node.data[this.key];
+      var currNode = this.nodesMap[key];
+      this.setCurrentNode(currNode);
+      if (shouldAutoExpandParent && this.currentNode && this.currentNode.level > 1) {
+        var _this$currentNode$par;
+        (_this$currentNode$par = this.currentNode.parent) === null || _this$currentNode$par === void 0 || _this$currentNode$par.expand(null, true);
+      }
+    }
+  }, {
+    key: "setCurrentNodeKey",
+    value: function setCurrentNodeKey(key) {
+      var shouldAutoExpandParent = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;
+      this.currentNodeKey = key;
+      if (isPropAbsent(key)) {
+        this.currentNode && (this.currentNode.isCurrent = false);
+        this.currentNode = null;
+        return;
+      }
+      var node = this.getNode(key);
+      if (node) {
+        this.setCurrentNode(node);
+        if (shouldAutoExpandParent && this.currentNode && this.currentNode.level > 1) {
+          var _this$currentNode$par2;
+          (_this$currentNode$par2 = this.currentNode.parent) === null || _this$currentNode$par2 === void 0 || _this$currentNode$par2.expand(null, true);
+        }
+      }
+    }
+  }]);
+  return TreeStore;
+}();
+export { TreeStore as default };

package/dist/Tree/model/useDragNode.d.ts

@@ -0,0 +1,30 @@
+import React from 'react';
+import { TreeProps } from '../typings';
+import type Node from './node';
+import type TreeStore from './tree-store';
+export interface TreeNode {
+    node: Node;
+    $el?: HTMLElement;
+}
+export interface DragOptions {
+    event: React.DragEvent<HTMLDivElement>;
+    treeNode: TreeNode;
+}
+interface Props {
+    props: TreeProps;
+    elRef: React.RefObject<HTMLElement>;
+    dropIndicatorRef: React.RefObject<HTMLElement>;
+    store: TreeStore;
+}
+export interface DragEvents {
+    treeNodeDragStart: (options: DragOptions) => void;
+    treeNodeDragOver: (options: DragOptions) => void;
+    treeNodeDragEnd: (event: React.DragEvent<HTMLDivElement>) => void;
+}
+export declare const dragEventsKey: unique symbol;
+export declare function useDragNodeHandler({ props, elRef, dropIndicatorRef, store }: Props): {
+    treeNodeDragStart: ({ event, treeNode }: DragOptions) => false;
+    treeNodeDragOver: ({ event, treeNode }: DragOptions) => void;
+    treeNodeDragEnd: (event: React.DragEvent<HTMLDivElement>) => void;
+};
+export {};