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

package/lib/table/pivot/cross-tree-table/cross-tree-table.js

@@ -1,119 +1,89 @@
 "use strict";
 
 var _Reflect$construct = require("@babel/runtime-corejs3/core-js-stable/reflect/construct");
-
 var _interopRequireDefault = require("@babel/runtime-corejs3/helpers/interopRequireDefault");
-
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.default = void 0;
-
 var _extends2 = _interopRequireDefault(require("@babel/runtime-corejs3/helpers/extends"));
-
 var _classCallCheck2 = _interopRequireDefault(require("@babel/runtime-corejs3/helpers/classCallCheck"));
-
 var _createClass2 = _interopRequireDefault(require("@babel/runtime-corejs3/helpers/createClass"));
-
 var _inherits2 = _interopRequireDefault(require("@babel/runtime-corejs3/helpers/inherits"));
-
 var _possibleConstructorReturn2 = _interopRequireDefault(require("@babel/runtime-corejs3/helpers/possibleConstructorReturn"));
-
 var _getPrototypeOf2 = _interopRequireDefault(require("@babel/runtime-corejs3/helpers/getPrototypeOf"));
-
 var _getOwnPropertySymbols = _interopRequireDefault(require("@babel/runtime-corejs3/core-js-stable/object/get-own-property-symbols"));
-
 var _react = _interopRequireDefault(require("react"));
-
 var _rxjs = require("rxjs");
-
 var _base = require("../../base");
-
 var _crossTable = require("../cross-table");
-
 var _buildCrossTreeTable2 = _interopRequireDefault(require("./buildCrossTreeTable"));
-
 function _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = (0, _getPrototypeOf2.default)(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0, _getPrototypeOf2.default)(this).constructor; result = _Reflect$construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0, _possibleConstructorReturn2.default)(this, result); }; }
-
 function _isNativeReflectConstruct() { if (typeof Reflect === "undefined" || !_Reflect$construct) return false; if (_Reflect$construct.sham) return false; if (typeof Proxy === "function") return true; try { Boolean.prototype.valueOf.call(_Reflect$construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }
-
 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 _getOwnPropertySymbols.default === "function") for (var i = 0, p = (0, _getOwnPropertySymbols.default)(s); i < p.length; i++) {
     if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i])) t[p[i]] = s[p[i]];
   }
   return t;
 };
