@kdcloudjs/table 1.0.0

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

@@ -0,0 +1,106 @@
+"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;
+
+  var emptyPath = [];
+  var totalKey = encode(emptyPath);
+  var array;
+  var hasChild = false;
+
+  if (codes.length === 0) {
+    array = [];
+  } else if (!enforceExpandTotalNode && !isExpand(totalKey)) {
+    array = [];
+    hasChild = data.length > 0;
+  } else {
+    array = dfs(data, []);
+  }
+
+  if (includeTopWrapper) {
+    var rootNode = {
+      key: totalKey,
+      value: totalValue,
+      path: emptyPath,
+      children: array
+    };
+
+    if (hasChild) {
+      rootNode.hasChild = hasChild;
+    }
+
+    return [rootNode];
+  }
+
+  if (includeTopWrapper) {
+    return [{
+      key: totalKey,
+      value: totalValue,
+      path: emptyPath,
+      children: array
+    }];
+  }
+
+  return array;
+
+  function dfs(slice, path) {
+    var depth = path.length;
+    var array = [];
+    var code = codes[depth];
+    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);
+      var node = {
+        key: encode(path),
+        value: groupKey,
+        path: (0, _slice.default)(path).call(path)
+      };
+      array.push(node);
+      var group = groups[groupKey];
+
+      if (group.length > 0 && depth < codes.length - 1) {
+        if (isExpand(node.key)) {
+          node.children = dfs(group, path);
+        } else {
+          node.hasChild = true;
+        }
+      }
+
+      path.pop();
+    }
+
+    return array;
+  }
+}

package/lib/table/pivot/pivot-utils/builders.d.ts

@@ -0,0 +1,26 @@
+import { DrillNode, RecordMatrix } from './interfaces';
+export interface BuildingCtx {
+    peculiarity: Set<string>;
+}
+export interface BuildRecordMatrixConfig {
+    leftCodes: string[];
+    topCodes: string[];
+    data: any[];
+    aggregate?(slice: any[], ctx: BuildingCtx): any;
+    encode?(valuePath: string[]): string;
+    isLeftExpand?(key: string): boolean;
+    isTopExpand?(key: string): boolean;
+    prebuiltLeftTree?: DrillNode[];
+    prebuiltTopTree?: DrillNode[];
+}
+/** 根据表格左侧与上方的下钻树，从全量明细数据中计算对应的数据立方 */
+export declare function buildRecordMatrix({ data, leftCodes, topCodes, aggregate, encode, isLeftExpand, isTopExpand, prebuiltLeftTree, prebuiltTopTree, }: BuildRecordMatrixConfig): RecordMatrix;
+/** buildRecordMatrix 的简化版本，只能处理一个维度序列，返回一个 Map。
+ * 相当于只处理 matrix 的第一行（汇总行） */
+export declare function buildRecordMap({ codes, encode, data, aggregate, isExpand, }: {
+    codes: string[];
+    data: any[];
+    aggregate?(slice: any[], ctx: BuildingCtx): any;
+    encode?(valuePath: string[]): string;
+    isExpand?(key: string): boolean;
+}): Map<string, any>;

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

