ods-component-lib 1.22.2 → 1.22.4

package/dist/node_modules/@rc-component/tree/es/util.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"util.js","sources":["../../../../../node_modules/@rc-component/tree/es/util.js"],"sourcesContent":["function _extends() { _extends = Object.assign ? Object.assign.bind() : function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }\n/* eslint-disable no-lonely-if */\n/**\n * Legacy code. Should avoid to use if you are new to import these code.\n */\n\nimport warning from \"@rc-component/util/es/warning\";\nimport React from 'react';\nimport TreeNode from \"./TreeNode\";\nimport getEntity from \"./utils/keyUtil\";\nexport { getPosition, isTreeNode } from \"./utils/treeUtil\";\nexport function arrDel(list, value) {\n  if (!list) return [];\n  const clone = list.slice();\n  const index = clone.indexOf(value);\n  if (index >= 0) {\n    clone.splice(index, 1);\n  }\n  return clone;\n}\nexport function arrAdd(list, value) {\n  const clone = (list || []).slice();\n  if (clone.indexOf(value) === -1) {\n    clone.push(value);\n  }\n  return clone;\n}\nexport function posToArr(pos) {\n  return pos.split('-');\n}\nexport function getDragChildrenKeys(dragNodeKey, keyEntities) {\n  // not contains self\n  // self for left or right drag\n  const dragChildrenKeys = [];\n  const entity = getEntity(keyEntities, dragNodeKey);\n  function dig(list = []) {\n    list.forEach(({\n      key,\n      children\n    }) => {\n      dragChildrenKeys.push(key);\n      dig(children);\n    });\n  }\n  dig(entity.children);\n  return dragChildrenKeys;\n}\nexport function isLastChild(treeNodeEntity) {\n  if (treeNodeEntity.parent) {\n    const posArr = posToArr(treeNodeEntity.pos);\n    return Number(posArr[posArr.length - 1]) === treeNodeEntity.parent.children.length - 1;\n  }\n  return false;\n}\nexport function isFirstChild(treeNodeEntity) {\n  const posArr = posToArr(treeNodeEntity.pos);\n  return Number(posArr[posArr.length - 1]) === 0;\n}\n\n// Only used when drag, not affect SSR.\nexport function calcDropPosition(event, dragNodeProps, targetNodeProps, indent, startMousePosition, allowDrop, flattenedNodes, keyEntities, expandKeys, direction) {\n  const {\n    clientX,\n    clientY\n  } = event;\n  const {\n    top,\n    height\n  } = event.target.getBoundingClientRect();\n  // optional chain for testing\n  const horizontalMouseOffset = (direction === 'rtl' ? -1 : 1) * ((startMousePosition?.x || 0) - clientX);\n  const rawDropLevelOffset = (horizontalMouseOffset - 12) / indent;\n\n  // Filter the expanded keys to exclude the node that not has children currently (like async nodes).\n  const filteredExpandKeys = expandKeys.filter(key => keyEntities[key]?.children?.length);\n\n  // find abstract drop node by horizontal offset\n  let abstractDropNodeEntity = getEntity(keyEntities, targetNodeProps.eventKey);\n  if (clientY < top + height / 2) {\n    // first half, set abstract drop node to previous node\n    const nodeIndex = flattenedNodes.findIndex(flattenedNode => flattenedNode.key === abstractDropNodeEntity.key);\n    const prevNodeIndex = nodeIndex <= 0 ? 0 : nodeIndex - 1;\n    const prevNodeKey = flattenedNodes[prevNodeIndex].key;\n    abstractDropNodeEntity = getEntity(keyEntities, prevNodeKey);\n  }\n  const initialAbstractDropNodeKey = abstractDropNodeEntity.key;\n  const abstractDragOverEntity = abstractDropNodeEntity;\n  const dragOverNodeKey = abstractDropNodeEntity.key;\n  let dropPosition = 0;\n  let dropLevelOffset = 0;\n\n  // Only allow cross level drop when dragging on a non-expanded node\n  if (!filteredExpandKeys.includes(initialAbstractDropNodeKey)) {\n    for (let i = 0; i < rawDropLevelOffset; i += 1) {\n      if (isLastChild(abstractDropNodeEntity)) {\n        abstractDropNodeEntity = abstractDropNodeEntity.parent;\n        dropLevelOffset += 1;\n      } else {\n        break;\n      }\n    }\n  }\n  const abstractDragDataNode = dragNodeProps.data;\n  const abstractDropDataNode = abstractDropNodeEntity.node;\n  let dropAllowed = true;\n  if (isFirstChild(abstractDropNodeEntity) && abstractDropNodeEntity.level === 0 && clientY < top + height / 2 && allowDrop({\n    dragNode: abstractDragDataNode,\n    dropNode: abstractDropDataNode,\n    dropPosition: -1\n  }) && abstractDropNodeEntity.key === targetNodeProps.eventKey) {\n    // first half of first node in first level\n    dropPosition = -1;\n  } else if ((abstractDragOverEntity.children || []).length && filteredExpandKeys.includes(dragOverNodeKey)) {\n    // drop on expanded node\n    // only allow drop inside\n    if (allowDrop({\n      dragNode: abstractDragDataNode,\n      dropNode: abstractDropDataNode,\n      dropPosition: 0\n    })) {\n      dropPosition = 0;\n    } else {\n      dropAllowed = false;\n    }\n  } else if (dropLevelOffset === 0) {\n    if (rawDropLevelOffset > -1.5) {\n      // | Node     | <- abstractDropNode\n      // | -^-===== | <- mousePosition\n      // 1. try drop after\n      // 2. do not allow drop\n      if (allowDrop({\n        dragNode: abstractDragDataNode,\n        dropNode: abstractDropDataNode,\n        dropPosition: 1\n      })) {\n        dropPosition = 1;\n      } else {\n        dropAllowed = false;\n      }\n    } else {\n      // | Node     | <- abstractDropNode\n      // | ---==^== | <- mousePosition\n      // whether it has children or doesn't has children\n      // always\n      // 1. try drop inside\n      // 2. try drop after\n      // 3. do not allow drop\n      if (allowDrop({\n        dragNode: abstractDragDataNode,\n        dropNode: abstractDropDataNode,\n        dropPosition: 0\n      })) {\n        dropPosition = 0;\n      } else if (allowDrop({\n        dragNode: abstractDragDataNode,\n        dropNode: abstractDropDataNode,\n        dropPosition: 1\n      })) {\n        dropPosition = 1;\n      } else {\n        dropAllowed = false;\n      }\n    }\n  } else {\n    // | Node1 | <- abstractDropNode\n    //      |  Node2  |\n    // --^--|----=====| <- mousePosition\n    // 1. try insert after Node1\n    // 2. do not allow drop\n    if (allowDrop({\n      dragNode: abstractDragDataNode,\n      dropNode: abstractDropDataNode,\n      dropPosition: 1\n    })) {\n      dropPosition = 1;\n    } else {\n      dropAllowed = false;\n    }\n  }\n  return {\n    dropPosition,\n    dropLevelOffset,\n    dropTargetKey: abstractDropNodeEntity.key,\n    dropTargetPos: abstractDropNodeEntity.pos,\n    dragOverNodeKey,\n    dropContainerKey: dropPosition === 0 ? null : abstractDropNodeEntity.parent?.key || null,\n    dropAllowed\n  };\n}\n\n/**\n * Return selectedKeys according with multiple prop\n * @param selectedKeys\n * @param props\n * @returns [string]\n */\nexport function calcSelectedKeys(selectedKeys, props) {\n  if (!selectedKeys) return undefined;\n  const {\n    multiple\n  } = props;\n  if (multiple) {\n    return selectedKeys.slice();\n  }\n  if (selectedKeys.length) {\n    return [selectedKeys[0]];\n  }\n  return selectedKeys;\n}\nconst internalProcessProps = props => props;\nexport function convertDataToTree(treeData, processor) {\n  if (!treeData) return [];\n  const {\n    processProps = internalProcessProps\n  } = processor || {};\n  const list = Array.isArray(treeData) ? treeData : [treeData];\n  return list.map(({\n    children,\n    ...props\n  }) => {\n    const childrenNodes = convertDataToTree(children, processor);\n    return /*#__PURE__*/React.createElement(TreeNode, _extends({\n      key: props.key\n    }, processProps(props)), childrenNodes);\n  });\n}\n\n/**\n * Parse `checkedKeys` to { checkedKeys, halfCheckedKeys } style\n */\nexport function parseCheckedKeys(keys) {\n  if (!keys) {\n    return null;\n  }\n\n  // Convert keys to object format\n  let keyProps;\n  if (Array.isArray(keys)) {\n    // [Legacy] Follow the api doc\n    keyProps = {\n      checkedKeys: keys,\n      halfCheckedKeys: undefined\n    };\n  } else if (typeof keys === 'object') {\n    keyProps = {\n      checkedKeys: keys.checked || undefined,\n      halfCheckedKeys: keys.halfChecked || undefined\n    };\n  } else {\n    warning(false, '`checkedKeys` is not an array or an object');\n    return null;\n  }\n  return keyProps;\n}\n\n/**\n * If user use `autoExpandParent` we should get the list of parent node\n * @param keyList\n * @param keyEntities\n */\nexport function conductExpandParent(keyList, keyEntities) {\n  const expandedKeys = new Set();\n  function conductUp(key) {\n    if (expandedKeys.has(key)) return;\n    const entity = getEntity(keyEntities, key);\n    if (!entity) return;\n    expandedKeys.add(key);\n    const {\n      parent,\n      node\n    } = entity;\n    if (node.disabled) return;\n    if (parent) {\n      conductUp(parent.key);\n    }\n  }\n  (keyList || []).forEach(key => {\n    conductUp(key);\n  });\n  return [...expandedKeys];\n}"],"names":["arrDel","list","value","clone","index","arrAdd","posToArr","pos","getDragChildrenKeys","dragNodeKey","keyEntities","dragChildrenKeys","entity","getEntity","dig","key","children","isLastChild","treeNodeEntity","posArr","isFirstChild","calcDropPosition","event","dragNodeProps","targetNodeProps","indent","startMousePosition","allowDrop","flattenedNodes","expandKeys","direction","clientX","clientY","top","height","rawDropLevelOffset","filteredExpandKeys","abstractDropNodeEntity","nodeIndex","flattenedNode","prevNodeIndex","prevNodeKey","initialAbstractDropNodeKey","abstractDragOverEntity","dragOverNodeKey","dropPosition","dropLevelOffset","i","abstractDragDataNode","abstractDropDataNode","dropAllowed","calcSelectedKeys","selectedKeys","props","multiple","parseCheckedKeys","keys","keyProps","warning","conductExpandParent","keyList","expandedKeys","conductUp","parent","node"],"mappings":";;AAWO,SAASA,EAAOC,GAAMC,GAAO;AAClC,MAAI,CAACD,EAAM,QAAO,CAAA;AAClB,QAAME,IAAQF,EAAK,MAAK,GAClBG,IAAQD,EAAM,QAAQD,CAAK;AACjC,SAAIE,KAAS,KACXD,EAAM,OAAOC,GAAO,CAAC,GAEhBD;AACT;AACO,SAASE,EAAOJ,GAAMC,GAAO;AAClC,QAAMC,KAASF,KAAQ,CAAA,GAAI,MAAK;AAChC,SAAIE,EAAM,QAAQD,CAAK,MAAM,MAC3BC,EAAM,KAAKD,CAAK,GAEXC;AACT;AACO,SAASG,EAASC,GAAK;AAC5B,SAAOA,EAAI,MAAM,GAAG;AACtB;AACO,SAASC,EAAoBC,GAAaC,GAAa;AAG5D,QAAMC,IAAmB,CAAA,GACnBC,IAASC,EAAUH,GAAaD,CAAW;AACjD,WAASK,EAAIb,IAAO,IAAI;AACtB,IAAAA,EAAK,QAAQ,CAAC;AAAA,MACZ,KAAAc;AAAA,MACA,UAAAC;AAAA,IACN,MAAU;AACJ,MAAAL,EAAiB,KAAKI,CAAG,GACzBD,EAAIE,CAAQ;AAAA,IACd,CAAC;AAAA,EACH;AACA,SAAAF,EAAIF,EAAO,QAAQ,GACZD;AACT;AACO,SAASM,EAAYC,GAAgB;AAC1C,MAAIA,EAAe,QAAQ;AACzB,UAAMC,IAASb,EAASY,EAAe,GAAG;AAC1C,WAAO,OAAOC,EAAOA,EAAO,SAAS,CAAC,CAAC,MAAMD,EAAe,OAAO,SAAS,SAAS;AAAA,EACvF;AACA,SAAO;AACT;AACO,SAASE,EAAaF,GAAgB;AAC3C,QAAMC,IAASb,EAASY,EAAe,GAAG;AAC1C,SAAO,OAAOC,EAAOA,EAAO,SAAS,CAAC,CAAC,MAAM;AAC/C;AAGO,SAASE,EAAiBC,GAAOC,GAAeC,GAAiBC,GAAQC,GAAoBC,GAAWC,GAAgBlB,GAAamB,GAAYC,GAAW;AACjK,QAAM;AAAA,IACJ,SAAAC;AAAA,IACA,SAAAC;AAAA,EACJ,IAAMV,GACE;AAAA,IACJ,KAAAW;AAAA,IACA,QAAAC;AAAA,EACJ,IAAMZ,EAAM,OAAO,sBAAqB,GAGhCa,MADyBL,MAAc,QAAQ,KAAK,OAAOJ,GAAoB,KAAK,KAAKK,KAC3C,MAAMN,GAGpDW,IAAqBP,EAAW,OAAO,CAAAd,MAAOL,EAAYK,CAAG,GAAG,UAAU,MAAM;AAGtF,MAAIsB,IAAyBxB,EAAUH,GAAac,EAAgB,QAAQ;AAC5E,MAAIQ,IAAUC,IAAMC,IAAS,GAAG;AAE9B,UAAMI,IAAYV,EAAe,UAAU,CAAAW,MAAiBA,EAAc,QAAQF,EAAuB,GAAG,GACtGG,IAAgBF,KAAa,IAAI,IAAIA,IAAY,GACjDG,IAAcb,EAAeY,CAAa,EAAE;AAClD,IAAAH,IAAyBxB,EAAUH,GAAa+B,CAAW;AAAA,EAC7D;AACA,QAAMC,IAA6BL,EAAuB,KACpDM,IAAyBN,GACzBO,IAAkBP,EAAuB;AAC/C,MAAIQ,IAAe,GACfC,IAAkB;AAGtB,MAAI,CAACV,EAAmB,SAASM,CAA0B;AACzD,aAASK,IAAI,GAAGA,IAAIZ,KACdlB,EAAYoB,CAAsB,GADAU,KAAK;AAEzC,MAAAV,IAAyBA,EAAuB,QAChDS,KAAmB;AAMzB,QAAME,IAAuBzB,EAAc,MACrC0B,IAAuBZ,EAAuB;AACpD,MAAIa,IAAc;AAClB,SAAI9B,EAAaiB,CAAsB,KAAKA,EAAuB,UAAU,KAAKL,IAAUC,IAAMC,IAAS,KAAKP,EAAU;AAAA,IACxH,UAAUqB;AAAA,IACV,UAAUC;AAAA,IACV,cAAc;AAAA,EAClB,CAAG,KAAKZ,EAAuB,QAAQb,EAAgB,WAEnDqB,IAAe,MACLF,EAAuB,YAAY,CAAA,GAAI,UAAUP,EAAmB,SAASQ,CAAe,IAGlGjB,EAAU;AAAA,IACZ,UAAUqB;AAAA,IACV,UAAUC;AAAA,IACV,cAAc;AAAA,EACpB,CAAK,IACCJ,IAAe,IAEfK,IAAc,KAEPJ,MAAoB,IACzBX,IAAqB,OAKnBR,EAAU;AAAA,IACZ,UAAUqB;AAAA,IACV,UAAUC;AAAA,IACV,cAAc;AAAA,EACtB,CAAO,IACCJ,IAAe,IAEfK,IAAc,KAUZvB,EAAU;AAAA,IACZ,UAAUqB;AAAA,IACV,UAAUC;AAAA,IACV,cAAc;AAAA,EACtB,CAAO,IACCJ,IAAe,IACNlB,EAAU;AAAA,IACnB,UAAUqB;AAAA,IACV,UAAUC;AAAA,IACV,cAAc;AAAA,EACtB,CAAO,IACCJ,IAAe,IAEfK,IAAc,KASdvB,EAAU;AAAA,IACZ,UAAUqB;AAAA,IACV,UAAUC;AAAA,IACV,cAAc;AAAA,EACpB,CAAK,IACCJ,IAAe,IAEfK,IAAc,IAGX;AAAA,IACL,cAAAL;AAAA,IACA,iBAAAC;AAAA,IACA,eAAeT,EAAuB;AAAA,IACtC,eAAeA,EAAuB;AAAA,IACtC,iBAAAO;AAAA,IACA,kBAAkBC,MAAiB,IAAI,OAAOR,EAAuB,QAAQ,OAAO;AAAA,IACpF,aAAAa;AAAA,EACJ;AACA;AAQO,SAASC,EAAiBC,GAAcC,GAAO;AACpD,MAAI,CAACD,EAAc;AACnB,QAAM;AAAA,IACJ,UAAAE;AAAA,EACJ,IAAMD;AACJ,SAAIC,IACKF,EAAa,MAAK,IAEvBA,EAAa,SACR,CAACA,EAAa,CAAC,CAAC,IAElBA;AACT;AAsBO,SAASG,EAAiBC,GAAM;AACrC,MAAI,CAACA;AACH,WAAO;AAIT,MAAIC;AACJ,MAAI,MAAM,QAAQD,CAAI;AAEpB,IAAAC,IAAW;AAAA,MACT,aAAaD;AAAA,MACb,iBAAiB;AAAA,IACvB;AAAA,WACa,OAAOA,KAAS;AACzB,IAAAC,IAAW;AAAA,MACT,aAAaD,EAAK,WAAW;AAAA,MAC7B,iBAAiBA,EAAK,eAAe;AAAA,IAC3C;AAAA;AAEIE,WAAAA,EAAQ,IAAO,4CAA4C,GACpD;AAET,SAAOD;AACT;AAOO,SAASE,EAAoBC,GAASlD,GAAa;AACxD,QAAMmD,IAAe,oBAAI,IAAG;AAC5B,WAASC,EAAU/C,GAAK;AACtB,QAAI8C,EAAa,IAAI9C,CAAG,EAAG;AAC3B,UAAMH,IAASC,EAAUH,GAAaK,CAAG;AACzC,QAAI,CAACH,EAAQ;AACb,IAAAiD,EAAa,IAAI9C,CAAG;AACpB,UAAM;AAAA,MACJ,QAAAgD;AAAA,MACA,MAAAC;AAAA,IACN,IAAQpD;AACJ,IAAIoD,EAAK,YACLD,KACFD,EAAUC,EAAO,GAAG;AAAA,EAExB;AACA,UAACH,KAAW,CAAA,GAAI,QAAQ,CAAA7C,MAAO;AAC7B,IAAA+C,EAAU/C,CAAG;AAAA,EACf,CAAC,GACM,CAAC,GAAG8C,CAAY;AACzB;","x_google_ignoreList":[0]}

