@kdcloudjs/table 1.0.0

package/es/table/pivot/cross-tree-table/cross-tree-table.d.ts

@@ -0,0 +1,38 @@
+import React from 'react';
+import { noop } from 'rxjs';
+import { Table, TableProps } from '../../base';
+import { CellProps } from '../../interfaces';
+import { CrossTableLeftMetaColumn, LeftCrossTreeNode, TopCrossTreeNode } from '../cross-table';
+export interface CrossTreeTableProps extends Omit<TableProps, 'dataSource' | 'columns' | 'primaryKey'> {
+    BaseTableComponent?: any;
+    baseTableRef?: React.Ref<Table>;
+    primaryColumn: CrossTableLeftMetaColumn;
+    leftTree: LeftCrossTreeNode[];
+    topTree: TopCrossTreeNode[];
+    defaultOpenKeys?: string[];
+    openKeys?: string[];
+    onChangeOpenKeys?(nextOpenKeys: string[]): void;
+    indentSize?: number;
+    isLeafNode?(node: any, nodeMeta: {
+        depth: number;
+        expanded: boolean;
+        rowKey: string;
+    }): boolean;
+    getValue(leftNode: LeftCrossTreeNode, topNode: TopCrossTreeNode, leftDepth: number, topDepth: number): any;
+    render?(value: any, leftNode: LeftCrossTreeNode, topNode: TopCrossTreeNode, leftDepth: number, topDepth: number): React.ReactNode;
+    getCellProps?(value: any, leftNode: LeftCrossTreeNode, topNode: TopCrossTreeNode, leftDepth: number, topDepth: number): CellProps;
+}
+export default class CrossTreeTable extends React.Component<CrossTreeTableProps, {
+    openKeys: string[];
+}> {
+    static defaultProps: {
+        defaultOpenKeys: string[];
+        onChangeOpenKeys: typeof noop;
+    };
+    static getDerivedStateFromProps(nextProps: Readonly<CrossTreeTableProps>): {
+        openKeys: string[];
+    };
+    constructor(props: Readonly<CrossTreeTableProps>);
+    onChangeOpenKeys: (nextOpenKeys: string[]) => void;
+    render(): JSX.Element;
+}

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