@@ -0,0 +1,272 @@
+"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 _getIterator = require("@babel/runtime-corejs3/core-js/get-iterator");
+
+var _interopRequireDefault = require("@babel/runtime-corejs3/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.buildRecordMatrix = buildRecordMatrix;
+exports.buildRecordMap = buildRecordMap;
+
+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; if (typeof _Symbol === "undefined" || _getIteratorMethod(o) == null) { 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 = _getIterator(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;
+  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];
+
+  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];
+
+  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 {
+      children = [];
+      var code = leftCodes[depth];
+      var groups = (0, _utils.groupBy)(slice, function (dwdRow) {
+        return dwdRow[code];
+      });
+      ctx.peculiarity.add(code);
+
+      var _iterator = _createForOfIteratorHelper(drillNode.children),
+          _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));
+          }
+        }
+      } catch (err) {
+        _iterator.e(err);
+      } 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 {
+      children = [];
+      var code = topCodes[depth];
+      var groups = (0, _utils.groupBy)(slice, function (dwdRow) {
+        return dwdRow[code];
+      });
+      ctx.peculiarity.add(code);
+
+      var _iterator2 = _createForOfIteratorHelper(drillNode.children),
+          _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));
+          }
+        }
+      } catch (err) {
+        _iterator2.e(err);
+      } 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,
+      children: children,
+      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) {
+          return [child.value, child];
+        }));
+        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);
+          return dfs(ctx, childCols, drillChildDict[item.value], depth + 1);
+        });
+        ctx.peculiarity.delete(topCode);
+      }
+
+      return {
+        topKey: topDrillNode.key,
+        topValue: topDrillNode.value,
+        record: record,
+        children: children
+      };
+    }
+  }
+
+  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);
+        });
+      }
+    }
+  }
+}
+/** 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;
+  var matrix = buildRecordMatrix({
+    data: data,
+    leftCodes: [],
+    topCodes: codes,
+    isTopExpand: isExpand,
+    aggregate: aggregate,
+    encode: encode
+  });
+  var totalKey = encode([]);
+  return matrix.get(totalKey);
+}

package/lib/table/pivot/pivot-utils/convert-utils.d.ts

@@ -0,0 +1,31 @@
+import { CrossTableIndicator, CrossTreeNode } from '../cross-table';
+import { DrillNode } from './interfaces';
+declare type ConvertOptions<T extends CrossTreeNode = CrossTreeNode> = {
+    /** 需要在子节点处附加的 指标节点 */
+    indicators?: CrossTableIndicator[];
+    /** 自定义的编码函数，用于根据下钻的值序列生成唯一的字符串.
+     * 该参数留空 表示使用默认的编码方式 */
+    encode?(valuePath: string[]): string;
+    /** 为一个值序列生成小计（sub-total）节点.
+     * 针对每一个父节点，该函数都将被调用一次；
+     * * 函数返回 null, 表示对应父节点不需要小计节点；
+     * * 返回 `{ position: 'start' | 'end', value: string; data?: any }`
+     *  表明所要生成的小计节点的摆放位置、文本、附加的数据
+     *
+     * 该参数留空 表示所有节点均不需要生成小计节点 */
+    generateSubtotalNode?(drillNode: DrillNode): null | {
+        position: 'start' | 'end';
+        value: string;
+    };
+    /** 是否支持节点的展开与收拢，默认为 false。
+     * 当该选项为 true 时，展开/收拢才会开启，相关的按钮也才会被渲染 */
+    supportsExpand?: boolean;
+    /** 展开的节点的 key 数组 */
+    expandKeys?: string[];
+    /** 展开节点发生变化时的回调 */
+    onChangeExpandKeys?(nextKeys: string[], targetNode: DrillNode, action: 'collapse' | 'expand'): void;
+    /** 是否强制展开总计节点，默认为 true */
+    enforceExpandTotalNode?: boolean;
+};
+export declare function convertDrillTreeToCrossTree<T extends CrossTreeNode = CrossTreeNode>(drillTree: DrillNode[], { indicators, encode, generateSubtotalNode, enforceExpandTotalNode, expandKeys, onChangeExpandKeys, supportsExpand, }?: ConvertOptions<T>): T[];
+export {};

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