-
 var CrossTreeTable = /*#__PURE__*/function (_React$Component) {
   (0, _inherits2.default)(CrossTreeTable, _React$Component);
-
   var _super = _createSuper(CrossTreeTable);
-
   function CrossTreeTable(props) {
     var _this;
-
     (0, _classCallCheck2.default)(this, CrossTreeTable);
     _this = _super.call(this, props);
-
     _this.onChangeOpenKeys = function (nextOpenKeys) {
       _this.props.onChangeOpenKeys(nextOpenKeys);
-
       if (!('openKeys' in _this.props)) {
         _this.setState({
           openKeys: nextOpenKeys
         });
       }
     };
-
     _this.state = {
       openKeys: props.defaultOpenKeys
     };
     return _this;
   }
-
   (0, _createClass2.default)(CrossTreeTable, [{
     key: "render",
     value: function render() {
       var _a = this.props,
-          _a$BaseTableComponent = _a.BaseTableComponent,
-          BaseTableComponent = _a$BaseTableComponent === void 0 ? _base.Table : _a$BaseTableComponent,
-          leftTree = _a.leftTree,
-          topTree = _a.topTree,
-          getValue = _a.getValue,
-          getCellProps = _a.getCellProps,
-          primaryColumn = _a.primaryColumn,
-          render = _a.render,
-          openKeysProp = _a.openKeys,
-          defaultOpenKeys = _a.defaultOpenKeys,
-          onChangeOpenKeys = _a.onChangeOpenKeys,
-          indentSize = _a.indentSize,
-          isLeafNode = _a.isLeafNode,
-          baseTableRef = _a.baseTableRef,
-          others = __rest(_a, ["BaseTableComponent", "leftTree", "topTree", "getValue", "getCellProps", "primaryColumn", "render", "openKeys", "defaultOpenKeys", "onChangeOpenKeys", "indentSize", "isLeafNode", "baseTableRef"]);
-
+        _a$BaseTableComponent = _a.BaseTableComponent,
+        BaseTableComponent = _a$BaseTableComponent === void 0 ? _base.Table : _a$BaseTableComponent,
+        leftTree = _a.leftTree,
+        topTree = _a.topTree,
+        getValue = _a.getValue,
+        getCellProps = _a.getCellProps,
+        primaryColumn = _a.primaryColumn,
+        render = _a.render,
+        openKeysProp = _a.openKeys,
+        defaultOpenKeys = _a.defaultOpenKeys,
+        onChangeOpenKeys = _a.onChangeOpenKeys,
+        indentSize = _a.indentSize,
+        isLeafNode = _a.isLeafNode,
+        baseTableRef = _a.baseTableRef,
+        others = __rest(_a, ["BaseTableComponent", "leftTree", "topTree", "getValue", "getCellProps", "primaryColumn", "render", "openKeys", "defaultOpenKeys", "onChangeOpenKeys", "indentSize", "isLeafNode", "baseTableRef"]);
       var openKeys = openKeysProp !== null && openKeysProp !== void 0 ? openKeysProp : this.state.openKeys;
-
       var _buildCrossTreeTable = (0, _buildCrossTreeTable2.default)({
-        leftTree: leftTree,
-        topTree: topTree,
-        getValue: getValue,
-        getCellProps: getCellProps,
-        render: render,
-        primaryColumn: primaryColumn,
-        openKeys: openKeys,
-        onChangeOpenKeys: this.onChangeOpenKeys,
-        indentSize: indentSize,
-        isLeafNode: isLeafNode
-      }),
-          dataSource = _buildCrossTreeTable.dataSource,
-          columns = _buildCrossTreeTable.columns;
-
+          leftTree: leftTree,
+          topTree: topTree,
+          getValue: getValue,
+          getCellProps: getCellProps,
+          render: render,
+          primaryColumn: primaryColumn,
+          openKeys: openKeys,
+          onChangeOpenKeys: this.onChangeOpenKeys,
+          indentSize: indentSize,
+          isLeafNode: isLeafNode
+        }),
+        dataSource = _buildCrossTreeTable.dataSource,
+        columns = _buildCrossTreeTable.columns;
       return /*#__PURE__*/_react.default.createElement(BaseTableComponent, (0, _extends2.default)({
         ref: baseTableRef
       }, others, {
@@ -130,13 +100,11 @@ var CrossTreeTable = /*#__PURE__*/function (_React$Component) {
           openKeys: nextProps.openKeys
         };
       }
-
       return null;
     }
   }]);
   return CrossTreeTable;
 }(_react.default.Component);
-
 exports.default = CrossTreeTable;
 CrossTreeTable.defaultProps = {
   defaultOpenKeys: [],

package/lib/table/pivot/cross-tree-table/index.js

@@ -1,7 +1,6 @@
 "use strict";
 
 var _interopRequireDefault = require("@babel/runtime-corejs3/helpers/interopRequireDefault");
-
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
@@ -17,7 +16,5 @@ Object.defineProperty(exports, "buildCrossTreeTable", {
     return _buildCrossTreeTable.default;
   }
 });
-
 var _crossTreeTable = _interopRequireDefault(require("./cross-tree-table"));
-
 var _buildCrossTreeTable = _interopRequireDefault(require("./buildCrossTreeTable"));

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

@@ -1,41 +1,32 @@
 "use strict";
 
 var _interopRequireDefault = require("@babel/runtime-corejs3/helpers/interopRequireDefault");
-
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.default = buildDrillTree;
-
 var _keys = _interopRequireDefault(require("@babel/runtime-corejs3/core-js-stable/object/keys"));
-
 var _slice = _interopRequireDefault(require("@babel/runtime-corejs3/core-js-stable/instance/slice"));
-
 var _utils = require("../../utils");
-
 var _others = require("../../utils/others");
-
 var _simpleEncode = _interopRequireDefault(require("./simpleEncode"));
