@kdcloudjs/table 1.2.1-canary.5 → 1.2.1-canary.7

package/es/table/utils/element.js

@@ -57,34 +57,27 @@ export function getEventPath(event) {
     // Firefox supports composePath
     return event.composedPath();
   }
-
   return createEventPath(event);
 }
-
 function createEventPath(event) {
   var res = [];
   var pointer = event.target;
-
   while (pointer) {
     res.push(pointer);
     pointer = pointer.parentElement;
   }
-
   return res;
 }
-
 ;
 /**
  * 获取点击事件是否发生在元素内部
  * @param ele
  * @param event
  */
-
 export function isElementInEventPath(ele, event) {
   if (!ele || !event) {
     return false;
   }
-
   var path = getEventPath(event);
   return path.indexOf(ele) >= 0;
 }
@@ -93,21 +86,16 @@ export function isElementInEventPath(ele, event) {
  * @param path
  * @param isTargetCb
  */
-
 export function getTargetEleInEventPath(path, isTargetCb) {
   var target;
   var l = 0;
-
   while (!target && l < path.length) {
     var ele = path[l];
-
     if (isTargetCb(ele)) {
       target = ele;
     }
-
     l++;
   }
-
   return target;
 }
 /**
@@ -115,7 +103,6 @@ export function getTargetEleInEventPath(path, isTargetCb) {
  * @param event
  * @param popupParent
  */
-
 export function calculatePointerRelative(event, popupParent) {
   var parentRect = popupParent.getBoundingClientRect();
   var documentRect = document.documentElement.getBoundingClientRect();
@@ -129,7 +116,6 @@ export function calculatePointerRelative(event, popupParent) {
  * @param event
  * @param popupParent
  */
-
 export function calculatePopupRelative(trigger, popupParent, offset) {
   var triggerRect = trigger.getBoundingClientRect();
   var parent = popupParent === document.body ? document.documentElement : popupParent;
@@ -139,48 +125,39 @@ export function calculatePopupRelative(trigger, popupParent, offset) {
     y: triggerRect.top - parentRect.top - (offset ? offset.y : 0)
   };
 }
-
 function getPerfectX(_ref) {
   var x = _ref.x,
-      maxX = _ref.maxX,
-      width = _ref.width,
-      isPerfectX = _ref.isPerfectX;
-
+    maxX = _ref.maxX,
+    width = _ref.width,
+    isPerfectX = _ref.isPerfectX;
   if (isPerfectX && Math.max(x, 0) > Math.abs(maxX)) {
     //看左侧空间是否足够
     var parentAvailableWidth = x;
-
     if (width <= parentAvailableWidth) {
       return x - width; //空间足够，往左侧偏移
     }
-  } //目前位置，最大支持的位置
-
-
+  }
+  //目前位置，最大支持的位置
   return Math.min(Math.max(x, 0), Math.abs(maxX));
 }
-
 function getPerfectY(_ref2) {
   var y = _ref2.y,
-      maxY = _ref2.maxY,
-      height = _ref2.height,
-      scrollTop = _ref2.scrollTop,
-      isBody = _ref2.isBody,
-      isPerfectY = _ref2.isPerfectY;
-
+    maxY = _ref2.maxY,
+    height = _ref2.height,
+    scrollTop = _ref2.scrollTop,
+    isBody = _ref2.isBody,
+    isPerfectY = _ref2.isPerfectY;
   if (isPerfectY && Math.max(y, 0) > Math.abs(maxY)) {
     //看下上方空间是否足够
     var parentAvailableHeight = isBody ? y - scrollTop : y;
-
     if (height <= parentAvailableHeight) {
       //上方空间足够，向上展示
       return y - height;
     }
-  } //目前位置，最大支持的位置
-
-
+  }
+  //目前位置，最大支持的位置
   return Math.min(Math.max(y, 0), Math.abs(maxY));
 }
-
 export function keepWithinBounds(popupParent, popup, x, y, isPerfect) {
   var parentRect = popupParent.getBoundingClientRect();
   var docElement = document.documentElement;
@@ -189,14 +166,12 @@ export function keepWithinBounds(popupParent, popup, x, y, isPerfect) {
   var parentAvailableWidth = parentRect.width;
   var parentAvailableHeight = parentRect.height;
   var isBody = popupParent === document.body;
-
   if (isBody) {
     //ducument的宽度减去 父元素到document边界的的宽度，就是剩余可显示的宽度
-    parentAvailableWidth = docRect.width - Math.abs(docRect.left - parentRect.left); //ducument的高度加上滚动条的高度减去 父元素到document边界的的宽度，就是剩余可显示的高度
-
+    parentAvailableWidth = docRect.width - Math.abs(docRect.left - parentRect.left);
+    //ducument的高度加上滚动条的高度减去 父元素到document边界的的宽度，就是剩余可显示的高度
     parentAvailableHeight = docRect.height + docElement.scrollTop - Math.abs(docRect.top - parentRect.top);
   }
-
   if (x) {
     var width = popupRect.width;
     var maxX = parentAvailableWidth - width;
@@ -207,7 +182,6 @@ export function keepWithinBounds(popupParent, popup, x, y, isPerfect) {
       isPerfectX: isPerfect
     });
   }
-
   if (y) {
     var height = popupRect.height;
     var maxY = parentAvailableHeight - height;
@@ -220,7 +194,6 @@ export function keepWithinBounds(popupParent, popup, x, y, isPerfect) {
       isPerfectY: isPerfect
     });
   }
-
   return {
     x: x,
     y: y

package/es/table/utils/exportTableAsExcel.js

@@ -4,23 +4,17 @@ import _sliceInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instan
 import _Array$from from "@babel/runtime-corejs3/core-js-stable/array/from";
 import _Symbol from "@babel/runtime-corejs3/core-js-stable/symbol";
 import _getIteratorMethod from "@babel/runtime-corejs3/core-js/get-iterator-method";
-
-function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof _Symbol !== "undefined" && _getIteratorMethod(o) || 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) { var _context2; if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = _sliceInstanceProperty(_context2 = Object.prototype.toString.call(o)).call(_context2, 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 _createForOfIteratorHelper(r, e) { var t = "undefined" != typeof _Symbol && _getIteratorMethod(r) || r["@@iterator"]; if (!t) { if (Array.isArray(r) || (t = _unsupportedIterableToArray(r)) || e && r && "number" == typeof r.length) { t && (r = t); var _n = 0, F = function F() {}; return { s: F, n: function n() { return _n >= r.length ? { done: !0 } : { done: !1, value: r[_n++] }; }, e: function e(r) { throw r; }, 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 o, a = !0, u = !1; return { s: function s() { t = t.call(r); }, n: function n() { var r = t.next(); return a = r.done, r; }, e: function e(r) { u = !0, o = r; }, f: function f() { try { a || null == t.return || t.return(); } finally { if (u) throw o; } } }; }
+function _unsupportedIterableToArray(r, a) { if (r) { var _context2; if ("string" == typeof r) return _arrayLikeToArray(r, a); var t = _sliceInstanceProperty(_context2 = {}.toString.call(r)).call(_context2, 8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? _Array$from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }
+function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
 import SpanManager from '../base/helpers/SpanManager';
 import { internals } from '../internals';
 import collectNodes from './collectNodes';
 import getTreeDepth from './getTreeDepth';
 import isLeafNode from './isLeafNode';
-
 function safeGetSpanRect(column, record, rowIndex, colIndex) {
   var colSpan = 1;
   var rowSpan = 1;
-
   if (column.getSpanRect) {
     var value = internals.safeGetValue(column, record, rowIndex);
     var spanRect = column.getSpanRect(value, record, rowIndex);
@@ -28,17 +22,14 @@ function safeGetSpanRect(column, record, rowIndex, colIndex) {
     rowSpan = spanRect == null ? 1 : spanRect.bottom - rowIndex;
   } else {
     var cellProps = internals.safeGetCellProps(column, record, rowIndex);
-
     if (cellProps.colSpan != null) {
       colSpan = cellProps.colSpan;
     }
-
     if (cellProps.rowSpan != null) {
       rowSpan = cellProps.rowSpan;
     }
-  } // 注意这里没有考虑「rowSpan/colSpan 不能过大，避免 rowSpan/colSpan 影响因虚拟滚动而未渲染的单元格」
-
-
+  }
+  // 注意这里没有考虑「rowSpan/colSpan 不能过大，避免 rowSpan/colSpan 影响因虚拟滚动而未渲染的单元格」
   return {
     top: rowIndex,
     bottom: rowIndex + rowSpan,
@@ -46,16 +37,14 @@ function safeGetSpanRect(column, record, rowIndex, colIndex) {
     right: colIndex + colSpan
   };
 }
-
 function move(_ref, dx, dy) {
   var c = _ref.c,
-      r = _ref.r;
+    r = _ref.r;
   return {
     c: c + dx,
     r: r + dy
   };
 }
-
 function sanitizeCellDatum(value) {
   if (value === Infinity || value === -Infinity || typeof value === 'number' && isNaN(value)) {
     return null;
@@ -64,8 +53,6 @@ function sanitizeCellDatum(value) {
   }
 }
 /** 根据 BaseTable 的 dataSource 和 column，将表格数据导出为 Excel 文件 */
-
-
 export default function exportTableAsExcel(xlsxPackage, dataSource, columns, filename) {
   var sheet = xlsxPackage.utils.aoa_to_sheet([]);
   var topHeaderHeight = getTreeDepth(columns) + 1;
@@ -81,30 +68,22 @@ export default function exportTableAsExcel(xlsxPackage, dataSource, columns, fil
       Sheet1: sheet
     }
   }, filename);
-
   function addTopHeaders(origin) {
     dfs(columns, 0, 0);
-
     function dfs(cols, startDx, startDy) {
       var _a;
-
       var start = move(origin, startDx, startDy);
       var offsetX = 0;
-
       var _iterator = _createForOfIteratorHelper(cols),
-          _step;
-
+        _step;
       try {
         for (_iterator.s(); !(_step = _iterator.n()).done;) {
           var col = _step.value;
-
           if ((_a = col.features) === null || _a === void 0 ? void 0 : _a.noExport) {
             continue;
           }
-
           var current = move(start, offsetX, 0);
           addOne(col.name, current);
-
           if (isLeafNode(col)) {
             offsetX += 1;
             mergeCells(current, 1, topHeaderHeight - startDy);
@@ -119,66 +98,51 @@ export default function exportTableAsExcel(xlsxPackage, dataSource, columns, fil
       } finally {
         _iterator.f();
       }
-
       return offsetX;
     }
   }
-
   function addDataPart(origin) {
     var _context;
-
     var leafColumns = _filterInstanceProperty(_context = collectNodes(columns, 'leaf-only')).call(_context, function (col) {
       var _a;
-
       return !((_a = col.features) === null || _a === void 0 ? void 0 : _a.noExport);
     });
-
     var spanManager = new SpanManager();
-
     var dataPart = _mapInstanceProperty(dataSource).call(dataSource, function (record, rowIndex) {
       spanManager.stripUpwards(rowIndex);
       return _mapInstanceProperty(leafColumns).call(leafColumns, function (col, colIndex) {
         if (spanManager.testSkip(rowIndex, colIndex)) {
           return null;
         }
-
         var spanRect = safeGetSpanRect(col, record, rowIndex, colIndex);
         var rowSpan = spanRect.bottom - spanRect.top;
         var colSpan = spanRect.right - spanRect.left;
-
         if (rowSpan > 1 || colSpan > 1) {
           spanManager.add(spanRect.top, spanRect.left, colSpan, rowSpan);
           mergeCells(move(origin, spanRect.left, spanRect.top), colSpan, rowSpan);
         }
-
         return sanitizeCellDatum(internals.safeGetValue(col, record, rowIndex));
       });
     });
-
     add(dataPart, origin);
   }
-
   function add(data, origin) {
     xlsxPackage.utils.sheet_add_aoa(sheet, data, {
       origin: origin
     });
   }
-
   function addOne(datum, origin) {
     xlsxPackage.utils.sheet_add_aoa(sheet, [[datum]], {
       origin: origin
     });
   }
-
   function mergeCells(addr, width, height) {
     if (width === 1 && height === 1) {
       return;
     }
-
     if (sheet['!merges'] == null) {
       sheet['!merges'] = [];
     }
-
     sheet['!merges'].push({
       s: addr,
       e: move(addr, width - 1, height - 1)

package/es/table/utils/getTreeDepth.js

@@ -2,29 +2,21 @@ import _sliceInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instan
 import _Array$from from "@babel/runtime-corejs3/core-js-stable/array/from";
 import _Symbol from "@babel/runtime-corejs3/core-js-stable/symbol";
 import _getIteratorMethod from "@babel/runtime-corejs3/core-js/get-iterator-method";
-
-function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof _Symbol !== "undefined" && _getIteratorMethod(o) || 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) { var _context; if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = _sliceInstanceProperty(_context = Object.prototype.toString.call(o)).call(_context, 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 _createForOfIteratorHelper(r, e) { var t = "undefined" != typeof _Symbol && _getIteratorMethod(r) || r["@@iterator"]; if (!t) { if (Array.isArray(r) || (t = _unsupportedIterableToArray(r)) || e && r && "number" == typeof r.length) { t && (r = t); var _n = 0, F = function F() {}; return { s: F, n: function n() { return _n >= r.length ? { done: !0 } : { done: !1, value: r[_n++] }; }, e: function e(r) { throw r; }, 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 o, a = !0, u = !1; return { s: function s() { t = t.call(r); }, n: function n() { var r = t.next(); return a = r.done, r; }, e: function e(r) { u = !0, o = r; }, f: function f() { try { a || null == t.return || t.return(); } finally { if (u) throw o; } } }; }
+function _unsupportedIterableToArray(r, a) { if (r) { var _context; if ("string" == typeof r) return _arrayLikeToArray(r, a); var t = _sliceInstanceProperty(_context = {}.toString.call(r)).call(_context, 8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? _Array$from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }
+function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
 import isLeafNode from './isLeafNode';
 /** 获取一棵树的高度/深度 (0-based) */
-
 export default function getTreeDepth(nodes) {
   var maxDepth = -1;
   dfs(nodes, 0);
   return maxDepth;
-
   function dfs(columns, depth) {
     var _iterator = _createForOfIteratorHelper(columns),
-        _step;
-
+      _step;
     try {
       for (_iterator.s(); !(_step = _iterator.n()).done;) {
         var column = _step.value;
-
         if (isLeafNode(column)) {
           maxDepth = Math.max(maxDepth, depth);
         } else {

package/es/table/utils/groupBy.js

@@ -2,28 +2,20 @@ import _sliceInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instan
 import _Array$from from "@babel/runtime-corejs3/core-js-stable/array/from";
 import _Symbol from "@babel/runtime-corejs3/core-js-stable/symbol";
 import _getIteratorMethod from "@babel/runtime-corejs3/core-js/get-iterator-method";
-
-function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof _Symbol !== "undefined" && _getIteratorMethod(o) || 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) { var _context; if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = _sliceInstanceProperty(_context = Object.prototype.toString.call(o)).call(_context, 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 _createForOfIteratorHelper(r, e) { var t = "undefined" != typeof _Symbol && _getIteratorMethod(r) || r["@@iterator"]; if (!t) { if (Array.isArray(r) || (t = _unsupportedIterableToArray(r)) || e && r && "number" == typeof r.length) { t && (r = t); var _n = 0, F = function F() {}; return { s: F, n: function n() { return _n >= r.length ? { done: !0 } : { done: !1, value: r[_n++] }; }, e: function e(r) { throw r; }, 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 o, a = !0, u = !1; return { s: function s() { t = t.call(r); }, n: function n() { var r = t.next(); return a = r.done, r; }, e: function e(r) { u = !0, o = r; }, f: function f() { try { a || null == t.return || t.return(); } finally { if (u) throw o; } } }; }
+function _unsupportedIterableToArray(r, a) { if (r) { var _context; if ("string" == typeof r) return _arrayLikeToArray(r, a); var t = _sliceInstanceProperty(_context = {}.toString.call(r)).call(_context, 8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? _Array$from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }
+function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
 export default function groupBy(list, iteratee) {
   var groups = {};
-
   var _iterator = _createForOfIteratorHelper(list),
-      _step;
-
+    _step;
   try {
     for (_iterator.s(); !(_step = _iterator.n()).done;) {
       var item = _step.value;
       var key = iteratee(item);
-
       if (groups[key] == null) {
         groups[key] = [];
       }
-
       groups[key].push(item);
     }
   } catch (err) {
@@ -31,6 +23,5 @@ export default function groupBy(list, iteratee) {
   } finally {
     _iterator.f();
   }
-
   return groups;
 }

package/es/table/utils/layeredFilter.js

@@ -4,19 +4,15 @@ import _mapInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance
 import isLeafNode from './isLeafNode';
 export default function layeredFilter(array, filter) {
   return dfs(array);
-
   function dfs(rows) {
     var _context;
-
     if (!Array.isArray(array)) {
       return array;
     }
-
     return _filterInstanceProperty(_context = _mapInstanceProperty(rows).call(rows, function (row) {
       if (isLeafNode(row)) {
         return row;
       }
-
       return _extends(_extends({}, row), {
         children: dfs(row.children)
       });

package/es/table/utils/layeredSort.js

@@ -5,22 +5,17 @@ import isLeafNode from './isLeafNode';
 /** 对树状结构的数据进行排序.
  * layeredSort 是一个递归的过程，针对树上的每一个父节点，该函数都会重新对其子节点数组（children) 进行排序.
  * */
-
 export default function layeredSort(array, compare) {
   return dfs(array);
-
   function dfs(rows) {
     var _context;
-
     if (!Array.isArray(array)) {
       return array;
     }
-
     return _sortInstanceProperty(_context = _mapInstanceProperty(rows).call(rows, function (row) {
       if (isLeafNode(row)) {
         return row;
       }
-
       return _extends(_extends({}, row), {
         children: dfs(row.children)
       });

package/es/table/utils/makeRecursiveMapper.js

@@ -4,32 +4,24 @@ import _sliceInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instan
 import _Array$from from "@babel/runtime-corejs3/core-js-stable/array/from";
 import _Symbol from "@babel/runtime-corejs3/core-js-stable/symbol";
 import _getIteratorMethod from "@babel/runtime-corejs3/core-js/get-iterator-method";
-
-function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof _Symbol !== "undefined" && _getIteratorMethod(o) || 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) { var _context; if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = _sliceInstanceProperty(_context = Object.prototype.toString.call(o)).call(_context, 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 _createForOfIteratorHelper(r, e) { var t = "undefined" != typeof _Symbol && _getIteratorMethod(r) || r["@@iterator"]; if (!t) { if (Array.isArray(r) || (t = _unsupportedIterableToArray(r)) || e && r && "number" == typeof r.length) { t && (r = t); var _n = 0, F = function F() {}; return { s: F, n: function n() { return _n >= r.length ? { done: !0 } : { done: !1, value: r[_n++] }; }, e: function e(r) { throw r; }, 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 o, a = !0, u = !1; return { s: function s() { t = t.call(r); }, n: function n() { var r = t.next(); return a = r.done, r; }, e: function e(r) { u = !0, o = r; }, f: function f() { try { a || null == t.return || t.return(); } finally { if (u) throw o; } } }; }
+function _unsupportedIterableToArray(r, a) { if (r) { var _context; if ("string" == typeof r) return _arrayLikeToArray(r, a); var t = _sliceInstanceProperty(_context = {}.toString.call(r)).call(_context, 8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? _Array$from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }
+function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
 import isLeafNode from './isLeafNode';
 export default function makeRecursiveMapper(fn) {
   return function (tree) {
     return dfs(tree, 0, []).result;
-
     function dfs(nodes, parentStartIndex, path) {
       var flatCount = 0;
       var result = [];
-
       var _iterator = _createForOfIteratorHelper(nodes),
-          _step;
-
+        _step;
       try {
         for (_iterator.s(); !(_step = _iterator.n()).done;) {
           var node = _step.value;
           path.push(node);
           var startIndex = parentStartIndex + flatCount;
           var subResult = void 0;
-
           if (isLeafNode(node)) {
             subResult = fn(node, {
               // parentStartIndex,
@@ -51,13 +43,11 @@ export default function makeRecursiveMapper(fn) {
             });
             flatCount += dfsResult.flatCount;
           }
-
           if (Array.isArray(subResult)) {
             result.push.apply(result, _toConsumableArray(subResult));
           } else if (subResult != null) {
             result.push(subResult);
           }
-
           path.pop();
         }
       } catch (err) {
@@ -65,7 +55,6 @@ export default function makeRecursiveMapper(fn) {
       } finally {
         _iterator.f();
       }
-
       return {
         result: result,
         flatCount: flatCount

package/es/table/utils/mergeCellProps.js

@@ -2,12 +2,12 @@ import _typeof from "@babel/runtime-corejs3/helpers/typeof";
 import _extends from "@babel/runtime-corejs3/helpers/extends";
 import _Object$keys2 from "@babel/runtime-corejs3/core-js-stable/object/keys";
 import cx from 'classnames';
-
 function composeEventHandler(handler1, handler2) {
   return function () {
     // 先执行原有的事件回调函数
     handler1.apply(void 0, arguments);
-    handler2.apply(void 0, arguments); // 事件回调函数没有返回值，故这里不进行 return
+    handler2.apply(void 0, arguments);
+    // 事件回调函数没有返回值，故这里不进行 return
   };
 }
 /** 合并两个 cellProps（单元格属性）对象，返回一个合并后的全新对象。
@@ -16,29 +16,23 @@ function composeEventHandler(handler1, handler2) {
  * * 对于 数字、字符串、布尔值类型的字段，extra 中的字段值将直接覆盖 base 中的字段值（className 是个特例，会进行字符串拼接）
  * * 对于函数/方法类型的字段（对应单元格的事件回调函数），mergeCellProps 将生成一个新的函数，新函数将按序调用 base 和 extra 中的方法
  * * 对于普通对象类型的字段（对应单元格的样式），mergeCellProps 将合并两个对象 */
-
-
 export default function mergeCellProps(base, extra) {
   if (base == null) {
     return extra;
   }
-
   if (extra == null) {
     return base;
   }
-
   var result = _extends({}, base);
-
   for (var _i = 0, _Object$keys = _Object$keys2(extra); _i < _Object$keys.length; _i++) {
     var key = _Object$keys[_i];
     var value = extra[key];
-
     var type = _typeof(value);
-
     if (value === null) {
       // value=null 时 覆盖原来的值
       result[key] = null;
-    } else if (value === undefined) {// value=undefined 时 保留原来的值
+    } else if (value === undefined) {
+      // value=undefined 时 保留原来的值
     } else if (type === 'number' || type === 'string' || type === 'boolean') {
       if (key === 'className') {
         result[key] = cx(result[key], value);
@@ -47,7 +41,6 @@ export default function mergeCellProps(base, extra) {
       }
     } else if (type === 'function') {
       var prev = result[key];
-
       if (prev == null) {
         result[key] = value;
       } else {
@@ -55,9 +48,8 @@ export default function mergeCellProps(base, extra) {
       }
     } else if (type === 'object') {
       result[key] = _extends({}, result[key], value);
-    } // else `type` is 'bigint' or 'symbol', `value` is an invalid cellProp, ignore it
-
+    }
+    // else `type` is 'bigint' or 'symbol', `value` is an invalid cellProp, ignore it
   }
-
   return result;
 }