package/dist/node_modules/@rc-component/tree/es/utils/conductUtil.js

@@ -1,120 +0,0 @@
-import { warningOnce as S } from "../../../util/es/warning.js";
-import K from "./keyUtil.js";
-function p(k, u) {
-  const s = /* @__PURE__ */ new Set();
-  return k.forEach((r) => {
-    u.has(r) || s.add(r);
-  }), s;
-}
-function m(k) {
-  const {
-    disabled: u,
-    disableCheckbox: s,
-    checkable: r
-  } = k || {};
-  return !!(u || s) || r === !1;
-}
-function g(k, u, s, r) {
-  const o = new Set(k), f = /* @__PURE__ */ new Set();
-  for (let c = 0; c <= s; c += 1)
-    (u.get(c) || /* @__PURE__ */ new Set()).forEach((i) => {
-      const {
-        key: e,
-        node: t,
-        children: l = []
-      } = i;
-      o.has(e) && !r(t) && l.filter((n) => !r(n.node)).forEach((n) => {
-        o.add(n.key);
-      });
-    });
-  const d = /* @__PURE__ */ new Set();
-  for (let c = s; c >= 0; c -= 1)
-    (u.get(c) || /* @__PURE__ */ new Set()).forEach((i) => {
-      const {
-        parent: e,
-        node: t
-      } = i;
-      if (r(t) || !i.parent || d.has(i.parent.key))
-        return;
-      if (r(i.parent.node)) {
-        d.add(e.key);
-        return;
-      }
-      let l = !0, n = !1;
-      (e.children || []).filter((h) => !r(h.node)).forEach(({
-        key: h
-      }) => {
-        const y = o.has(h);
-        l && !y && (l = !1), !n && (y || f.has(h)) && (n = !0);
-      }), l && o.add(e.key), n && f.add(e.key), d.add(e.key);
-    });
-  return {
-    checkedKeys: Array.from(o),
-    halfCheckedKeys: Array.from(p(f, o))
-  };
-}
-function C(k, u, s, r, o) {
-  const f = new Set(k);
-  let d = new Set(u);
-  for (let a = 0; a <= r; a += 1)
-    (s.get(a) || /* @__PURE__ */ new Set()).forEach((e) => {
-      const {
-        key: t,
-        node: l,
-        children: n = []
-      } = e;
-      !f.has(t) && !d.has(t) && !o(l) && n.filter((h) => !o(h.node)).forEach((h) => {
-        f.delete(h.key);
-      });
-    });
-  d = /* @__PURE__ */ new Set();
-  const c = /* @__PURE__ */ new Set();
-  for (let a = r; a >= 0; a -= 1)
-    (s.get(a) || /* @__PURE__ */ new Set()).forEach((e) => {
-      const {
-        parent: t,
-        node: l
-      } = e;
-      if (o(l) || !e.parent || c.has(e.parent.key))
-        return;
-      if (o(e.parent.node)) {
-        c.add(t.key);
-        return;
-      }
-      let n = !0, h = !1;
-      (t.children || []).filter((y) => !o(y.node)).forEach(({
-        key: y
-      }) => {
-        const w = f.has(y);
-        n && !w && (n = !1), !h && (w || d.has(y)) && (h = !0);
-      }), n || f.delete(t.key), h && d.add(t.key), c.add(t.key);
-    });
-  return {
-    checkedKeys: Array.from(f),
-    halfCheckedKeys: Array.from(p(d, f))
-  };
-}
-function A(k, u, s, r) {
-  const o = [];
-  let f;
-  r ? f = r : f = m;
-  const d = new Set(k.filter((e) => {
-    const t = !!K(s, e);
-    return t || o.push(e), t;
-  })), c = /* @__PURE__ */ new Map();
-  let a = 0;
-  Object.keys(s).forEach((e) => {
-    const t = s[e], {
-      level: l
-    } = t;
-    let n = c.get(l);
-    n || (n = /* @__PURE__ */ new Set(), c.set(l, n)), n.add(t), a = Math.max(a, l);
-  }), S(!o.length, `Tree missing follow keys: ${o.slice(0, 100).map((e) => `'${e}'`).join(", ")}`);
-  let i;
-  return u === !0 ? i = g(d, c, a, f) : i = C(d, u.halfCheckedKeys, c, a, f), i;
-}
-export {
-  A as conductCheck,
-  m as isCheckDisabled
-};
-//# sourceMappingURL=conductUtil.js.map