-
 /** 根据指定的 code 序列计算下钻树 */
 function buildDrillTree(data, codes) {
   var _ref = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {},
-      _ref$encode = _ref.encode,
-      encode = _ref$encode === void 0 ? _simpleEncode.default : _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 ? (0, _others.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.default : _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 ? (0, _others.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)) {
@@ -44,7 +35,6 @@ function buildDrillTree(data, codes) {
   } else {
     array = dfs(data, []);
   }
-
   if (includeTopWrapper) {
     var rootNode = {
       key: totalKey,
@@ -52,14 +42,11 @@ function buildDrillTree(data, codes) {
       path: emptyPath,
       children: array
     };
-
     if (hasChild) {
       rootNode.hasChild = hasChild;
     }
-
     return [rootNode];
   }
-
   if (includeTopWrapper) {
     return [{
       key: totalKey,
@@ -68,9 +55,7 @@ function buildDrillTree(data, codes) {
       children: array
     }];
   }
-
   return array;
-
   function dfs(slice, path) {
     var depth = path.length;
     var array = [];
@@ -78,7 +63,6 @@ function buildDrillTree(data, codes) {
     var groups = (0, _utils.groupBy)(slice, function (row) {
       return row[code];
     });
-
     for (var _i = 0, _Object$keys = (0, _keys.default)(groups); _i < _Object$keys.length; _i++) {
       var groupKey = _Object$keys[_i];
       path.push(groupKey);
@@ -89,7 +73,6 @@ 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);
@@ -97,10 +80,8 @@ function buildDrillTree(data, codes) {
           node.hasChild = true;
         }
       }
-
       path.pop();
     }
-
     return array;
   }
 }

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

@@ -1,92 +1,67 @@
 "use strict";
 
 var _sliceInstanceProperty = require("@babel/runtime-corejs3/core-js-stable/instance/slice");
-
 var _Array$from = require("@babel/runtime-corejs3/core-js-stable/array/from");
-
 var _Symbol = require("@babel/runtime-corejs3/core-js-stable/symbol");
-
 var _getIteratorMethod = require("@babel/runtime-corejs3/core-js/get-iterator-method");
-
 var _interopRequireDefault = require("@babel/runtime-corejs3/helpers/interopRequireDefault");
-
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.buildRecordMap = buildRecordMap;
 exports.buildRecordMatrix = buildRecordMatrix;
-
 var _slicedToArray2 = _interopRequireDefault(require("@babel/runtime-corejs3/helpers/slicedToArray"));
-
 var _set = _interopRequireDefault(require("@babel/runtime-corejs3/core-js-stable/set"));
-
 var _map = _interopRequireDefault(require("@babel/runtime-corejs3/core-js-stable/instance/map"));
-
 var _filter = _interopRequireDefault(require("@babel/runtime-corejs3/core-js-stable/instance/filter"));
-
 var _map2 = _interopRequireDefault(require("@babel/runtime-corejs3/core-js-stable/map"));
-
 var _utils = require("../../utils");
-
 var _others = require("../../utils/others");
-
 var _buildDrillTree = _interopRequireDefault(require("./buildDrillTree"));
-
 var _simpleEncode = _interopRequireDefault(require("./simpleEncode"));
-
 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; }
-
 function fallbackAggregate(slice) {
   return slice.length === 1 ? slice[0] : {};
 }
 /** 根据表格左侧与上方的下钻树，从全量明细数据中计算对应的数据立方 */
-
-
 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.default : _ref$encode,
-      _ref$isLeftExpand = _ref.isLeftExpand,
-      isLeftExpand = _ref$isLeftExpand === void 0 ? (0, _others.always)(true) : _ref$isLeftExpand,
-      _ref$isTopExpand = _ref.isTopExpand,
-      isTopExpand = _ref$isTopExpand === void 0 ? (0, _others.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.default : _ref$encode,
+    _ref$isLeftExpand = _ref.isLeftExpand,
+    isLeftExpand = _ref$isLeftExpand === void 0 ? (0, _others.always)(true) : _ref$isLeftExpand,
+    _ref$isTopExpand = _ref.isTopExpand,
+    isTopExpand = _ref$isTopExpand === void 0 ? (0, _others.always)(true) : _ref$isTopExpand,
+    prebuiltLeftTree = _ref.prebuiltLeftTree,
+    prebuiltTopTree = _ref.prebuiltTopTree;
   var ctx = {
     peculiarity: new _set.default()
   };
-
   var _ref2 = prebuiltLeftTree !== null && prebuiltLeftTree !== void 0 ? prebuiltLeftTree : (0, _buildDrillTree.default)(data, leftCodes, {
-    encode: encode,
-    includeTopWrapper: true,
-    isExpand: isLeftExpand
-  }),
-      _ref3 = (0, _slicedToArray2.default)(_ref2, 1),
-      leftRootDrillNode = _ref3[0];
-
+      encode: encode,
+      includeTopWrapper: true,
+      isExpand: isLeftExpand
+    }),
+    _ref3 = (0, _slicedToArray2.default)(_ref2, 1),
+    leftRootDrillNode = _ref3[0];
   var _ref4 = prebuiltTopTree !== null && prebuiltTopTree !== void 0 ? prebuiltTopTree : (0, _buildDrillTree.default)(data, topCodes, {
-    encode: encode,
-    includeTopWrapper: true,
-    isExpand: isTopExpand
-  }),
-      _ref5 = (0, _slicedToArray2.default)(_ref4, 1),
-      topRootDrillNode = _ref5[0];
-
+      encode: encode,
+      includeTopWrapper: true,
+      isExpand: isTopExpand
+    }),
+    _ref5 = (0, _slicedToArray2.default)(_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 ((0, _utils.isLeafNode)(drillNode)) {
       col = buildByTop(ctx, slice, topRootDrillNode, 0);
     } else {
@@ -96,15 +71,12 @@ 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));
           }
