@kdcloudjs/table 1.2.0-canary.6 → 1.2.0-canary.6-hotfix.2

package/es/table/pivot/pivot-utils/buildDrillTree.js

@@ -4,25 +4,22 @@ import { groupBy } from '../../utils';
 import { always } from '../../utils/others';
 import simpleEncode from './simpleEncode';
 /** 根据指定的 code 序列计算下钻树 */
-
 export default function buildDrillTree(data, codes) {
   var _ref = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {},
-      _ref$encode = _ref.encode,
-      encode = _ref$encode === void 0 ? simpleEncode : _ref$encode,
-      _ref$totalValue = _ref.totalValue,
-      totalValue = _ref$totalValue === void 0 ? '总计' : _ref$totalValue,
-      _ref$includeTopWrappe = _ref.includeTopWrapper,
-      includeTopWrapper = _ref$includeTopWrappe === void 0 ? false : _ref$includeTopWrappe,
-      _ref$isExpand = _ref.isExpand,
-      isExpand = _ref$isExpand === void 0 ? always(true) : _ref$isExpand,
-      _ref$enforceExpandTot = _ref.enforceExpandTotalNode,
-      enforceExpandTotalNode = _ref$enforceExpandTot === void 0 ? true : _ref$enforceExpandTot;
-
+    _ref$encode = _ref.encode,
+    encode = _ref$encode === void 0 ? simpleEncode : _ref$encode,
+    _ref$totalValue = _ref.totalValue,
+    totalValue = _ref$totalValue === void 0 ? '总计' : _ref$totalValue,
+    _ref$includeTopWrappe = _ref.includeTopWrapper,
+    includeTopWrapper = _ref$includeTopWrappe === void 0 ? false : _ref$includeTopWrappe,
+    _ref$isExpand = _ref.isExpand,
+    isExpand = _ref$isExpand === void 0 ? always(true) : _ref$isExpand,
+    _ref$enforceExpandTot = _ref.enforceExpandTotalNode,
+    enforceExpandTotalNode = _ref$enforceExpandTot === void 0 ? true : _ref$enforceExpandTot;
   var emptyPath = [];
   var totalKey = encode(emptyPath);
   var array;
   var hasChild = false;
-
   if (codes.length === 0) {
     array = [];
   } else if (!enforceExpandTotalNode && !isExpand(totalKey)) {
@@ -31,7 +28,6 @@ export default function buildDrillTree(data, codes) {
   } else {
     array = dfs(data, []);
   }
-
   if (includeTopWrapper) {
     var rootNode = {
       key: totalKey,
@@ -39,14 +35,11 @@ export default function buildDrillTree(data, codes) {
       path: emptyPath,
       children: array
     };
-
     if (hasChild) {
       rootNode.hasChild = hasChild;
     }
-
     return [rootNode];
   }
-
   if (includeTopWrapper) {
     return [{
       key: totalKey,
@@ -55,9 +48,7 @@ export default function buildDrillTree(data, codes) {
       children: array
     }];
   }
-
   return array;
-
   function dfs(slice, path) {
     var depth = path.length;
     var array = [];
@@ -65,7 +56,6 @@ export default function buildDrillTree(data, codes) {
     var groups = groupBy(slice, function (row) {
       return row[code];
     });
-
     for (var _i = 0, _Object$keys = _Object$keys2(groups); _i < _Object$keys.length; _i++) {
       var groupKey = _Object$keys[_i];
       path.push(groupKey);
@@ -76,7 +66,6 @@ export default function buildDrillTree(data, codes) {
       };
       array.push(node);
       var group = groups[groupKey];
-
       if (group.length > 0 && depth < codes.length - 1) {
         if (isExpand(node.key)) {
           node.children = dfs(group, path);
@@ -84,10 +73,8 @@ export default function buildDrillTree(data, codes) {
           node.hasChild = true;
         }
       }
-
       path.pop();
     }
-
     return array;
   }
 }

package/es/table/pivot/pivot-utils/builders.js

@@ -3,13 +3,9 @@ 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";
 import _slicedToArray from "@babel/runtime-corejs3/helpers/slicedToArray";
-
 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 _context5; if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = _sliceInstanceProperty(_context5 = Object.prototype.toString.call(o)).call(_context5, 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; }
-
 import _Set from "@babel/runtime-corejs3/core-js-stable/set";
 import _mapInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/map";
 import _filterInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/filter";
@@ -18,54 +14,46 @@ import { groupBy, isLeafNode } from '../../utils';
 import { always, fromEntries } from '../../utils/others';
 import buildDrillTree from './buildDrillTree';
 import simpleEncode from './simpleEncode';
-
 function fallbackAggregate(slice) {
   return slice.length === 1 ? slice[0] : {};
 }
 /** 根据表格左侧与上方的下钻树，从全量明细数据中计算对应的数据立方 */
-
-
 export function buildRecordMatrix(_ref) {
   var data = _ref.data,
-      leftCodes = _ref.leftCodes,
-      topCodes = _ref.topCodes,
-      _ref$aggregate = _ref.aggregate,
-      aggregate = _ref$aggregate === void 0 ? fallbackAggregate : _ref$aggregate,
-      _ref$encode = _ref.encode,
-      encode = _ref$encode === void 0 ? simpleEncode : _ref$encode,
-      _ref$isLeftExpand = _ref.isLeftExpand,
-      isLeftExpand = _ref$isLeftExpand === void 0 ? always(true) : _ref$isLeftExpand,
-      _ref$isTopExpand = _ref.isTopExpand,
-      isTopExpand = _ref$isTopExpand === void 0 ? always(true) : _ref$isTopExpand,
-      prebuiltLeftTree = _ref.prebuiltLeftTree,
-      prebuiltTopTree = _ref.prebuiltTopTree;
+    leftCodes = _ref.leftCodes,
+    topCodes = _ref.topCodes,
+    _ref$aggregate = _ref.aggregate,
+    aggregate = _ref$aggregate === void 0 ? fallbackAggregate : _ref$aggregate,
+    _ref$encode = _ref.encode,
+    encode = _ref$encode === void 0 ? simpleEncode : _ref$encode,
+    _ref$isLeftExpand = _ref.isLeftExpand,
+    isLeftExpand = _ref$isLeftExpand === void 0 ? always(true) : _ref$isLeftExpand,
+    _ref$isTopExpand = _ref.isTopExpand,
+    isTopExpand = _ref$isTopExpand === void 0 ? always(true) : _ref$isTopExpand,
+    prebuiltLeftTree = _ref.prebuiltLeftTree,
+    prebuiltTopTree = _ref.prebuiltTopTree;
   var ctx = {
     peculiarity: new _Set()
   };
-
   var _ref2 = prebuiltLeftTree !== null && prebuiltLeftTree !== void 0 ? prebuiltLeftTree : buildDrillTree(data, leftCodes, {
-    encode: encode,
-    includeTopWrapper: true,
-    isExpand: isLeftExpand
-  }),
-      _ref3 = _slicedToArray(_ref2, 1),
-      leftRootDrillNode = _ref3[0];
-
+      encode: encode,
+      includeTopWrapper: true,
+      isExpand: isLeftExpand
+    }),
+    _ref3 = _slicedToArray(_ref2, 1),
+    leftRootDrillNode = _ref3[0];
   var _ref4 = prebuiltTopTree !== null && prebuiltTopTree !== void 0 ? prebuiltTopTree : buildDrillTree(data, topCodes, {
-    encode: encode,
-    includeTopWrapper: true,
-    isExpand: isTopExpand
-  }),
-      _ref5 = _slicedToArray(_ref4, 1),
-      topRootDrillNode = _ref5[0];
-
+      encode: encode,
+      includeTopWrapper: true,
+      isExpand: isTopExpand
+    }),
+    _ref5 = _slicedToArray(_ref4, 1),
+    topRootDrillNode = _ref5[0];
   var transientMatrixRow = buildByLeft(ctx, data, leftRootDrillNode, 0);
   return makeMatrix(transientMatrixRow);
-
   function buildByLeft(ctx, slice, drillNode, depth) {
     var children = null;
     var col;
-
     if (isLeafNode(drillNode)) {
       col = buildByTop(ctx, slice, topRootDrillNode, 0);
     } else {
@@ -75,15 +63,12 @@ export function buildRecordMatrix(_ref) {
         return dwdRow[code];
       });
       ctx.peculiarity.add(code);
-
       var _iterator = _createForOfIteratorHelper(drillNode.children),
-          _step;
-
+        _step;
       try {
         for (_iterator.s(); !(_step = _iterator.n()).done;) {
           var child = _step.value;
           var group = groups[child.value];
-
           if (group) {
             children.push(buildByLeft(ctx, group, child, depth + 1));
           }
@@ -93,24 +78,20 @@ export function buildRecordMatrix(_ref) {
       } finally {
         _iterator.f();
       }
-
       ctx.peculiarity.delete(code);
       col = mergeColsByTopTree(ctx, _mapInstanceProperty(children).call(children, function (child) {
         return child.col;
       }));
     }
-
     return {
       leftKey: drillNode.key,
       children: children,
       col: col
     };
   }
-
   function buildByTop(ctx, slice, drillNode, depth) {
     var children = null;
     var record;
-
     if (isLeafNode(drillNode)) {
       record = aggregate(slice, ctx);
     } else {
@@ -120,15 +101,12 @@ export function buildRecordMatrix(_ref) {
         return dwdRow[code];
       });
       ctx.peculiarity.add(code);
-
       var _iterator2 = _createForOfIteratorHelper(drillNode.children),
-          _step2;
-
+        _step2;
       try {
         for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
           var child = _step2.value;
           var group = groups[child.value];
-
           if (group) {
             children.push(buildByTop(ctx, group, child, depth + 1));
           }
@@ -138,13 +116,11 @@ export function buildRecordMatrix(_ref) {
       } finally {
         _iterator2.f();
       }
-
       ctx.peculiarity.delete(code);
       record = aggregate(_mapInstanceProperty(children).call(children, function (child) {
         return child.record;
       }), ctx);
     }
-
     return {
       topKey: drillNode.key,
       topValue: drillNode.value,
@@ -152,45 +128,35 @@ export function buildRecordMatrix(_ref) {
       record: record
     };
   }
-
   function mergeColsByTopTree(ctx, colsToMerge) {
     return dfs(ctx, colsToMerge, topRootDrillNode, 0);
-
     function dfs(ctx, cols, topDrillNode, depth) {
       var children = null;
       var record = aggregate(_mapInstanceProperty(cols).call(cols, function (c) {
         return c.record;
       }), ctx);
-
       if (!isLeafNode(topDrillNode)) {
         var _context, _context3;
-
         var topCode = topCodes[depth];
         ctx.peculiarity.add(topCode);
         var drillChildDict = fromEntries(_mapInstanceProperty(_context = topDrillNode.children).call(_context, function (child) {
           return [child.value, child];
         }));
-
         var colChildDictArray = _mapInstanceProperty(cols).call(cols, function (col) {
           var _context2;
-
           return fromEntries(_mapInstanceProperty(_context2 = col.children).call(_context2, function (child) {
             return [child.topValue, child];
           }));
         });
-
         children = _mapInstanceProperty(_context3 = topDrillNode.children).call(_context3, function (item) {
           var _context4;
-
           var childCols = _filterInstanceProperty(_context4 = _mapInstanceProperty(colChildDictArray).call(colChildDictArray, function (colChildDict) {
             return colChildDict[item.value];
           })).call(_context4, Boolean);
-
           return dfs(ctx, childCols, drillChildDict[item.value], depth + 1);
         });
         ctx.peculiarity.delete(topCode);
       }
-
       return {
         topKey: topDrillNode.key,
         topValue: topDrillNode.value,
@@ -199,27 +165,22 @@ export function buildRecordMatrix(_ref) {
       };
     }
   }
-
   function makeMatrix(rootRow) {
     var result = new _Map();
     dfsRow(result, rootRow);
     return result;
-
     function dfsRow(matrix, row) {
       var subMap = new _Map();
       matrix.set(row.leftKey, subMap);
       dfsCol(subMap, row.col);
-
       if (!isLeafNode(row)) {
         row.children.forEach(function (childRow) {
           dfsRow(matrix, childRow);
         });
       }
     }
-
     function dfsCol(subMap, col) {
       subMap.set(col.topKey, col.record);
-
       if (!isLeafNode(col)) {
         col.children.forEach(function (childCol) {
           dfsCol(subMap, childCol);
@@ -230,14 +191,13 @@ export function buildRecordMatrix(_ref) {
 }
 /** buildRecordMatrix 的简化版本，只能处理一个维度序列，返回一个 Map。
  * 相当于只处理 matrix 的第一行（汇总行） */
-
 export function buildRecordMap(_ref6) {
   var codes = _ref6.codes,
-      _ref6$encode = _ref6.encode,
-      encode = _ref6$encode === void 0 ? simpleEncode : _ref6$encode,
-      data = _ref6.data,
-      aggregate = _ref6.aggregate,
-      isExpand = _ref6.isExpand;
+    _ref6$encode = _ref6.encode,
+    encode = _ref6$encode === void 0 ? simpleEncode : _ref6$encode,
+    data = _ref6.data,
+    aggregate = _ref6.aggregate,
+    isExpand = _ref6.isExpand;
   var matrix = buildRecordMatrix({
     data: data,
     leftCodes: [],

package/es/table/pivot/pivot-utils/convert-utils.js

@@ -4,15 +4,10 @@ import _Symbol from "@babel/runtime-corejs3/core-js-stable/symbol";
 import _getIteratorMethod from "@babel/runtime-corejs3/core-js/get-iterator-method";
 import _extends from "@babel/runtime-corejs3/helpers/extends";
 import _taggedTemplateLiteral from "@babel/runtime-corejs3/helpers/taggedTemplateLiteral";
-
 var _templateObject;
-
 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 _context3; if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = _sliceInstanceProperty(_context3 = Object.prototype.toString.call(o)).call(_context3, 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; }
-
 import _Set from "@babel/runtime-corejs3/core-js-stable/set";
 import _mapInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/map";
 import _concatInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/concat";
@@ -28,31 +23,26 @@ import { Classes } from '../../base/styles';
 var ExpandSpan = styled.span(_templateObject || (_templateObject = _taggedTemplateLiteral(["\n  display: inline-flex;\n  align-items: center;\n  padding: 2px 8px 2px 0;\n  cursor: pointer;\n\n  .icon {\n    fill: #999;\n    margin-right: 4px;\n\n    &.", " {\n      transform-origin: center center;\n      transform: rotate(90deg);\n    }\n  }\n"])), Classes.expanded);
 export function convertDrillTreeToCrossTree(drillTree) {
   var _ref = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {},
-      indicators = _ref.indicators,
-      _ref$encode = _ref.encode,
-      encode = _ref$encode === void 0 ? simpleEncode : _ref$encode,
-      generateSubtotalNode = _ref.generateSubtotalNode,
-      _ref$enforceExpandTot = _ref.enforceExpandTotalNode,
-      enforceExpandTotalNode = _ref$enforceExpandTot === void 0 ? true : _ref$enforceExpandTot,
-      expandKeys = _ref.expandKeys,
-      _ref$onChangeExpandKe = _ref.onChangeExpandKeys,
-      onChangeExpandKeys = _ref$onChangeExpandKe === void 0 ? noop : _ref$onChangeExpandKe,
-      supportsExpand = _ref.supportsExpand;
-
+    indicators = _ref.indicators,
+    _ref$encode = _ref.encode,
+    encode = _ref$encode === void 0 ? simpleEncode : _ref$encode,
+    generateSubtotalNode = _ref.generateSubtotalNode,
+    _ref$enforceExpandTot = _ref.enforceExpandTotalNode,
+    enforceExpandTotalNode = _ref$enforceExpandTot === void 0 ? true : _ref$enforceExpandTot,
+    expandKeys = _ref.expandKeys,
+    _ref$onChangeExpandKe = _ref.onChangeExpandKeys,
+    onChangeExpandKeys = _ref$onChangeExpandKe === void 0 ? noop : _ref$onChangeExpandKe,
+    supportsExpand = _ref.supportsExpand;
   var totalKey = encode([]);
-
   if (supportsExpand && expandKeys == null) {
     throw new Error('[ali-react-table] convertDrillTreeToCrossTree(...) 设置 supportsExpand=true 时，expandKeys 不能为 null/undefined.');
   }
-
   var expandKeySet = new _Set(expandKeys);
   return dfs(drillTree, 0);
   /** 在 indicators 非空的情况下获取指标对应的 CrossTreeNode */
-
   function getIndicators(node, nodeData) {
     return _mapInstanceProperty(indicators).call(indicators, function (indicator) {
       var _context;
-
       return _extends({
         key: encode(_concatInstanceProperty(_context = node.path).call(_context, [indicator.code])),
         value: indicator.name,
@@ -62,7 +52,6 @@ export function convertDrillTreeToCrossTree(drillTree) {
       }, indicator);
     });
   }
-
   function drillNodeToTreeNode(node, nodeData) {
     if (indicators != null) {
       return {
@@ -79,13 +68,10 @@ export function convertDrillTreeToCrossTree(drillTree) {
       };
     }
   }
-
   function dfs(drillNodes, depth) {
     var result = [];
-
     var _iterator = _createForOfIteratorHelper(drillNodes),
-        _step;
-
+      _step;
     try {
       var _loop = function _loop() {
         var node = _step.value;
@@ -93,7 +79,6 @@ export function convertDrillTreeToCrossTree(drillTree) {
           dataKey: node.key,
           dataPath: node.path
         };
-
         if (isLeafNode(node) && !node.hasChild) {
           result.push(drillNodeToTreeNode(node, nodeData));
         } else {
@@ -103,7 +88,6 @@ export function convertDrillTreeToCrossTree(drillTree) {
             value: node.value,
             data: nodeData
           };
-
           if (!supportsExpand || enforceExpandTotalNode && node.key === totalKey) {
             // 不支持展开功能 或是强制展开
             crossTreeNode.children = dfs(node.children, depth + 1);
@@ -130,31 +114,24 @@ export function convertDrillTreeToCrossTree(drillTree) {
             }, /*#__PURE__*/React.createElement(icons.CaretRight, {
               className: "icon collapsed"
             }), node.value);
-
             if (indicators != null) {
               crossTreeNode.children = getIndicators(node, nodeData);
             }
           }
-
           if (needProcessChildren) {
             var subtotalNodeData = generateSubtotalNode === null || generateSubtotalNode === void 0 ? void 0 : generateSubtotalNode(node);
-
             if (subtotalNodeData) {
               var _context2;
-
               var _subtotalNodeData$pos = subtotalNodeData.position,
-                  position = _subtotalNodeData$pos === void 0 ? 'start' : _subtotalNodeData$pos,
-                  value = subtotalNodeData.value;
-
+                position = _subtotalNodeData$pos === void 0 ? 'start' : _subtotalNodeData$pos,
+                value = subtotalNodeData.value;
               var subtotalPath = _concatInstanceProperty(_context2 = node.path).call(_context2, [value]);
-
               var subtotalDrillNode = {
                 key: encode(subtotalPath),
                 path: subtotalPath,
                 value: value
               };
               var subtotalTreeNode = drillNodeToTreeNode(subtotalDrillNode, nodeData);
-
               if (position === 'start') {
                 crossTreeNode.children.unshift(subtotalTreeNode);
               } else {
@@ -162,11 +139,9 @@ export function convertDrillTreeToCrossTree(drillTree) {
               }
             }
           }
-
           result.push(crossTreeNode);
         }
       };
-
       for (_iterator.s(); !(_step = _iterator.n()).done;) {
         _loop();
       }
@@ -175,7 +150,6 @@ export function convertDrillTreeToCrossTree(drillTree) {
     } finally {
       _iterator.f();
     }
-
     return result;
   }
 }

package/es/table/pivot/pivot-utils/simpleEncode.js

@@ -2,6 +2,5 @@ export default function simpleEncode(path) {
   if (path.length === 0) {
     return 'key:@total@';
   }
-
   return "key:".concat(path.join(' '));
 }

package/es/table/style/index.less

@@ -1 +1 @@
-
+

package/es/table/transforms/autoRowSpan.js

@@ -2,40 +2,31 @@ import _extends from "@babel/runtime-corejs3/helpers/extends";
 import { internals } from '../internals';
 import { isLeafNode, traverseColumn } from '../utils';
 import { warnTransformsDeprecated } from './warnTransformsDeprecated';
-
 function isIdentity(x, y) {
   return x === y;
 }
 /** @deprecated transform 用法已经过时，请使用 pipeline 来对表格进行拓展 */
-
-
 export function makeAutoRowSpanTransform() {
   warnTransformsDeprecated('makeAutoRowSpanTransform');
   return traverseColumn(function (col, _ref) {
     var dataSource = _ref.dataSource,
-        range = _ref.range;
-
+      range = _ref.range;
     var _a;
-
     if (!((_a = col.features) === null || _a === void 0 ? void 0 : _a.autoRowSpan)) {
       return col;
     }
-
     if (!isLeafNode(col)) {
       return col;
     }
-
     var isFunc = typeof col.features.autoRowSpan === 'function';
     var shouldMergeCell = isFunc ? col.features.autoRowSpan : isIdentity;
     var spanRects = [];
     var lastBottom = 0;
     var prevValue = null;
     var prevRow = null;
-
     for (var rowIndex = 0; rowIndex < dataSource.length; rowIndex++) {
       var row = dataSource[rowIndex];
       var value = internals.safeGetValue(col, row, rowIndex);
-
       if (rowIndex === 0 || !shouldMergeCell(prevValue, value, prevRow, row)) {
         var spanRect = {
           top: lastBottom,
@@ -43,18 +34,14 @@ export function makeAutoRowSpanTransform() {
           left: range.start,
           right: range.end
         };
-
         for (var i = lastBottom; i < rowIndex; i++) {
           spanRects.push(spanRect);
         }
-
         lastBottom = rowIndex;
       }
-
       prevValue = value;
       prevRow = row;
     }
-
     for (var _i = lastBottom; _i < dataSource.length; _i++) {
       spanRects.push({
         top: lastBottom,
@@ -63,7 +50,6 @@ export function makeAutoRowSpanTransform() {
         right: range.end
       });
     }
-
     return _extends(_extends({}, col), {
       getSpanRect: function getSpanRect(value, row, rowIndex) {
         return spanRects[rowIndex];