package/dist/node_modules/@rc-component/tree/es/utils/conductUtil.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"conductUtil.js","sources":["../../../../../../node_modules/@rc-component/tree/es/utils/conductUtil.js"],"sourcesContent":["import warning from \"@rc-component/util/es/warning\";\nimport getEntity from \"./keyUtil\";\nfunction removeFromCheckedKeys(halfCheckedKeys, checkedKeys) {\n  const filteredKeys = new Set();\n  halfCheckedKeys.forEach(key => {\n    if (!checkedKeys.has(key)) {\n      filteredKeys.add(key);\n    }\n  });\n  return filteredKeys;\n}\nexport function isCheckDisabled(node) {\n  const {\n    disabled,\n    disableCheckbox,\n    checkable\n  } = node || {};\n  return !!(disabled || disableCheckbox) || checkable === false;\n}\n\n// Fill miss keys\nfunction fillConductCheck(keys, levelEntities, maxLevel, syntheticGetCheckDisabled) {\n  const checkedKeys = new Set(keys);\n  const halfCheckedKeys = new Set();\n\n  // Add checked keys top to bottom\n  for (let level = 0; level <= maxLevel; level += 1) {\n    const entities = levelEntities.get(level) || new Set();\n    entities.forEach(entity => {\n      const {\n        key,\n        node,\n        children = []\n      } = entity;\n      if (checkedKeys.has(key) && !syntheticGetCheckDisabled(node)) {\n        children.filter(childEntity => !syntheticGetCheckDisabled(childEntity.node)).forEach(childEntity => {\n          checkedKeys.add(childEntity.key);\n        });\n      }\n    });\n  }\n\n  // Add checked keys from bottom to top\n  const visitedKeys = new Set();\n  for (let level = maxLevel; level >= 0; level -= 1) {\n    const entities = levelEntities.get(level) || new Set();\n    entities.forEach(entity => {\n      const {\n        parent,\n        node\n      } = entity;\n\n      // Skip if no need to check\n      if (syntheticGetCheckDisabled(node) || !entity.parent || visitedKeys.has(entity.parent.key)) {\n        return;\n      }\n\n      // Skip if parent is disabled\n      if (syntheticGetCheckDisabled(entity.parent.node)) {\n        visitedKeys.add(parent.key);\n        return;\n      }\n      let allChecked = true;\n      let partialChecked = false;\n      (parent.children || []).filter(childEntity => !syntheticGetCheckDisabled(childEntity.node)).forEach(({\n        key\n      }) => {\n        const checked = checkedKeys.has(key);\n        if (allChecked && !checked) {\n          allChecked = false;\n        }\n        if (!partialChecked && (checked || halfCheckedKeys.has(key))) {\n          partialChecked = true;\n        }\n      });\n      if (allChecked) {\n        checkedKeys.add(parent.key);\n      }\n      if (partialChecked) {\n        halfCheckedKeys.add(parent.key);\n      }\n      visitedKeys.add(parent.key);\n    });\n  }\n  return {\n    checkedKeys: Array.from(checkedKeys),\n    halfCheckedKeys: Array.from(removeFromCheckedKeys(halfCheckedKeys, checkedKeys))\n  };\n}\n\n// Remove useless key\nfunction cleanConductCheck(keys, halfKeys, levelEntities, maxLevel, syntheticGetCheckDisabled) {\n  const checkedKeys = new Set(keys);\n  let halfCheckedKeys = new Set(halfKeys);\n\n  // Remove checked keys from top to bottom\n  for (let level = 0; level <= maxLevel; level += 1) {\n    const entities = levelEntities.get(level) || new Set();\n    entities.forEach(entity => {\n      const {\n        key,\n        node,\n        children = []\n      } = entity;\n      if (!checkedKeys.has(key) && !halfCheckedKeys.has(key) && !syntheticGetCheckDisabled(node)) {\n        children.filter(childEntity => !syntheticGetCheckDisabled(childEntity.node)).forEach(childEntity => {\n          checkedKeys.delete(childEntity.key);\n        });\n      }\n    });\n  }\n\n  // Remove checked keys form bottom to top\n  halfCheckedKeys = new Set();\n  const visitedKeys = new Set();\n  for (let level = maxLevel; level >= 0; level -= 1) {\n    const entities = levelEntities.get(level) || new Set();\n    entities.forEach(entity => {\n      const {\n        parent,\n        node\n      } = entity;\n\n      // Skip if no need to check\n      if (syntheticGetCheckDisabled(node) || !entity.parent || visitedKeys.has(entity.parent.key)) {\n        return;\n      }\n\n      // Skip if parent is disabled\n      if (syntheticGetCheckDisabled(entity.parent.node)) {\n        visitedKeys.add(parent.key);\n        return;\n      }\n      let allChecked = true;\n      let partialChecked = false;\n      (parent.children || []).filter(childEntity => !syntheticGetCheckDisabled(childEntity.node)).forEach(({\n        key\n      }) => {\n        const checked = checkedKeys.has(key);\n        if (allChecked && !checked) {\n          allChecked = false;\n        }\n        if (!partialChecked && (checked || halfCheckedKeys.has(key))) {\n          partialChecked = true;\n        }\n      });\n      if (!allChecked) {\n        checkedKeys.delete(parent.key);\n      }\n      if (partialChecked) {\n        halfCheckedKeys.add(parent.key);\n      }\n      visitedKeys.add(parent.key);\n    });\n  }\n  return {\n    checkedKeys: Array.from(checkedKeys),\n    halfCheckedKeys: Array.from(removeFromCheckedKeys(halfCheckedKeys, checkedKeys))\n  };\n}\n\n/**\n * Conduct with keys.\n * @param keyList current key list\n * @param keyEntities key - dataEntity map\n * @param mode `fill` to fill missing key, `clean` to remove useless key\n */\nexport function conductCheck(keyList, checked, keyEntities, getCheckDisabled) {\n  const warningMissKeys = [];\n  let syntheticGetCheckDisabled;\n  if (getCheckDisabled) {\n    syntheticGetCheckDisabled = getCheckDisabled;\n  } else {\n    syntheticGetCheckDisabled = isCheckDisabled;\n  }\n\n  // We only handle exist keys\n  const keys = new Set(keyList.filter(key => {\n    const hasEntity = !!getEntity(keyEntities, key);\n    if (!hasEntity) {\n      warningMissKeys.push(key);\n    }\n    return hasEntity;\n  }));\n  const levelEntities = new Map();\n  let maxLevel = 0;\n\n  // Convert entities by level for calculation\n  Object.keys(keyEntities).forEach(key => {\n    const entity = keyEntities[key];\n    const {\n      level\n    } = entity;\n    let levelSet = levelEntities.get(level);\n    if (!levelSet) {\n      levelSet = new Set();\n      levelEntities.set(level, levelSet);\n    }\n    levelSet.add(entity);\n    maxLevel = Math.max(maxLevel, level);\n  });\n  warning(!warningMissKeys.length, `Tree missing follow keys: ${warningMissKeys.slice(0, 100).map(key => `'${key}'`).join(', ')}`);\n  let result;\n  if (checked === true) {\n    result = fillConductCheck(keys, levelEntities, maxLevel, syntheticGetCheckDisabled);\n  } else {\n    result = cleanConductCheck(keys, checked.halfCheckedKeys, levelEntities, maxLevel, syntheticGetCheckDisabled);\n  }\n  return result;\n}"],"names":["removeFromCheckedKeys","halfCheckedKeys","checkedKeys","filteredKeys","key","isCheckDisabled","node","disabled","disableCheckbox","checkable","fillConductCheck","keys","levelEntities","maxLevel","syntheticGetCheckDisabled","level","entity","children","childEntity","visitedKeys","parent","allChecked","partialChecked","checked","cleanConductCheck","halfKeys","conductCheck","keyList","keyEntities","getCheckDisabled","warningMissKeys","hasEntity","getEntity","levelSet","warning","result"],"mappings":";;AAEA,SAASA,EAAsBC,GAAiBC,GAAa;AAC3D,QAAMC,IAAe,oBAAI,IAAG;AAC5B,SAAAF,EAAgB,QAAQ,CAAAG,MAAO;AAC7B,IAAKF,EAAY,IAAIE,CAAG,KACtBD,EAAa,IAAIC,CAAG;AAAA,EAExB,CAAC,GACMD;AACT;AACO,SAASE,EAAgBC,GAAM;AACpC,QAAM;AAAA,IACJ,UAAAC;AAAA,IACA,iBAAAC;AAAA,IACA,WAAAC;AAAA,EACJ,IAAMH,KAAQ,CAAA;AACZ,SAAO,CAAC,EAAEC,KAAYC,MAAoBC,MAAc;AAC1D;AAGA,SAASC,EAAiBC,GAAMC,GAAeC,GAAUC,GAA2B;AAClF,QAAMZ,IAAc,IAAI,IAAIS,CAAI,GAC1BV,IAAkB,oBAAI,IAAG;AAG/B,WAASc,IAAQ,GAAGA,KAASF,GAAUE,KAAS;AAE9C,KADiBH,EAAc,IAAIG,CAAK,KAAK,oBAAI,IAAG,GAC3C,QAAQ,CAAAC,MAAU;AACzB,YAAM;AAAA,QACJ,KAAAZ;AAAA,QACA,MAAAE;AAAA,QACA,UAAAW,IAAW,CAAA;AAAA,MACnB,IAAUD;AACJ,MAAId,EAAY,IAAIE,CAAG,KAAK,CAACU,EAA0BR,CAAI,KACzDW,EAAS,OAAO,CAAAC,MAAe,CAACJ,EAA0BI,EAAY,IAAI,CAAC,EAAE,QAAQ,CAAAA,MAAe;AAClG,QAAAhB,EAAY,IAAIgB,EAAY,GAAG;AAAA,MACjC,CAAC;AAAA,IAEL,CAAC;AAIH,QAAMC,IAAc,oBAAI,IAAG;AAC3B,WAASJ,IAAQF,GAAUE,KAAS,GAAGA,KAAS;AAE9C,KADiBH,EAAc,IAAIG,CAAK,KAAK,oBAAI,IAAG,GAC3C,QAAQ,CAAAC,MAAU;AACzB,YAAM;AAAA,QACJ,QAAAI;AAAA,QACA,MAAAd;AAAA,MACR,IAAUU;AAGJ,UAAIF,EAA0BR,CAAI,KAAK,CAACU,EAAO,UAAUG,EAAY,IAAIH,EAAO,OAAO,GAAG;AACxF;AAIF,UAAIF,EAA0BE,EAAO,OAAO,IAAI,GAAG;AACjD,QAAAG,EAAY,IAAIC,EAAO,GAAG;AAC1B;AAAA,MACF;AACA,UAAIC,IAAa,IACbC,IAAiB;AACrB,OAACF,EAAO,YAAY,CAAA,GAAI,OAAO,CAAAF,MAAe,CAACJ,EAA0BI,EAAY,IAAI,CAAC,EAAE,QAAQ,CAAC;AAAA,QACnG,KAAAd;AAAA,MACR,MAAY;AACJ,cAAMmB,IAAUrB,EAAY,IAAIE,CAAG;AACnC,QAAIiB,KAAc,CAACE,MACjBF,IAAa,KAEX,CAACC,MAAmBC,KAAWtB,EAAgB,IAAIG,CAAG,OACxDkB,IAAiB;AAAA,MAErB,CAAC,GACGD,KACFnB,EAAY,IAAIkB,EAAO,GAAG,GAExBE,KACFrB,EAAgB,IAAImB,EAAO,GAAG,GAEhCD,EAAY,IAAIC,EAAO,GAAG;AAAA,IAC5B,CAAC;AAEH,SAAO;AAAA,IACL,aAAa,MAAM,KAAKlB,CAAW;AAAA,IACnC,iBAAiB,MAAM,KAAKF,EAAsBC,GAAiBC,CAAW,CAAC;AAAA,EACnF;AACA;AAGA,SAASsB,EAAkBb,GAAMc,GAAUb,GAAeC,GAAUC,GAA2B;AAC7F,QAAMZ,IAAc,IAAI,IAAIS,CAAI;AAChC,MAAIV,IAAkB,IAAI,IAAIwB,CAAQ;AAGtC,WAASV,IAAQ,GAAGA,KAASF,GAAUE,KAAS;AAE9C,KADiBH,EAAc,IAAIG,CAAK,KAAK,oBAAI,IAAG,GAC3C,QAAQ,CAAAC,MAAU;AACzB,YAAM;AAAA,QACJ,KAAAZ;AAAA,QACA,MAAAE;AAAA,QACA,UAAAW,IAAW,CAAA;AAAA,MACnB,IAAUD;AACJ,MAAI,CAACd,EAAY,IAAIE,CAAG,KAAK,CAACH,EAAgB,IAAIG,CAAG,KAAK,CAACU,EAA0BR,CAAI,KACvFW,EAAS,OAAO,CAAAC,MAAe,CAACJ,EAA0BI,EAAY,IAAI,CAAC,EAAE,QAAQ,CAAAA,MAAe;AAClG,QAAAhB,EAAY,OAAOgB,EAAY,GAAG;AAAA,MACpC,CAAC;AAAA,IAEL,CAAC;AAIH,EAAAjB,IAAkB,oBAAI,IAAG;AACzB,QAAMkB,IAAc,oBAAI,IAAG;AAC3B,WAASJ,IAAQF,GAAUE,KAAS,GAAGA,KAAS;AAE9C,KADiBH,EAAc,IAAIG,CAAK,KAAK,oBAAI,IAAG,GAC3C,QAAQ,CAAAC,MAAU;AACzB,YAAM;AAAA,QACJ,QAAAI;AAAA,QACA,MAAAd;AAAA,MACR,IAAUU;AAGJ,UAAIF,EAA0BR,CAAI,KAAK,CAACU,EAAO,UAAUG,EAAY,IAAIH,EAAO,OAAO,GAAG;AACxF;AAIF,UAAIF,EAA0BE,EAAO,OAAO,IAAI,GAAG;AACjD,QAAAG,EAAY,IAAIC,EAAO,GAAG;AAC1B;AAAA,MACF;AACA,UAAIC,IAAa,IACbC,IAAiB;AACrB,OAACF,EAAO,YAAY,CAAA,GAAI,OAAO,CAAAF,MAAe,CAACJ,EAA0BI,EAAY,IAAI,CAAC,EAAE,QAAQ,CAAC;AAAA,QACnG,KAAAd;AAAA,MACR,MAAY;AACJ,cAAMmB,IAAUrB,EAAY,IAAIE,CAAG;AACnC,QAAIiB,KAAc,CAACE,MACjBF,IAAa,KAEX,CAACC,MAAmBC,KAAWtB,EAAgB,IAAIG,CAAG,OACxDkB,IAAiB;AAAA,MAErB,CAAC,GACID,KACHnB,EAAY,OAAOkB,EAAO,GAAG,GAE3BE,KACFrB,EAAgB,IAAImB,EAAO,GAAG,GAEhCD,EAAY,IAAIC,EAAO,GAAG;AAAA,IAC5B,CAAC;AAEH,SAAO;AAAA,IACL,aAAa,MAAM,KAAKlB,CAAW;AAAA,IACnC,iBAAiB,MAAM,KAAKF,EAAsBC,GAAiBC,CAAW,CAAC;AAAA,EACnF;AACA;AAQO,SAASwB,EAAaC,GAASJ,GAASK,GAAaC,GAAkB;AAC5E,QAAMC,IAAkB,CAAA;AACxB,MAAIhB;AACJ,EAAIe,IACFf,IAA4Be,IAE5Bf,IAA4BT;AAI9B,QAAMM,IAAO,IAAI,IAAIgB,EAAQ,OAAO,CAAAvB,MAAO;AACzC,UAAM2B,IAAY,CAAC,CAACC,EAAUJ,GAAaxB,CAAG;AAC9C,WAAK2B,KACHD,EAAgB,KAAK1B,CAAG,GAEnB2B;AAAA,EACT,CAAC,CAAC,GACInB,IAAgB,oBAAI,IAAG;AAC7B,MAAIC,IAAW;AAGf,SAAO,KAAKe,CAAW,EAAE,QAAQ,CAAAxB,MAAO;AACtC,UAAMY,IAASY,EAAYxB,CAAG,GACxB;AAAA,MACJ,OAAAW;AAAA,IACN,IAAQC;AACJ,QAAIiB,IAAWrB,EAAc,IAAIG,CAAK;AACtC,IAAKkB,MACHA,IAAW,oBAAI,IAAG,GAClBrB,EAAc,IAAIG,GAAOkB,CAAQ,IAEnCA,EAAS,IAAIjB,CAAM,GACnBH,IAAW,KAAK,IAAIA,GAAUE,CAAK;AAAA,EACrC,CAAC,GACDmB,EAAQ,CAACJ,EAAgB,QAAQ,6BAA6BA,EAAgB,MAAM,GAAG,GAAG,EAAE,IAAI,CAAA1B,MAAO,IAAIA,CAAG,GAAG,EAAE,KAAK,IAAI,CAAC,EAAE;AAC/H,MAAI+B;AACJ,SAAIZ,MAAY,KACdY,IAASzB,EAAiBC,GAAMC,GAAeC,GAAUC,CAAyB,IAElFqB,IAASX,EAAkBb,GAAMY,EAAQ,iBAAiBX,GAAeC,GAAUC,CAAyB,GAEvGqB;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/@rc-component/tree/es/utils/diffUtil.js