@@ -0,0 +1,127 @@
+import _Reflect$construct from "@babel/runtime-corejs3/core-js-stable/reflect/construct";
+import _extends from "@babel/runtime-corejs3/helpers/extends";
+import _classCallCheck from "@babel/runtime-corejs3/helpers/classCallCheck";
+import _createClass from "@babel/runtime-corejs3/helpers/createClass";
+import _inherits from "@babel/runtime-corejs3/helpers/inherits";
+import _possibleConstructorReturn from "@babel/runtime-corejs3/helpers/possibleConstructorReturn";
+import _getPrototypeOf from "@babel/runtime-corejs3/helpers/getPrototypeOf";
+
+function _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = _getPrototypeOf(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = _getPrototypeOf(this).constructor; result = _Reflect$construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return _possibleConstructorReturn(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; } }
+
+import _Object$getOwnPropertySymbols from "@babel/runtime-corejs3/core-js-stable/object/get-own-property-symbols";
+
+var __rest = this && this.__rest || function (s, e) {
+  var t = {};
+
+  for (var p in s) {
+    if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0) t[p] = s[p];
+  }
+
+  if (s != null && typeof _Object$getOwnPropertySymbols === "function") for (var i = 0, p = _Object$getOwnPropertySymbols(s); i < p.length; i++) {
+    if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i])) t[p[i]] = s[p[i]];
+  }
+  return t;
+};
+
+import React from 'react';
+import { noop } from 'rxjs';
+import { Table } from '../../base';
+import { ROW_KEY } from '../cross-table';
+import buildCrossTreeTable from './buildCrossTreeTable';
+
+var CrossTreeTable = /*#__PURE__*/function (_React$Component) {
+  _inherits(CrossTreeTable, _React$Component);
+
+  var _super = _createSuper(CrossTreeTable);
+
+  function CrossTreeTable(props) {
+    var _this;
+
+    _classCallCheck(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;
+  }
+
+  _createClass(CrossTreeTable, [{
+    key: "render",
+    value: function render() {
+      var _a = this.props,
+          _a$BaseTableComponent = _a.BaseTableComponent,
+          BaseTableComponent = _a$BaseTableComponent === void 0 ? 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 = buildCrossTreeTable({
+        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.createElement(BaseTableComponent, _extends({
+        ref: baseTableRef
+      }, others, {
+        primaryKey: ROW_KEY,
+        dataSource: dataSource,
+        columns: columns
+      }));
+    }
+  }], [{
+    key: "getDerivedStateFromProps",
+    value: function getDerivedStateFromProps(nextProps) {
+      if ('openKeys' in nextProps) {
+        return {
+          openKeys: nextProps.openKeys
+        };
+      }
+
+      return null;
+    }
+  }]);
+
+  return CrossTreeTable;
+}(React.Component);
+
+export { CrossTreeTable as default };
+CrossTreeTable.defaultProps = {
+  defaultOpenKeys: [],
+  onChangeOpenKeys: noop
+};

package/es/table/pivot/cross-tree-table/index.d.ts

@@ -0,0 +1,2 @@
+export { default as CrossTreeTable, CrossTreeTableProps } from './cross-tree-table';
+export { default as buildCrossTreeTable, BuildCrossTreeTableOptions } from './buildCrossTreeTable';

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

@@ -0,0 +1,2 @@
+export { default as CrossTreeTable } from './cross-tree-table';
+export { default as buildCrossTreeTable } from './buildCrossTreeTable';

package/es/table/pivot/pivot-utils/buildDrillTree.d.ts

@@ -0,0 +1,16 @@
+import { DrillNode } from './interfaces';
+export interface BuildDrillTreeOptions<T extends DrillNode> {
+    /** 是否生成顶层的「总计」节点，默认不生成 */
+    includeTopWrapper?: boolean;
+    /** 生成顶层节点时，顶层节点内的文本值，默认为「总计」 */
+    totalValue?: string;
+    /** 自定义的编码函数，用于根据下钻的值序列生成唯一的字符串.
+     * 该参数留空 表示使用默认的编码方式 */
+    encode?(path: string[]): string;
+    /** 判断一个节点是否展开，没有展开的节点将不进行下钻 */
+    isExpand?(key: string): boolean;
+    /** 是否强制展开总计节点，默认为 true */
+    enforceExpandTotalNode?: boolean;
+}
+/** 根据指定的 code 序列计算下钻树 */
+export default function buildDrillTree(data: any[], codes: string[], { encode, totalValue, includeTopWrapper, isExpand, enforceExpandTotalNode, }?: BuildDrillTreeOptions<DrillNode>): DrillNode[];

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

@@ -0,0 +1,93 @@
+import _Object$keys2 from "@babel/runtime-corejs3/core-js-stable/object/keys";
+import _sliceInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/slice";
+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;
+
+  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 = 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);
+      var node = {
+        key: encode(path),
+        value: groupKey,
+        path: _sliceInstanceProperty(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/es/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/es/table/pivot/pivot-utils/builders.js

@@ -0,0 +1,252 @@
+import _sliceInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/slice";
+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 _getIterator from "@babel/runtime-corejs3/core-js/get-iterator";
+import _slicedToArray from "@babel/runtime-corejs3/helpers/slicedToArray";
+
+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; }
+
+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";
+import _Map from "@babel/runtime-corejs3/core-js-stable/map";
+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;
+  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];
+
+  var _ref4 = prebuiltTopTree !== null && prebuiltTopTree !== void 0 ? prebuiltTopTree : buildDrillTree(data, topCodes, {
+    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 {
+      children = [];
+      var code = leftCodes[depth];
+      var groups = 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, _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 {
+      children = [];
+      var code = topCodes[depth];
+      var groups = 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(_mapInstanceProperty(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(_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,
+        record: record,
+        children: children
+      };
+    }
+  }
+
+  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);
+        });
+      }
+    }
+  }
+}
+/** 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;
+  var matrix = buildRecordMatrix({
+    data: data,
+    leftCodes: [],
+    topCodes: codes,
+    isTopExpand: isExpand,
+    aggregate: aggregate,
+    encode: encode
+  });
+  var totalKey = encode([]);
+  return matrix.get(totalKey);
+}

package/es/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 {};