@@ -0,0 +1,204 @@
+"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 _getIterator = require("@babel/runtime-corejs3/core-js/get-iterator");
+
+var _interopRequireDefault = require("@babel/runtime-corejs3/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.convertDrillTreeToCrossTree = convertDrillTreeToCrossTree;
+
+var _set = _interopRequireDefault(require("@babel/runtime-corejs3/core-js-stable/set"));
+
+var _map = _interopRequireDefault(require("@babel/runtime-corejs3/core-js-stable/instance/map"));
+
+var _concat = _interopRequireDefault(require("@babel/runtime-corejs3/core-js-stable/instance/concat"));
+
+var _filter = _interopRequireDefault(require("@babel/runtime-corejs3/core-js-stable/instance/filter"));
+
+var _extends2 = _interopRequireDefault(require("@babel/runtime-corejs3/helpers/extends"));
+
+var _taggedTemplateLiteral2 = _interopRequireDefault(require("@babel/runtime-corejs3/helpers/taggedTemplateLiteral"));
+
+var _react = _interopRequireDefault(require("react"));
+
+var _rxjs = require("rxjs");
+
+var _styledComponents = _interopRequireDefault(require("styled-components"));
+
+var _commonViews = require("../../common-views");
+
+var _utils = require("../../utils");
+
+var _simpleEncode = _interopRequireDefault(require("./simpleEncode"));
+
+var _templateObject;
+
+function _createForOfIteratorHelper(o, allowArrayLike) { var it; if (typeof _Symbol === "undefined" || _getIteratorMethod(o) == null) { 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 = _getIterator(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; }
+
+var ExpandSpan = _styledComponents.default.span(_templateObject || (_templateObject = (0, _taggedTemplateLiteral2.default)(["\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    &.expanded {\n      transform-origin: center center;\n      transform: rotate(90deg);\n    }\n  }\n"])));
+
+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.default : _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 ? _rxjs.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.default(expandKeys);
+  return dfs(drillTree, 0);
+  /** 在 indicators 非空的情况下获取指标对应的 CrossTreeNode */
+
+  function getIndicators(node, nodeData) {
+    return (0, _map.default)(indicators).call(indicators, function (indicator) {
+      var _context;
+
+      return (0, _extends2.default)({
+        key: encode((0, _concat.default)(_context = node.path).call(_context, [indicator.code])),
+        value: indicator.name,
+        data: (0, _extends2.default)((0, _extends2.default)({}, nodeData), {
+          indicator: indicator
+        })
+      }, indicator);
+    });
+  }
+
+  function drillNodeToTreeNode(node, nodeData) {
+    if (indicators != null) {
+      return {
+        key: node.key,
+        value: node.value,
+        data: nodeData,
+        children: getIndicators(node, nodeData)
+      };
+    } else {
+      return {
+        key: node.key,
+        value: node.value,
+        data: nodeData
+      };
+    }
+  }
+
+  function dfs(drillNodes, depth) {
+    var result = [];
+
+    var _iterator = _createForOfIteratorHelper(drillNodes),
+        _step;
+
+    try {
+      var _loop = function _loop() {
+        var node = _step.value;
+        var nodeData = {
+          dataKey: node.key,
+          dataPath: node.path
+        };
+
+        if ((0, _utils.isLeafNode)(node) && !node.hasChild) {
+          result.push(drillNodeToTreeNode(node, nodeData));
+        } else {
+          var needProcessChildren = true;
+          var crossTreeNode = {
+            key: node.key,
+            value: node.value,
+            data: nodeData
+          };
+
+          if (!supportsExpand || enforceExpandTotalNode && node.key === totalKey) {
+            // 不支持展开功能 或是强制展开
+            crossTreeNode.children = dfs(node.children, depth + 1);
+          } else if (expandKeySet.has(node.key)) {
+            // 展开的父节点
+            // @ts-ignore
+            crossTreeNode.title = /*#__PURE__*/_react.default.createElement(ExpandSpan, {
+              onClick: function onClick() {
+                onChangeExpandKeys((0, _filter.default)(expandKeys).call(expandKeys, function (k) {
+                  return k !== node.key;
+                }), node, 'collapse');
+              }
+            }, /*#__PURE__*/_react.default.createElement(_commonViews.icons.CaretRight, {
+              className: "icon expanded"
+            }), node.value);
+            crossTreeNode.children = dfs(node.children, depth + 1);
+          } else {
+            // 收拢的父节点
+            needProcessChildren = false;
+            crossTreeNode.title = /*#__PURE__*/_react.default.createElement(ExpandSpan, {
+              onClick: function onClick() {
+                onChangeExpandKeys((0, _concat.default)(expandKeys).call(expandKeys, [node.key]), node, 'expand');
+              }
+            }, /*#__PURE__*/_react.default.createElement(_commonViews.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;
+              var subtotalPath = (0, _concat.default)(_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 {
+                crossTreeNode.children.push(subtotalTreeNode);
+              }
+            }
+          }
+
+          result.push(crossTreeNode);
+        }
+      };
+
+      for (_iterator.s(); !(_step = _iterator.n()).done;) {
+        _loop();
+      }
+    } catch (err) {
+      _iterator.e(err);
+    } finally {
+      _iterator.f();
+    }
+
+    return result;
+  }
+}

package/lib/table/pivot/pivot-utils/index.d.ts

@@ -0,0 +1,5 @@
+export { buildRecordMatrix, BuildRecordMatrixConfig, buildRecordMap } from './builders';
+export { default as buildDrillTree, BuildDrillTreeOptions } from './buildDrillTree';
+export { default as simpleEncode } from './simpleEncode';
+export { RecordMatrix, DrillNode } from './interfaces';
+export * from './convert-utils';