@@ -1,36 +0,0 @@
-function o(t = [], n = []) {
-  const d = t.length, s = n.length;
-  if (Math.abs(d - s) !== 1)
-    return {
-      add: !1,
-      key: null
-    };
-  function r(a, e) {
-    const c = /* @__PURE__ */ new Map();
-    a.forEach((f) => {
-      c.set(f, !0);
-    });
-    const i = e.filter((f) => !c.has(f));
-    return i.length === 1 ? i[0] : null;
-  }
-  return d < s ? {
-    add: !0,
-    key: r(t, n)
-  } : {
-    add: !1,
-    key: r(n, t)
-  };
-}
-function u(t, n, d) {
-  const s = t.findIndex((e) => e.key === d), r = t[s + 1], a = n.findIndex((e) => e.key === d);
-  if (r) {
-    const e = n.findIndex((c) => c.key === r.key);
-    return n.slice(a + 1, e);
-  }
-  return n.slice(a + 1);
-}
-export {
-  o as findExpandedKeys,
-  u as getExpandRange
-};
-//# sourceMappingURL=diffUtil.js.map

package/dist/node_modules/@rc-component/tree/es/utils/diffUtil.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"diffUtil.js","sources":["../../../../../../node_modules/@rc-component/tree/es/utils/diffUtil.js"],"sourcesContent":["export function findExpandedKeys(prev = [], next = []) {\n  const prevLen = prev.length;\n  const nextLen = next.length;\n  if (Math.abs(prevLen - nextLen) !== 1) {\n    return {\n      add: false,\n      key: null\n    };\n  }\n  function find(shorter, longer) {\n    const cache = new Map();\n    shorter.forEach(key => {\n      cache.set(key, true);\n    });\n    const keys = longer.filter(key => !cache.has(key));\n    return keys.length === 1 ? keys[0] : null;\n  }\n  if (prevLen < nextLen) {\n    return {\n      add: true,\n      key: find(prev, next)\n    };\n  }\n  return {\n    add: false,\n    key: find(next, prev)\n  };\n}\nexport function getExpandRange(shorter, longer, key) {\n  const shorterStartIndex = shorter.findIndex(data => data.key === key);\n  const shorterEndNode = shorter[shorterStartIndex + 1];\n  const longerStartIndex = longer.findIndex(data => data.key === key);\n  if (shorterEndNode) {\n    const longerEndIndex = longer.findIndex(data => data.key === shorterEndNode.key);\n    return longer.slice(longerStartIndex + 1, longerEndIndex);\n  }\n  return longer.slice(longerStartIndex + 1);\n}"],"names":["findExpandedKeys","prev","next","prevLen","nextLen","find","shorter","longer","cache","key","keys","getExpandRange","shorterStartIndex","data","shorterEndNode","longerStartIndex","longerEndIndex"],"mappings":"AAAO,SAASA,EAAiBC,IAAO,IAAIC,IAAO,CAAA,GAAI;AACrD,QAAMC,IAAUF,EAAK,QACfG,IAAUF,EAAK;AACrB,MAAI,KAAK,IAAIC,IAAUC,CAAO,MAAM;AAClC,WAAO;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,IACX;AAEE,WAASC,EAAKC,GAASC,GAAQ;AAC7B,UAAMC,IAAQ,oBAAI,IAAG;AACrB,IAAAF,EAAQ,QAAQ,CAAAG,MAAO;AACrB,MAAAD,EAAM,IAAIC,GAAK,EAAI;AAAA,IACrB,CAAC;AACD,UAAMC,IAAOH,EAAO,OAAO,CAAAE,MAAO,CAACD,EAAM,IAAIC,CAAG,CAAC;AACjD,WAAOC,EAAK,WAAW,IAAIA,EAAK,CAAC,IAAI;AAAA,EACvC;AACA,SAAIP,IAAUC,IACL;AAAA,IACL,KAAK;AAAA,IACL,KAAKC,EAAKJ,GAAMC,CAAI;AAAA,EAC1B,IAES;AAAA,IACL,KAAK;AAAA,IACL,KAAKG,EAAKH,GAAMD,CAAI;AAAA,EACxB;AACA;AACO,SAASU,EAAeL,GAASC,GAAQE,GAAK;AACnD,QAAMG,IAAoBN,EAAQ,UAAU,CAAAO,MAAQA,EAAK,QAAQJ,CAAG,GAC9DK,IAAiBR,EAAQM,IAAoB,CAAC,GAC9CG,IAAmBR,EAAO,UAAU,CAAAM,MAAQA,EAAK,QAAQJ,CAAG;AAClE,MAAIK,GAAgB;AAClB,UAAME,IAAiBT,EAAO,UAAU,CAAAM,MAAQA,EAAK,QAAQC,EAAe,GAAG;AAC/E,WAAOP,EAAO,MAAMQ,IAAmB,GAAGC,CAAc;AAAA,EAC1D;AACA,SAAOT,EAAO,MAAMQ,IAAmB,CAAC;AAC1C;","x_google_ignoreList":[0]}

