tntd 2.8.27 → 2.8.29

package/es/tntd-virtual-tree/utils.js

@@ -1,4 +1,17 @@
-var __rest = this && this.__rest || function (s, e) {
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.getNodeValuess = exports.getNodeStr = exports.getNodeParentChoosed = exports.getNodeNoDisabledLastestChildrenValues = exports.getNodeNoDisabledChildrenValues = exports.getIndeterminate = exports.getFullExpandedKeys = exports.getFullCheckedKeys = exports.flatTreeData = exports.findNodeDetail = exports.addTreeNodeAttrs = void 0;
+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 _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 _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 _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 _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; }
+var __rest = void 0 && (void 0).__rest || function (s, e) {
   var t = {};
   for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0) t[p] = s[p];
   if (s != null && typeof Object.getOwnPropertySymbols === "function") for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {
@@ -16,34 +29,34 @@ var __rest = this && this.__rest || function (s, e) {
  * 用于判断后续展开/收起
  * @param {*} treeData
  */
-export const addTreeNodeAttrs = (treeData, fieldNames = {
-  title: 'title',
-  value: 'value',
-  children: 'children',
-  disabled: 'disabled'
-}, needCheckedSiblingsValue = []) => {
+var addTreeNodeAttrs = exports.addTreeNodeAttrs = function addTreeNodeAttrs(treeData) {
+  var fieldNames = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {
+    title: 'title',
+    value: 'value',
+    children: 'children',
+    disabled: 'disabled'
+  };
+  var needCheckedSiblingsValue = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
   if (Array.isArray(treeData) && !!treeData.length) {
-    return treeData.map(item => {
+    return treeData.map(function (item) {
       item.children = item[fieldNames['children']];
       item.title = item[fieldNames['title']];
       item.value = item[fieldNames['value']];
-      const {
-          children
-        } = item,
+      var children = item.children,
         query = __rest(item, ["children"]);
       if (Array.isArray(children) && !!children.length) {
-        let siblingsSum = needCheckedSiblingsValue;
+        var siblingsSum = needCheckedSiblingsValue;
         if (!item[fieldNames['disabled']]) {
           // 这里注意要逆序，要不然校验的时候会出问题
           siblingsSum = [{
             key: item[fieldNames['value']],
-            list: children.reduce((total, item) => {
+            list: children.reduce(function (total, item) {
               if (!item[fieldNames['disabled']]) {
                 total.push(item[fieldNames['value']]);
               }
               return total;
             }, [])
-          }, ...siblingsSum];
+          }].concat(_toConsumableArray(siblingsSum));
         } else {
           siblingsSum = [];
         }
@@ -63,11 +76,12 @@ export const addTreeNodeAttrs = (treeData, fieldNames = {
   }
   return [];
 };
-export const getNodeStr = (node, key, result = []) => {
+var getNodeStr = exports.getNodeStr = function getNodeStr(node, key) {
+  var result = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
   result.push(node[key]);
   if (Array.isArray(node.children) && !!node.children.length) {
-    node.children.forEach(element => {
-      result = [...result, ...getNodeStr(element, key)];
+    node.children.forEach(function (element) {
+      result = [].concat(_toConsumableArray(result), _toConsumableArray(getNodeStr(element, key)));
     });
   }
   return result;
@@ -79,13 +93,15 @@ export const getNodeStr = (node, key, result = []) => {
  * @param {*} result
  * @returns []
  */
-export const getNodeValuess = (node, widthSelf = true, result = []) => {
+var getNodeValuess = exports.getNodeValuess = function getNodeValuess(node) {
+  var widthSelf = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;
+  var result = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
   if (widthSelf) {
     result.push(node.value);
   }
   if (Array.isArray(node.children) && !!node.children.length) {
-    node.children.forEach(element => {
-      result = [...result, ...getNodeValuess(element)];
+    node.children.forEach(function (element) {
+      result = [].concat(_toConsumableArray(result), _toConsumableArray(getNodeValuess(element)));
     });
   }
   return result;
@@ -99,31 +115,45 @@ export const getNodeValuess = (node, widthSelf = true, result = []) => {
  * @param {*} result
  * @returns
  */
-export const flatTreeData = (treeData, filterKey = '', expandedKeys = [], treeDefaultExpandAll = false, indexLevel = 0, result = []) => {
+var flatTreeData = exports.flatTreeData = function flatTreeData(treeData) {
+  var filterKey = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : '';
+  var expandedKeys = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
+  var treeDefaultExpandAll = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : false;
+  var indexLevel = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : 0;
+  var result = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : [];
   if (Array.isArray(treeData)) {
-    for (const i of treeData) {
-      const {
-          value,
-          children,
-          titleTotal,
-          title
-        } = i,
-        rest = __rest(i, ["value", "children", "titleTotal", "title"]);
-      // 判断是否命中过滤
-      let bingo = true;
-      const transFilterKey = !['', null, undefined].includes(filterKey);
-      if (transFilterKey) {
-        bingo = Array.isArray(titleTotal) ? titleTotal.some(i => i.includes(filterKey)) : false;
-      }
-      if (bingo) {
-        result.push(Object.assign({
-          indexLevel
-        }, i));
-      }
-      const selfIn = Array.isArray(expandedKeys) ? expandedKeys.includes(value) : false;
-      if ((treeDefaultExpandAll || selfIn || transFilterKey && bingo) && Array.isArray(children) && !!children.length) {
-        result = [...result, ...flatTreeData(children, filterKey, expandedKeys, treeDefaultExpandAll, indexLevel + 1)];
+    var _iterator = _createForOfIteratorHelper(treeData),
+      _step;
+    try {
+      for (_iterator.s(); !(_step = _iterator.n()).done;) {
+        var i = _step.value;
+        var value = i.value,
+          children = i.children,
+          titleTotal = i.titleTotal,
+          title = i.title,
+          rest = __rest(i, ["value", "children", "titleTotal", "title"]);
+        // 判断是否命中过滤
+        var bingo = true;
+        var transFilterKey = !['', null, undefined].includes(filterKey);
+        if (transFilterKey) {
+          bingo = Array.isArray(titleTotal) ? titleTotal.some(function (i) {
+            return i.includes(filterKey);
+          }) : false;
+        }
+        if (bingo) {
+          result.push(Object.assign({
+            indexLevel: indexLevel
+          }, i));
+        }
+        var selfIn = Array.isArray(expandedKeys) ? expandedKeys.includes(value) : false;
+        if ((treeDefaultExpandAll || selfIn || transFilterKey && bingo) && Array.isArray(children) && !!children.length) {
+          result = [].concat(_toConsumableArray(result), _toConsumableArray(flatTreeData(children, filterKey, expandedKeys, treeDefaultExpandAll, indexLevel + 1)));
+        }
       }
+    } catch (err) {
+      _iterator.e(err);
+    } finally {
+      _iterator.f();
     }
   }
   return result;
@@ -135,20 +165,23 @@ export const flatTreeData = (treeData, filterKey = '', expandedKeys = [], treeDe
  * @param {*} result
  * @returns
  */
-export const getFullExpandedKeys = (treeDataWithKeys, treeExpandedKeys = [], treeDefaultExpandAll, result = []) => {
+var getFullExpandedKeys = exports.getFullExpandedKeys = function getFullExpandedKeys(treeDataWithKeys) {
+  var treeExpandedKeys = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [];
+  var treeDefaultExpandAll = arguments.length > 2 ? arguments[2] : undefined;
+  var result = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : [];
   if (!treeDefaultExpandAll && (!Array.isArray(treeDataWithKeys) || !treeDataWithKeys.length || !Array.isArray(treeExpandedKeys) || !treeExpandedKeys.length)) {
     return [];
   }
-  treeDataWithKeys.forEach(i => {
-    const {
-      childrenValues,
-      value,
-      children
-    } = i;
-    if (treeDefaultExpandAll || Array.isArray(childrenValues) && [...childrenValues, value].some(el => treeExpandedKeys.includes(el))) {
+  treeDataWithKeys.forEach(function (i) {
+    var childrenValues = i.childrenValues,
+      value = i.value,
+      children = i.children;
+    if (treeDefaultExpandAll || Array.isArray(childrenValues) && [].concat(_toConsumableArray(childrenValues), [value]).some(function (el) {
+      return treeExpandedKeys.includes(el);
+    })) {
       result.push(value);
       if (Array.isArray(children) && !!children.length) {
-        result = [...result, ...getFullExpandedKeys(children, treeExpandedKeys, treeDefaultExpandAll)];
+        result = [].concat(_toConsumableArray(result), _toConsumableArray(getFullExpandedKeys(children, treeExpandedKeys, treeDefaultExpandAll)));
       }
     }
   });
@@ -161,27 +194,28 @@ export const getFullExpandedKeys = (treeDataWithKeys, treeExpandedKeys = [], tre
  * @param {*} result
  * @returns
  */
-export const getFullCheckedKeys = (treeDataWithKeys, transCheckedKeys, result = []) => {
+var getFullCheckedKeys = exports.getFullCheckedKeys = function getFullCheckedKeys(treeDataWithKeys, transCheckedKeys) {
+  var result = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
   if (!Array.isArray(treeDataWithKeys) || !treeDataWithKeys.length || !Array.isArray(transCheckedKeys) || !transCheckedKeys.length) {
     return [];
   }
-  treeDataWithKeys.forEach(i => {
-    const {
-      value,
-      children,
-      disabled
-    } = i;
-    const bingo = transCheckedKeys.includes(value);
+  treeDataWithKeys.forEach(function (i) {
+    var value = i.value,
+      children = i.children,
+      disabled = i.disabled;
+    var bingo = transCheckedKeys.includes(value);
     if (bingo) {
       result.push(value);
     }
     if (Array.isArray(children) && !!children.length) {
-      const lastestUnDisabledChildrenValues = i.needCheckedLastestChildrenValues;
+      var lastestUnDisabledChildrenValues = i.needCheckedLastestChildrenValues;
       // 如果当前节点是被命中，就将其下面所有子节点都选中
-      if (Array.isArray(lastestUnDisabledChildrenValues) && !!lastestUnDisabledChildrenValues.length && lastestUnDisabledChildrenValues.every(el => transCheckedKeys.includes(el))) {
+      if (Array.isArray(lastestUnDisabledChildrenValues) && !!lastestUnDisabledChildrenValues.length && lastestUnDisabledChildrenValues.every(function (el) {
+        return transCheckedKeys.includes(el);
+      })) {
         result.push(value);
       }
-      result = [...result, ...getFullCheckedKeys(children, transCheckedKeys)];
+      result = [].concat(_toConsumableArray(result), _toConsumableArray(getFullCheckedKeys(children, transCheckedKeys)));
     }
   });
   return result;
@@ -192,11 +226,12 @@ export const getFullCheckedKeys = (treeDataWithKeys, transCheckedKeys, result =
  * @param {*} node
  * @returns
  */
-export const getNodeNoDisabledLastestChildrenValues = (node, fieldNames, result = []) => {
+var getNodeNoDisabledLastestChildrenValues = exports.getNodeNoDisabledLastestChildrenValues = function getNodeNoDisabledLastestChildrenValues(node, fieldNames) {
+  var result = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
   if (Array.isArray(node.children) && !!node.children.length) {
-    node.children.forEach(element => {
+    node.children.forEach(function (element) {
       if (!element[fieldNames['disabled']]) {
-        result = [...result, ...getNodeNoDisabledLastestChildrenValues(element, fieldNames)];
+        result = [].concat(_toConsumableArray(result), _toConsumableArray(getNodeNoDisabledLastestChildrenValues(element, fieldNames)));
       }
     });
   } else {
@@ -212,12 +247,13 @@ export const getNodeNoDisabledLastestChildrenValues = (node, fieldNames, result
  * @param {*} node
  * @returns
  */
-export const getNodeNoDisabledChildrenValues = (node, fieldNames, result = []) => {
+var getNodeNoDisabledChildrenValues = exports.getNodeNoDisabledChildrenValues = function getNodeNoDisabledChildrenValues(node, fieldNames) {
+  var result = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
   if (Array.isArray(node.children) && !!node.children.length) {
-    node.children.forEach(element => {
+    node.children.forEach(function (element) {
       if (!element[fieldNames['disabled']]) {
         result.push(element[fieldNames['value']]);
-        result = [...result, ...getNodeNoDisabledChildrenValues(element, fieldNames)];
+        result = [].concat(_toConsumableArray(result), _toConsumableArray(getNodeNoDisabledChildrenValues(element, fieldNames)));
       }
     });
   } else {
@@ -232,7 +268,7 @@ export const getNodeNoDisabledChildrenValues = (node, fieldNames, result = []) =
  * @param {*} item
  * @param {*} checkedList
  */
-export const getIndeterminate = (item, checkedList, disabledList) => {
+var getIndeterminate = exports.getIndeterminate = function getIndeterminate(item, checkedList, disabledList) {
   // 如果没有子节点,就没有半选情况
   if (!Array.isArray(item.children) || !item.children.length) {
     return false;
@@ -241,8 +277,10 @@ export const getIndeterminate = (item, checkedList, disabledList) => {
     return false;
   }
   // 当前节点下的去掉disabled的所有末级节点
-  const list = Array.isArray(item.needCheckedLastestChildrenValues) ? item.needCheckedLastestChildrenValues : [];
-  const childrenCheckedList = list.filter(i => checkedList === null || checkedList === void 0 ? void 0 : checkedList.includes(i));
+  var list = Array.isArray(item.needCheckedLastestChildrenValues) ? item.needCheckedLastestChildrenValues : [];
+  var childrenCheckedList = list.filter(function (i) {
+    return checkedList === null || checkedList === void 0 ? void 0 : checkedList.includes(i);
+  });
   return childrenCheckedList.length > 0 && childrenCheckedList.length < list.length;
 };
 /**
@@ -251,22 +289,32 @@ export const getIndeterminate = (item, checkedList, disabledList) => {
  * @param {*} checkedList
  * @returns
  */
-export const getNodeParentChoosed = (needCheckedSiblingsValue, checkedList) => {
+var getNodeParentChoosed = exports.getNodeParentChoosed = function getNodeParentChoosed(needCheckedSiblingsValue, checkedList) {
   if (!Array.isArray(checkedList) || !checkedList.length) {
     return [];
   }
-  let result = [];
-  for (let item of needCheckedSiblingsValue) {
-    const {
-      key,
-      list
-    } = item || {};
-    // 过滤掉子节点为disabled的
-    const bool = Array.isArray(list) ? list.every(it => checkedList.includes(it)) : false;
-    if (bool) {
-      checkedList.push(key);
-      result.push(key);
+  var result = [];
+  var _iterator2 = _createForOfIteratorHelper(needCheckedSiblingsValue),
+    _step2;
+  try {
+    for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
+      var item = _step2.value;
+      var _ref = item || {},
+        key = _ref.key,
+        list = _ref.list;
+      // 过滤掉子节点为disabled的
+      var bool = Array.isArray(list) ? list.every(function (it) {
+        return checkedList.includes(it);
+      }) : false;
+      if (bool) {
+        checkedList.push(key);
+        result.push(key);
+      }
     }
+  } catch (err) {
+    _iterator2.e(err);
+  } finally {
+    _iterator2.f();
   }
   return result;
 };
@@ -277,19 +325,28 @@ export const getNodeParentChoosed = (needCheckedSiblingsValue, checkedList) => {
  * @param {*} result
  * @returns
  */
-export const findNodeDetail = (tree, key, result) => {
+var findNodeDetail = exports.findNodeDetail = function findNodeDetail(tree, key, result) {
   if (Array.isArray(tree) && !!key) {
-    for (let i of tree) {
-      if (i.value === key) {
-        result = i;
-        break;
-      }
-      if (Array.isArray(i.children) && !!i.children.length) {
-        result = findNodeDetail(i.children, key);
-        if (result) {
+    var _iterator3 = _createForOfIteratorHelper(tree),
+      _step3;
+    try {
+      for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {
+        var i = _step3.value;
+        if (i.value === key) {
+          result = i;
           break;
         }
+        if (Array.isArray(i.children) && !!i.children.length) {
+          result = findNodeDetail(i.children, key);
+          if (result) {
+            break;
+          }
+        }
       }
+    } catch (err) {
+      _iterator3.e(err);
+    } finally {
+      _iterator3.f();
     }
   }
   return result;