@@ -114,24 +86,20 @@ function buildRecordMatrix(_ref) {
       } finally {
         _iterator.f();
       }
-
       ctx.peculiarity.delete(code);
       col = mergeColsByTopTree(ctx, (0, _map.default)(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 ((0, _utils.isLeafNode)(drillNode)) {
       record = aggregate(slice, ctx);
     } else {
@@ -141,15 +109,12 @@ 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));
           }
@@ -159,13 +124,11 @@ function buildRecordMatrix(_ref) {
       } finally {
         _iterator2.f();
       }
-
       ctx.peculiarity.delete(code);
       record = aggregate((0, _map.default)(children).call(children, function (child) {
         return child.record;
       }), ctx);
     }
-
     return {
       topKey: drillNode.key,
       topValue: drillNode.value,
@@ -173,19 +136,15 @@ 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((0, _map.default)(cols).call(cols, function (c) {
         return c.record;
       }), ctx);
-
       if (!(0, _utils.isLeafNode)(topDrillNode)) {
         var _context, _context3;
-
         var topCode = topCodes[depth];
         ctx.peculiarity.add(topCode);
         var drillChildDict = (0, _others.fromEntries)((0, _map.default)(_context = topDrillNode.children).call(_context, function (child) {
@@ -193,14 +152,12 @@ function buildRecordMatrix(_ref) {
         }));
         var colChildDictArray = (0, _map.default)(cols).call(cols, function (col) {
           var _context2;
-
           return (0, _others.fromEntries)((0, _map.default)(_context2 = col.children).call(_context2, function (child) {
             return [child.topValue, child];
           }));
         });
         children = (0, _map.default)(_context3 = topDrillNode.children).call(_context3, function (item) {
           var _context4;
-
           var childCols = (0, _filter.default)(_context4 = (0, _map.default)(colChildDictArray).call(colChildDictArray, function (colChildDict) {
             return colChildDict[item.value];
           })).call(_context4, Boolean);
@@ -208,7 +165,6 @@ function buildRecordMatrix(_ref) {
         });
         ctx.peculiarity.delete(topCode);
       }
-
       return {
         topKey: topDrillNode.key,
         topValue: topDrillNode.value,
@@ -217,27 +173,22 @@ function buildRecordMatrix(_ref) {
       };
     }
   }
-
   function makeMatrix(rootRow) {
     var result = new _map2.default();
     dfsRow(result, rootRow);
     return result;
-
     function dfsRow(matrix, row) {
       var subMap = new _map2.default();
       matrix.set(row.leftKey, subMap);
       dfsCol(subMap, row.col);
-
       if (!(0, _utils.isLeafNode)(row)) {
         row.children.forEach(function (childRow) {
           dfsRow(matrix, childRow);
         });
       }
     }
-
     function dfsCol(subMap, col) {
       subMap.set(col.topKey, col.record);
-
       if (!(0, _utils.isLeafNode)(col)) {
         col.children.forEach(function (childCol) {
           dfsCol(subMap, childCol);
@@ -248,15 +199,13 @@ function buildRecordMatrix(_ref) {
 }
 /** buildRecordMatrix 的简化版本，只能处理一个维度序列，返回一个 Map。
  * 相当于只处理 matrix 的第一行（汇总行） */
-
-
 function buildRecordMap(_ref6) {
   var codes = _ref6.codes,
-      _ref6$encode = _ref6.encode,
-      encode = _ref6$encode === void 0 ? _simpleEncode.default : _ref6$encode,
-      data = _ref6.data,
-      aggregate = _ref6.aggregate,
-      isExpand = _ref6.isExpand;
+    _ref6$encode = _ref6.encode,
+    encode = _ref6$encode === void 0 ? _simpleEncode.default : _ref6$encode,
+    data = _ref6.data,
+    aggregate = _ref6.aggregate,
+    isExpand = _ref6.isExpand;
   var matrix = buildRecordMatrix({
     data: data,
     leftCodes: [],