package/dist/node_modules/@rc-component/tree/es/utils/keyUtil.js

@@ -1,7 +0,0 @@
-function n(t, e) {
-  return t[e];
-}
-export {
-  n as default
-};
-//# sourceMappingURL=keyUtil.js.map

package/dist/node_modules/@rc-component/tree/es/utils/keyUtil.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"keyUtil.js","sources":["../../../../../../node_modules/@rc-component/tree/es/utils/keyUtil.js"],"sourcesContent":["export default function getEntity(keyEntities, key) {\n  return keyEntities[key];\n}"],"names":["getEntity","keyEntities","key"],"mappings":"AAAe,SAASA,EAAUC,GAAaC,GAAK;AAClD,SAAOD,EAAYC,CAAG;AACxB;","x_google_ignoreList":[0]}

package/dist/node_modules/@rc-component/tree/es/utils/treeUtil.js

@@ -1,245 +0,0 @@
-import N from "../../../util/es/Children/toArray.js";
-import P from "../../../util/es/omit.js";
-import { warningOnce as x } from "../../../util/es/warning.js";
-import S from "./keyUtil.js";
-function k(e, t) {
-  return `${e}-${t}`;
-}
-function C(e) {
-  return e && e.type && e.type.isTreeNode;
-}
-function K(e, t) {
-  return e ?? t;
-}
-function E(e) {
-  const {
-    title: t,
-    _title: d,
-    key: r,
-    children: o
-  } = e || {}, i = t || "title";
-  return {
-    title: i,
-    _title: d || [i],
-    key: r || "key",
-    children: o || "children"
-  };
-}
-function _(e, t) {
-  const d = /* @__PURE__ */ new Map();
-  function r(o, i = "") {
-    (o || []).forEach((p) => {
-      const l = p[t.key], f = p[t.children];
-      x(l != null, `Tree node must have a certain key: [${i}${l}]`);
-      const c = String(l);
-      x(!d.has(c) || l === null || l === void 0, `Same 'key' exist in the Tree: ${c}`), d.set(c, !0), r(f, `${i}${c} > `);
-    });
-  }
-  r(e);
-}
-function B(e) {
-  function t(d) {
-    return N(d).map((o) => {
-      if (!C(o))
-        return x(!o, "Tree/TreeNode can only accept TreeNode as children."), null;
-      const {
-        key: i
-      } = o, {
-        children: p,
-        ...l
-      } = o.props, f = {
-        key: i,
-        ...l
-      }, c = t(p);
-      return c.length && (f.children = c), f;
-    }).filter((o) => o);
-  }
-  return t(e);
-}
-function A(e, t, d) {
-  const {
-    _title: r,
-    key: o,
-    children: i
-  } = E(d), p = new Set(t === !0 ? [] : t), l = [];
-  function f(c, s = null) {
-    return c.map((a, n) => {
-      const g = k(s ? s.pos : "0", n), u = K(a[o], g);
-      let v;
-      for (let y = 0; y < r.length; y += 1) {
-        const T = r[y];
-        if (a[T] !== void 0) {
-          v = a[T];
-          break;
-        }
-      }
-      const m = Object.assign(P(a, [...r, o, i]), {
-        title: v,
-        key: u,
-        parent: s,
-        pos: g,
-        children: null,
-        data: a,
-        isStart: [...s ? s.isStart : [], n === 0],
-        isEnd: [...s ? s.isEnd : [], n === c.length - 1]
-      });
-      return l.push(m), t === !0 || p.has(u) ? m.children = f(a[i] || [], m) : m.children = [], m;
-    });
-  }
-  return f(e), l;
-}
-function $(e, t, d) {
-  let r = {};
-  typeof d == "object" ? r = d : r = {
-    externalGetKey: d
-  }, r = r || {};
-  const {
-    childrenPropName: o,
-    externalGetKey: i,
-    fieldNames: p
-  } = r, {
-    key: l,
-    children: f
-  } = E(p), c = o || f;
-  let s;
-  i ? typeof i == "string" ? s = (n) => n[i] : typeof i == "function" && (s = (n) => i(n)) : s = (n, g) => K(n[l], g);
-  function a(n, g, u, v) {
-    const m = n ? n[c] : e, y = n ? k(u.pos, g) : "0", T = n ? [...v, n] : [];
-    if (n) {
-      const O = s(n, y), h = {
-        node: n,
-        index: g,
-        pos: y,
-        key: O,
-        parentPos: u.node ? u.pos : null,
-        level: u.level + 1,
-        nodes: T
-      };
-      t(h);
-    }
-    m && m.forEach((O, h) => {
-      a(O, h, {
-        node: n,
-        pos: y,
-        level: u ? u.level + 1 : -1
-      }, T);
-    });
-  }
-  a(null);
-}
-function L(e, {
-  initWrapper: t,
-  processEntity: d,
-  onProcessFinished: r,
-  externalGetKey: o,
-  childrenPropName: i,
-  fieldNames: p
-} = {}, l) {
-  const f = o || l, c = {}, s = {};
-  let a = {
-    posEntities: c,
-    keyEntities: s
-  };
-  return t && (a = t(a) || a), $(e, (n) => {
-    const {
-      node: g,
-      index: u,
-      pos: v,
-      key: m,
-      parentPos: y,
-      level: T,
-      nodes: O
-    } = n, h = {
-      node: g,
-      nodes: O,
-      index: u,
-      key: m,
-      pos: v,
-      level: T
-    }, G = K(m, v);
-    c[v] = h, s[G] = h, h.parent = c[y], h.parent && (h.parent.children = h.parent.children || [], h.parent.children.push(h)), d && d(h, a);
-  }, {
-    externalGetKey: f,
-    childrenPropName: i,
-    fieldNames: p
-  }), r && r(a), a;
-}
-function M(e, {
-  expandedKeys: t,
-  selectedKeys: d,
-  loadedKeys: r,
-  loadingKeys: o,
-  checkedKeys: i,
-  halfCheckedKeys: p,
-  dragOverNodeKey: l,
-  dropPosition: f,
-  keyEntities: c
-}) {
-  const s = S(c, e);
-  return {
-    eventKey: e,
-    expanded: t.indexOf(e) !== -1,
-    selected: d.indexOf(e) !== -1,
-    loaded: r.indexOf(e) !== -1,
-    loading: o.indexOf(e) !== -1,
-    checked: i.indexOf(e) !== -1,
-    halfChecked: p.indexOf(e) !== -1,
-    pos: String(s ? s.pos : ""),
-    // [Legacy] Drag props
-    // Since the interaction of drag is changed, the semantic of the props are
-    // not accuracy, I think it should be finally removed
-    dragOver: l === e && f === 0,
-    dragOverGapTop: l === e && f === -1,
-    dragOverGapBottom: l === e && f === 1
-  };
-}
-function q(e) {
-  const {
-    data: t,
-    expanded: d,
-    selected: r,
-    checked: o,
-    loaded: i,
-    loading: p,
-    halfChecked: l,
-    dragOver: f,
-    dragOverGapTop: c,
-    dragOverGapBottom: s,
-    pos: a,
-    active: n,
-    eventKey: g
-  } = e, u = {
-    ...t,
-    expanded: d,
-    selected: r,
-    checked: o,
-    loaded: i,
-    loading: p,
-    halfChecked: l,
-    dragOver: f,
-    dragOverGapTop: c,
-    dragOverGapBottom: s,
-    pos: a,
-    active: n,
-    key: g
-  };
-  return "props" in u || Object.defineProperty(u, "props", {
-    get() {
-      return x(!1, "Second param return from event is node data instead of TreeNode instance. Please read value directly instead of reading from `props`."), e;
-    }
-  }), u;
-}
-export {
-  L as convertDataToEntities,
-  q as convertNodePropsToEventData,
-  B as convertTreeToData,
-  E as fillFieldNames,
-  A as flattenTreeData,
-  K as getKey,
-  k as getPosition,
-  M as getTreeNodeProps,
-  C as isTreeNode,
-  $ as traverseDataNodes,
-  _ as warningWithoutKey
-};
-//# sourceMappingURL=treeUtil.js.map

package/dist/node_modules/@rc-component/tree/es/utils/treeUtil.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"treeUtil.js","sources":["../../../../../../node_modules/@rc-component/tree/es/utils/treeUtil.js"],"sourcesContent":["import toArray from \"@rc-component/util/es/Children/toArray\";\nimport omit from \"@rc-component/util/es/omit\";\nimport warning from \"@rc-component/util/es/warning\";\nimport getEntity from \"./keyUtil\";\nexport function getPosition(level, index) {\n  return `${level}-${index}`;\n}\nexport function isTreeNode(node) {\n  return node && node.type && node.type.isTreeNode;\n}\nexport function getKey(key, pos) {\n  if (key !== null && key !== undefined) {\n    return key;\n  }\n  return pos;\n}\nexport function fillFieldNames(fieldNames) {\n  const {\n    title,\n    _title,\n    key,\n    children\n  } = fieldNames || {};\n  const mergedTitle = title || 'title';\n  return {\n    title: mergedTitle,\n    _title: _title || [mergedTitle],\n    key: key || 'key',\n    children: children || 'children'\n  };\n}\n\n/**\n * Warning if TreeNode do not provides key\n */\nexport function warningWithoutKey(treeData, fieldNames) {\n  const keys = new Map();\n  function dig(list, path = '') {\n    (list || []).forEach(treeNode => {\n      const key = treeNode[fieldNames.key];\n      const children = treeNode[fieldNames.children];\n      warning(key !== null && key !== undefined, `Tree node must have a certain key: [${path}${key}]`);\n      const recordKey = String(key);\n      warning(!keys.has(recordKey) || key === null || key === undefined, `Same 'key' exist in the Tree: ${recordKey}`);\n      keys.set(recordKey, true);\n      dig(children, `${path}${recordKey} > `);\n    });\n  }\n  dig(treeData);\n}\n\n/**\n * Convert `children` of Tree into `treeData` structure.\n */\nexport function convertTreeToData(rootNodes) {\n  function dig(node) {\n    const treeNodes = toArray(node);\n    return treeNodes.map(treeNode => {\n      // Filter invalidate node\n      if (!isTreeNode(treeNode)) {\n        warning(!treeNode, 'Tree/TreeNode can only accept TreeNode as children.');\n        return null;\n      }\n      const {\n        key\n      } = treeNode;\n      const {\n        children,\n        ...rest\n      } = treeNode.props;\n      const dataNode = {\n        key: key,\n        ...rest\n      };\n      const parsedChildren = dig(children);\n      if (parsedChildren.length) {\n        dataNode.children = parsedChildren;\n      }\n      return dataNode;\n    }).filter(dataNode => dataNode);\n  }\n  return dig(rootNodes);\n}\n\n/**\n * Flat nest tree data into flatten list. This is used for virtual list render.\n * @param treeNodeList Origin data node list\n * @param expandedKeys\n * need expanded keys, provides `true` means all expanded (used in `rc-tree-select`).\n */\nexport function flattenTreeData(treeNodeList, expandedKeys, fieldNames) {\n  const {\n    _title: fieldTitles,\n    key: fieldKey,\n    children: fieldChildren\n  } = fillFieldNames(fieldNames);\n  const expandedKeySet = new Set(expandedKeys === true ? [] : expandedKeys);\n  const flattenList = [];\n  function dig(list, parent = null) {\n    return list.map((treeNode, index) => {\n      const pos = getPosition(parent ? parent.pos : '0', index);\n      const mergedKey = getKey(treeNode[fieldKey], pos);\n\n      // Pick matched title in field title list\n      let mergedTitle;\n      for (let i = 0; i < fieldTitles.length; i += 1) {\n        const fieldTitle = fieldTitles[i];\n        if (treeNode[fieldTitle] !== undefined) {\n          mergedTitle = treeNode[fieldTitle];\n          break;\n        }\n      }\n\n      // Add FlattenDataNode into list\n      // We use `Object.assign` here to save perf since babel's `objectSpread` has perf issue\n      const flattenNode = Object.assign(omit(treeNode, [...fieldTitles, fieldKey, fieldChildren]), {\n        title: mergedTitle,\n        key: mergedKey,\n        parent,\n        pos,\n        children: null,\n        data: treeNode,\n        isStart: [...(parent ? parent.isStart : []), index === 0],\n        isEnd: [...(parent ? parent.isEnd : []), index === list.length - 1]\n      });\n      flattenList.push(flattenNode);\n\n      // Loop treeNode children\n      if (expandedKeys === true || expandedKeySet.has(mergedKey)) {\n        flattenNode.children = dig(treeNode[fieldChildren] || [], flattenNode);\n      } else {\n        flattenNode.children = [];\n      }\n      return flattenNode;\n    });\n  }\n  dig(treeNodeList);\n  return flattenList;\n}\n/**\n * Traverse all the data by `treeData`.\n * Please not use it out of the `rc-tree` since we may refactor this code.\n */\nexport function traverseDataNodes(dataNodes, callback,\n// To avoid too many params, let use config instead of origin param\nconfig) {\n  let mergedConfig = {};\n  if (typeof config === 'object') {\n    mergedConfig = config;\n  } else {\n    mergedConfig = {\n      externalGetKey: config\n    };\n  }\n  mergedConfig = mergedConfig || {};\n\n  // Init config\n  const {\n    childrenPropName,\n    externalGetKey,\n    fieldNames\n  } = mergedConfig;\n  const {\n    key: fieldKey,\n    children: fieldChildren\n  } = fillFieldNames(fieldNames);\n  const mergeChildrenPropName = childrenPropName || fieldChildren;\n\n  // Get keys\n  let syntheticGetKey;\n  if (externalGetKey) {\n    if (typeof externalGetKey === 'string') {\n      syntheticGetKey = node => node[externalGetKey];\n    } else if (typeof externalGetKey === 'function') {\n      syntheticGetKey = node => externalGetKey(node);\n    }\n  } else {\n    syntheticGetKey = (node, pos) => getKey(node[fieldKey], pos);\n  }\n\n  // Process\n  function processNode(node, index, parent, pathNodes) {\n    const children = node ? node[mergeChildrenPropName] : dataNodes;\n    const pos = node ? getPosition(parent.pos, index) : '0';\n    const connectNodes = node ? [...pathNodes, node] : [];\n\n    // Process node if is not root\n    if (node) {\n      const key = syntheticGetKey(node, pos);\n      const data = {\n        node,\n        index,\n        pos,\n        key,\n        parentPos: parent.node ? parent.pos : null,\n        level: parent.level + 1,\n        nodes: connectNodes\n      };\n      callback(data);\n    }\n\n    // Process children node\n    if (children) {\n      children.forEach((subNode, subIndex) => {\n        processNode(subNode, subIndex, {\n          node,\n          pos,\n          level: parent ? parent.level + 1 : -1\n        }, connectNodes);\n      });\n    }\n  }\n  processNode(null);\n}\n/**\n * Convert `treeData` into entity records.\n */\nexport function convertDataToEntities(dataNodes, {\n  initWrapper,\n  processEntity,\n  onProcessFinished,\n  externalGetKey,\n  childrenPropName,\n  fieldNames\n} = {}, /** @deprecated Use `config.externalGetKey` instead */\nlegacyExternalGetKey) {\n  // Init config\n  const mergedExternalGetKey = externalGetKey || legacyExternalGetKey;\n  const posEntities = {};\n  const keyEntities = {};\n  let wrapper = {\n    posEntities,\n    keyEntities\n  };\n  if (initWrapper) {\n    wrapper = initWrapper(wrapper) || wrapper;\n  }\n  traverseDataNodes(dataNodes, item => {\n    const {\n      node,\n      index,\n      pos,\n      key,\n      parentPos,\n      level,\n      nodes\n    } = item;\n    const entity = {\n      node,\n      nodes,\n      index,\n      key,\n      pos,\n      level\n    };\n    const mergedKey = getKey(key, pos);\n    posEntities[pos] = entity;\n    keyEntities[mergedKey] = entity;\n\n    // Fill children\n    entity.parent = posEntities[parentPos];\n    if (entity.parent) {\n      entity.parent.children = entity.parent.children || [];\n      entity.parent.children.push(entity);\n    }\n    if (processEntity) {\n      processEntity(entity, wrapper);\n    }\n  }, {\n    externalGetKey: mergedExternalGetKey,\n    childrenPropName,\n    fieldNames\n  });\n  if (onProcessFinished) {\n    onProcessFinished(wrapper);\n  }\n  return wrapper;\n}\n/**\n * Get TreeNode props with Tree props.\n */\nexport function getTreeNodeProps(key, {\n  expandedKeys,\n  selectedKeys,\n  loadedKeys,\n  loadingKeys,\n  checkedKeys,\n  halfCheckedKeys,\n  dragOverNodeKey,\n  dropPosition,\n  keyEntities\n}) {\n  const entity = getEntity(keyEntities, key);\n  const treeNodeProps = {\n    eventKey: key,\n    expanded: expandedKeys.indexOf(key) !== -1,\n    selected: selectedKeys.indexOf(key) !== -1,\n    loaded: loadedKeys.indexOf(key) !== -1,\n    loading: loadingKeys.indexOf(key) !== -1,\n    checked: checkedKeys.indexOf(key) !== -1,\n    halfChecked: halfCheckedKeys.indexOf(key) !== -1,\n    pos: String(entity ? entity.pos : ''),\n    // [Legacy] Drag props\n    // Since the interaction of drag is changed, the semantic of the props are\n    // not accuracy, I think it should be finally removed\n    dragOver: dragOverNodeKey === key && dropPosition === 0,\n    dragOverGapTop: dragOverNodeKey === key && dropPosition === -1,\n    dragOverGapBottom: dragOverNodeKey === key && dropPosition === 1\n  };\n  return treeNodeProps;\n}\nexport function convertNodePropsToEventData(props) {\n  const {\n    data,\n    expanded,\n    selected,\n    checked,\n    loaded,\n    loading,\n    halfChecked,\n    dragOver,\n    dragOverGapTop,\n    dragOverGapBottom,\n    pos,\n    active,\n    eventKey\n  } = props;\n  const eventData = {\n    ...data,\n    expanded,\n    selected,\n    checked,\n    loaded,\n    loading,\n    halfChecked,\n    dragOver,\n    dragOverGapTop,\n    dragOverGapBottom,\n    pos,\n    active,\n    key: eventKey\n  };\n  if (!('props' in eventData)) {\n    Object.defineProperty(eventData, 'props', {\n      get() {\n        warning(false, 'Second param return from event is node data instead of TreeNode instance. Please read value directly instead of reading from `props`.');\n        return props;\n      }\n    });\n  }\n  return eventData;\n}"],"names":["getPosition","level","index","isTreeNode","node","getKey","key","pos","fillFieldNames","fieldNames","title","_title","children","mergedTitle","warningWithoutKey","treeData","keys","dig","list","path","treeNode","warning","recordKey","convertTreeToData","rootNodes","toArray","rest","dataNode","parsedChildren","flattenTreeData","treeNodeList","expandedKeys","fieldTitles","fieldKey","fieldChildren","expandedKeySet","flattenList","parent","mergedKey","i","fieldTitle","flattenNode","omit","traverseDataNodes","dataNodes","callback","config","mergedConfig","childrenPropName","externalGetKey","mergeChildrenPropName","syntheticGetKey","processNode","pathNodes","connectNodes","data","subNode","subIndex","convertDataToEntities","initWrapper","processEntity","onProcessFinished","legacyExternalGetKey","mergedExternalGetKey","posEntities","keyEntities","wrapper","item","parentPos","nodes","entity","getTreeNodeProps","selectedKeys","loadedKeys","loadingKeys","checkedKeys","halfCheckedKeys","dragOverNodeKey","dropPosition","getEntity","convertNodePropsToEventData","props","expanded","selected","checked","loaded","loading","halfChecked","dragOver","dragOverGapTop","dragOverGapBottom","active","eventKey","eventData"],"mappings":";;;;AAIO,SAASA,EAAYC,GAAOC,GAAO;AACxC,SAAO,GAAGD,CAAK,IAAIC,CAAK;AAC1B;AACO,SAASC,EAAWC,GAAM;AAC/B,SAAOA,KAAQA,EAAK,QAAQA,EAAK,KAAK;AACxC;AACO,SAASC,EAAOC,GAAKC,GAAK;AAC/B,SAAID,KAGGC;AACT;AACO,SAASC,EAAeC,GAAY;AACzC,QAAM;AAAA,IACJ,OAAAC;AAAA,IACA,QAAAC;AAAA,IACA,KAAAL;AAAA,IACA,UAAAM;AAAA,EACJ,IAAMH,KAAc,CAAA,GACZI,IAAcH,KAAS;AAC7B,SAAO;AAAA,IACL,OAAOG;AAAA,IACP,QAAQF,KAAU,CAACE,CAAW;AAAA,IAC9B,KAAKP,KAAO;AAAA,IACZ,UAAUM,KAAY;AAAA,EAC1B;AACA;AAKO,SAASE,EAAkBC,GAAUN,GAAY;AACtD,QAAMO,IAAO,oBAAI,IAAG;AACpB,WAASC,EAAIC,GAAMC,IAAO,IAAI;AAC5B,KAACD,KAAQ,CAAA,GAAI,QAAQ,CAAAE,MAAY;AAC/B,YAAMd,IAAMc,EAASX,EAAW,GAAG,GAC7BG,IAAWQ,EAASX,EAAW,QAAQ;AAC7CY,MAAAA,EAAQf,KAAQ,MAA2B,uCAAuCa,CAAI,GAAGb,CAAG,GAAG;AAC/F,YAAMgB,IAAY,OAAOhB,CAAG;AAC5Be,MAAAA,EAAQ,CAACL,EAAK,IAAIM,CAAS,KAAKhB,MAAQ,QAAQA,MAAQ,QAAW,iCAAiCgB,CAAS,EAAE,GAC/GN,EAAK,IAAIM,GAAW,EAAI,GACxBL,EAAIL,GAAU,GAAGO,CAAI,GAAGG,CAAS,KAAK;AAAA,IACxC,CAAC;AAAA,EACH;AACA,EAAAL,EAAIF,CAAQ;AACd;AAKO,SAASQ,EAAkBC,GAAW;AAC3C,WAASP,EAAIb,GAAM;AAEjB,WADkBqB,EAAQrB,CAAI,EACb,IAAI,CAAAgB,MAAY;AAE/B,UAAI,CAACjB,EAAWiB,CAAQ;AACtBC,eAAAA,EAAQ,CAACD,GAAU,qDAAqD,GACjE;AAET,YAAM;AAAA,QACJ,KAAAd;AAAA,MACR,IAAUc,GACE;AAAA,QACJ,UAAAR;AAAA,QACA,GAAGc;AAAA,MACX,IAAUN,EAAS,OACPO,IAAW;AAAA,QACf,KAAKrB;AAAA,QACL,GAAGoB;AAAA,MACX,GACYE,IAAiBX,EAAIL,CAAQ;AACnC,aAAIgB,EAAe,WACjBD,EAAS,WAAWC,IAEfD;AAAA,IACT,CAAC,EAAE,OAAO,CAAAA,MAAYA,CAAQ;AAAA,EAChC;AACA,SAAOV,EAAIO,CAAS;AACtB;AAQO,SAASK,EAAgBC,GAAcC,GAActB,GAAY;AACtE,QAAM;AAAA,IACJ,QAAQuB;AAAA,IACR,KAAKC;AAAA,IACL,UAAUC;AAAA,EACd,IAAM1B,EAAeC,CAAU,GACvB0B,IAAiB,IAAI,IAAIJ,MAAiB,KAAO,CAAA,IAAKA,CAAY,GAClEK,IAAc,CAAA;AACpB,WAASnB,EAAIC,GAAMmB,IAAS,MAAM;AAChC,WAAOnB,EAAK,IAAI,CAACE,GAAUlB,MAAU;AACnC,YAAMK,IAAMP,EAAYqC,IAASA,EAAO,MAAM,KAAKnC,CAAK,GAClDoC,IAAYjC,EAAOe,EAASa,CAAQ,GAAG1B,CAAG;AAGhD,UAAIM;AACJ,eAAS0B,IAAI,GAAGA,IAAIP,EAAY,QAAQO,KAAK,GAAG;AAC9C,cAAMC,IAAaR,EAAYO,CAAC;AAChC,YAAInB,EAASoB,CAAU,MAAM,QAAW;AACtC,UAAA3B,IAAcO,EAASoB,CAAU;AACjC;AAAA,QACF;AAAA,MACF;AAIA,YAAMC,IAAc,OAAO,OAAOC,EAAKtB,GAAU,CAAC,GAAGY,GAAaC,GAAUC,CAAa,CAAC,GAAG;AAAA,QAC3F,OAAOrB;AAAA,QACP,KAAKyB;AAAA,QACL,QAAAD;AAAA,QACA,KAAA9B;AAAA,QACA,UAAU;AAAA,QACV,MAAMa;AAAA,QACN,SAAS,CAAC,GAAIiB,IAASA,EAAO,UAAU,IAAKnC,MAAU,CAAC;AAAA,QACxD,OAAO,CAAC,GAAImC,IAASA,EAAO,QAAQ,CAAA,GAAKnC,MAAUgB,EAAK,SAAS,CAAC;AAAA,MAC1E,CAAO;AACD,aAAAkB,EAAY,KAAKK,CAAW,GAGxBV,MAAiB,MAAQI,EAAe,IAAIG,CAAS,IACvDG,EAAY,WAAWxB,EAAIG,EAASc,CAAa,KAAK,CAAA,GAAIO,CAAW,IAErEA,EAAY,WAAW,CAAA,GAElBA;AAAA,IACT,CAAC;AAAA,EACH;AACA,SAAAxB,EAAIa,CAAY,GACTM;AACT;AAKO,SAASO,EAAkBC,GAAWC,GAE7CC,GAAQ;AACN,MAAIC,IAAe,CAAA;AACnB,EAAI,OAAOD,KAAW,WACpBC,IAAeD,IAEfC,IAAe;AAAA,IACb,gBAAgBD;AAAA,EACtB,GAEEC,IAAeA,KAAgB,CAAA;AAG/B,QAAM;AAAA,IACJ,kBAAAC;AAAA,IACA,gBAAAC;AAAA,IACA,YAAAxC;AAAA,EACJ,IAAMsC,GACE;AAAA,IACJ,KAAKd;AAAA,IACL,UAAUC;AAAA,EACd,IAAM1B,EAAeC,CAAU,GACvByC,IAAwBF,KAAoBd;AAGlD,MAAIiB;AACJ,EAAIF,IACE,OAAOA,KAAmB,WAC5BE,IAAkB,CAAA/C,MAAQA,EAAK6C,CAAc,IACpC,OAAOA,KAAmB,eACnCE,IAAkB,CAAA/C,MAAQ6C,EAAe7C,CAAI,KAG/C+C,IAAkB,CAAC/C,GAAMG,MAAQF,EAAOD,EAAK6B,CAAQ,GAAG1B,CAAG;AAI7D,WAAS6C,EAAYhD,GAAMF,GAAOmC,GAAQgB,GAAW;AACnD,UAAMzC,IAAWR,IAAOA,EAAK8C,CAAqB,IAAIN,GAChDrC,IAAMH,IAAOJ,EAAYqC,EAAO,KAAKnC,CAAK,IAAI,KAC9CoD,IAAelD,IAAO,CAAC,GAAGiD,GAAWjD,CAAI,IAAI,CAAA;AAGnD,QAAIA,GAAM;AACR,YAAME,IAAM6C,EAAgB/C,GAAMG,CAAG,GAC/BgD,IAAO;AAAA,QACX,MAAAnD;AAAA,QACA,OAAAF;AAAA,QACA,KAAAK;AAAA,QACA,KAAAD;AAAA,QACA,WAAW+B,EAAO,OAAOA,EAAO,MAAM;AAAA,QACtC,OAAOA,EAAO,QAAQ;AAAA,QACtB,OAAOiB;AAAA,MACf;AACM,MAAAT,EAASU,CAAI;AAAA,IACf;AAGA,IAAI3C,KACFA,EAAS,QAAQ,CAAC4C,GAASC,MAAa;AACtC,MAAAL,EAAYI,GAASC,GAAU;AAAA,QAC7B,MAAArD;AAAA,QACA,KAAAG;AAAA,QACA,OAAO8B,IAASA,EAAO,QAAQ,IAAI;AAAA,MAC7C,GAAWiB,CAAY;AAAA,IACjB,CAAC;AAAA,EAEL;AACA,EAAAF,EAAY,IAAI;AAClB;AAIO,SAASM,EAAsBd,GAAW;AAAA,EAC/C,aAAAe;AAAA,EACA,eAAAC;AAAA,EACA,mBAAAC;AAAA,EACA,gBAAAZ;AAAA,EACA,kBAAAD;AAAA,EACA,YAAAvC;AACF,IAAI,CAAA,GACJqD,GAAsB;AAEpB,QAAMC,IAAuBd,KAAkBa,GACzCE,IAAc,CAAA,GACdC,IAAc,CAAA;AACpB,MAAIC,IAAU;AAAA,IACZ,aAAAF;AAAA,IACA,aAAAC;AAAA,EACJ;AACE,SAAIN,MACFO,IAAUP,EAAYO,CAAO,KAAKA,IAEpCvB,EAAkBC,GAAW,CAAAuB,MAAQ;AACnC,UAAM;AAAA,MACJ,MAAA/D;AAAA,MACA,OAAAF;AAAA,MACA,KAAAK;AAAA,MACA,KAAAD;AAAA,MACA,WAAA8D;AAAA,MACA,OAAAnE;AAAA,MACA,OAAAoE;AAAA,IACN,IAAQF,GACEG,IAAS;AAAA,MACb,MAAAlE;AAAA,MACA,OAAAiE;AAAA,MACA,OAAAnE;AAAA,MACA,KAAAI;AAAA,MACA,KAAAC;AAAA,MACA,OAAAN;AAAA,IACN,GACUqC,IAAYjC,EAAOC,GAAKC,CAAG;AACjC,IAAAyD,EAAYzD,CAAG,IAAI+D,GACnBL,EAAY3B,CAAS,IAAIgC,GAGzBA,EAAO,SAASN,EAAYI,CAAS,GACjCE,EAAO,WACTA,EAAO,OAAO,WAAWA,EAAO,OAAO,YAAY,CAAA,GACnDA,EAAO,OAAO,SAAS,KAAKA,CAAM,IAEhCV,KACFA,EAAcU,GAAQJ,CAAO;AAAA,EAEjC,GAAG;AAAA,IACD,gBAAgBH;AAAA,IAChB,kBAAAf;AAAA,IACA,YAAAvC;AAAA,EACJ,CAAG,GACGoD,KACFA,EAAkBK,CAAO,GAEpBA;AACT;AAIO,SAASK,EAAiBjE,GAAK;AAAA,EACpC,cAAAyB;AAAA,EACA,cAAAyC;AAAA,EACA,YAAAC;AAAA,EACA,aAAAC;AAAA,EACA,aAAAC;AAAA,EACA,iBAAAC;AAAA,EACA,iBAAAC;AAAA,EACA,cAAAC;AAAA,EACA,aAAAb;AACF,GAAG;AACD,QAAMK,IAASS,EAAUd,GAAa3D,CAAG;AAiBzC,SAhBsB;AAAA,IACpB,UAAUA;AAAA,IACV,UAAUyB,EAAa,QAAQzB,CAAG,MAAM;AAAA,IACxC,UAAUkE,EAAa,QAAQlE,CAAG,MAAM;AAAA,IACxC,QAAQmE,EAAW,QAAQnE,CAAG,MAAM;AAAA,IACpC,SAASoE,EAAY,QAAQpE,CAAG,MAAM;AAAA,IACtC,SAASqE,EAAY,QAAQrE,CAAG,MAAM;AAAA,IACtC,aAAasE,EAAgB,QAAQtE,CAAG,MAAM;AAAA,IAC9C,KAAK,OAAOgE,IAASA,EAAO,MAAM,EAAE;AAAA;AAAA;AAAA;AAAA,IAIpC,UAAUO,MAAoBvE,KAAOwE,MAAiB;AAAA,IACtD,gBAAgBD,MAAoBvE,KAAOwE,MAAiB;AAAA,IAC5D,mBAAmBD,MAAoBvE,KAAOwE,MAAiB;AAAA,EACnE;AAEA;AACO,SAASE,EAA4BC,GAAO;AACjD,QAAM;AAAA,IACJ,MAAA1B;AAAA,IACA,UAAA2B;AAAA,IACA,UAAAC;AAAA,IACA,SAAAC;AAAA,IACA,QAAAC;AAAA,IACA,SAAAC;AAAA,IACA,aAAAC;AAAA,IACA,UAAAC;AAAA,IACA,gBAAAC;AAAA,IACA,mBAAAC;AAAA,IACA,KAAAnF;AAAA,IACA,QAAAoF;AAAA,IACA,UAAAC;AAAA,EACJ,IAAMX,GACEY,IAAY;AAAA,IAChB,GAAGtC;AAAA,IACH,UAAA2B;AAAA,IACA,UAAAC;AAAA,IACA,SAAAC;AAAA,IACA,QAAAC;AAAA,IACA,SAAAC;AAAA,IACA,aAAAC;AAAA,IACA,UAAAC;AAAA,IACA,gBAAAC;AAAA,IACA,mBAAAC;AAAA,IACA,KAAAnF;AAAA,IACA,QAAAoF;AAAA,IACA,KAAKC;AAAA,EACT;AACE,SAAM,WAAWC,KACf,OAAO,eAAeA,GAAW,SAAS;AAAA,IACxC,MAAM;AACJxE,aAAAA,EAAQ,IAAO,uIAAuI,GAC/I4D;AAAA,IACT;AAAA,EACN,CAAK,GAEIY;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/@rc-component/tree-select/es/LegacyContext.js

@@ -1,6 +0,0 @@
-import * as t from "react";
-const e = /* @__PURE__ */ t.createContext(null);
-export {
-  e as default
-};
-//# sourceMappingURL=LegacyContext.js.map

package/dist/node_modules/@rc-component/tree-select/es/LegacyContext.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"LegacyContext.js","sources":["../../../../../node_modules/@rc-component/tree-select/es/LegacyContext.js"],"sourcesContent":["import * as React from 'react';\nconst LegacySelectContext = /*#__PURE__*/React.createContext(null);\nexport default LegacySelectContext;"],"names":["LegacySelectContext","React"],"mappings":";AACK,MAACA,IAAmC,gBAAAC,EAAM,cAAc,IAAI;","x_google_ignoreList":[0]}