@kdcloudjs/table 1.0.0

package/lib/table/utils/others.js

@@ -0,0 +1,108 @@
+"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.flatMap = flatMap;
+exports.fromEntries = fromEntries;
+exports.always = always;
+exports.findByTree = findByTree;
+exports.arrayUtils = void 0;
+
+var _set = _interopRequireDefault(require("@babel/runtime-corejs3/core-js-stable/set"));
+
+var _filter = _interopRequireDefault(require("@babel/runtime-corejs3/core-js-stable/instance/filter"));
+
+var _concat = _interopRequireDefault(require("@babel/runtime-corejs3/core-js-stable/instance/concat"));
+
+var _find = _interopRequireDefault(require("@babel/runtime-corejs3/core-js-stable/instance/find"));
+
+var _slicedToArray2 = _interopRequireDefault(require("@babel/runtime-corejs3/helpers/slicedToArray"));
+
+var _toConsumableArray2 = _interopRequireDefault(require("@babel/runtime-corejs3/helpers/toConsumableArray"));
+
+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 _context; if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = _sliceInstanceProperty(_context = Object.prototype.toString.call(o)).call(_context, 8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return _Array$from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
+
+function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
+
+function flatMap(array, callback) {
+  var result = [];
+  array.forEach(function (value, index) {
+    result.push.apply(result, (0, _toConsumableArray2.default)(callback(value, index, array)));
+  });
+  return result;
+}
+
+function fromEntries(entries) {
+  var result = {};
+
+  var _iterator = _createForOfIteratorHelper(entries),
+      _step;
+
+  try {
+    for (_iterator.s(); !(_step = _iterator.n()).done;) {
+      var _step$value = (0, _slicedToArray2.default)(_step.value, 2),
+          key = _step$value[0],
+          value = _step$value[1];
+
+      result[key] = value;
+    }
+  } catch (err) {
+    _iterator.e(err);
+  } finally {
+    _iterator.f();
+  }
+
+  return result;
+}
+
+var arrayUtils = {
+  diff: function diff(arr1, arr2) {
+    var set = new _set.default(arr2);
+    return (0, _filter.default)(arr1).call(arr1, function (x) {
+      return !set.has(x);
+    });
+  },
+  merge: function merge(arr1, arr2) {
+    var set = new _set.default(arr1);
+    return (0, _concat.default)(arr1).call(arr1, (0, _filter.default)(arr2).call(arr2, function (x) {
+      return !set.has(x);
+    }));
+  }
+};
+exports.arrayUtils = arrayUtils;
+
+function always(value) {
+  return function () {
+    return value;
+  };
+}
+
+function findByTree(array, callback) {
+  return (0, _find.default)(array).call(array, function (item, index) {
+    var result = false;
+    var findedIndex = callback(item, index, array);
+
+    if (findedIndex >= 0) {
+      result = true;
+    } else if (item.children) {
+      result = findByTree(item.children, callback);
+    }
+
+    return result;
+  });
+}

package/lib/table/utils/proto.d.ts

@@ -0,0 +1,21 @@
+declare type SameKeysWith<T> = T extends object ? {
+    [key in keyof T]?: any;
+} : T;
+interface ObjectProto<T> {
+    (v: SameKeysWith<T>): T;
+    extends(ext: SameKeysWith<T>): ObjectProto<T>;
+}
+interface ArrayProto<T> {
+    (items: SameKeysWith<T>[]): T[];
+    extends(extRecord: SameKeysWith<T>): ArrayProto<T>;
+}
+export interface ProtoStatic {
+    string(v: string): string;
+    number(v: number): number;
+    notNull<T = any>(v: any): T;
+    object<O extends object = any>(base: SameKeysWith<O>): ObjectProto<O>;
+    array<T extends object = any>(base: SameKeysWith<T>): ArrayProto<T>;
+    readonly empty: unique symbol;
+}
+declare const _default: ProtoStatic;
+export default _default;

package/lib/table/utils/proto.js

@@ -0,0 +1,117 @@
+"use strict";
+
+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 _symbol = _interopRequireDefault(require("@babel/runtime-corejs3/core-js-stable/symbol"));
+
+var _keys = _interopRequireDefault(require("@babel/runtime-corejs3/core-js-stable/object/keys"));
+
+var _map = _interopRequireDefault(require("@babel/runtime-corejs3/core-js-stable/instance/map"));
+
+var factorySymbol = (0, _symbol.default)('factory-symbol');
+
+function isProtoFactory(v) {
+  return v && v[factorySymbol];
+}
+
+function proto(baseRecord) {
+  var ensureArray = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'auto';
+  var baseKeys = (0, _keys.default)(baseRecord);
+
+  function process(record) {
+    var result = (0, _extends2.default)({}, record);
+    baseKeys.forEach(function (key) {
+      var _a;
+
+      if (result[key] === proto.empty) {
+        delete result[key];
+        return;
+      }
+
+      var base = baseRecord[key];
+
+      if (isProtoFactory(base)) {
+        result[key] = base(result[key]);
+      } else {
+        result[key] = (_a = result[key]) !== null && _a !== void 0 ? _a : base;
+      }
+    });
+    return result;
+  }
+
+  function factory(arg) {
+    var isEnsureArray = ensureArray === 'auto' ? Array.isArray(arg) : ensureArray;
+
+    if (isEnsureArray) {
+      if (arg == null) {
+        return [];
+      }
+
+      return (0, _map.default)(arg).call(arg, process);
+    } else {
+      return process(arg);
+    }
+  } // @ts-ignore
+
+
+  factory[factorySymbol] = true;
+
+  factory.extends = function (extRecord) {
+    var extFactory = proto(extRecord, ensureArray);
+    return function (arg) {
+      return factory(extFactory(arg));
+    };
+  };
+
+  return factory;
+}
+
+proto.empty = (0, _symbol.default)('proto.empty');
+
+proto.string = function (v) {
+  if (v != null && typeof v !== 'string') {
+    throw new Error('must be string');
+  }
+
+  return v;
+};
+
+proto.string[factorySymbol] = true;
+
+proto.number = function (v) {
+  if (v != null && typeof v !== 'number') {
+    throw new Error('must be number');
+  }
+
+  return v;
+};
+
+proto.number[factorySymbol] = true;
+
+proto.notNull = function (v) {
+  if (v == null) {
+    throw new Error('must be not null');
+  }
+
+  return v;
+};
+
+proto.notNull[factorySymbol] = true;
+
+proto.object = function (baseRecord) {
+  return proto(baseRecord, false);
+};
+
+proto.array = function (baseRecord) {
+  return proto(baseRecord, true);
+};
+
+var _default = proto;
+exports.default = _default;

package/lib/table/utils/smartCompare.d.ts

@@ -0,0 +1,9 @@
+/** 比较函数，支持字符串、数字、数组和 null。
+ * * 对于字符串将比较两者的字典序；
+ * * 对数字将比较两者大小；
+ * * null 值在比较时总是小于另一个值；
+ * * 对于数组来说，将逐个比较数组中的元素，第一个不相等的比较结果将作为整个数组的比较结果
+ *
+ * 数组的比较可参考 python 中的元祖比较：
+ * https://stackoverflow.com/questions/5292303/how-does-tuple-comparison-work-in-python */
+export default function smartCompare(x: any, y: any): number;

package/lib/table/utils/smartCompare.js

@@ -0,0 +1,58 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = smartCompare;
+
+/** 比较函数，支持字符串、数字、数组和 null。
+ * * 对于字符串将比较两者的字典序；
+ * * 对数字将比较两者大小；
+ * * null 值在比较时总是小于另一个值；
+ * * 对于数组来说，将逐个比较数组中的元素，第一个不相等的比较结果将作为整个数组的比较结果
+ *
+ * 数组的比较可参考 python 中的元祖比较：
+ * https://stackoverflow.com/questions/5292303/how-does-tuple-comparison-work-in-python */
+function smartCompare(x, y) {
+  // 将 null 排在最后面
+  if (x == null) {
+    return 1;
+  }
+
+  if (y == null) {
+    return -1;
+  }
+
+  if (typeof x === 'number' && typeof y === 'number') {
+    return x - y;
+  }
+
+  if (typeof x === 'string' && typeof y === 'string') {
+    // 字符串使用 默认的字典序
+    if (x < y) {
+      return -1;
+    } else if (x > y) {
+      return 1;
+    } else {
+      return 0;
+    }
+  }
+
+  if (Array.isArray(x) && Array.isArray(y)) {
+    var len = Math.min(x.length, y.length);
+
+    for (var i = 0; i < len; i++) {
+      var cmp = smartCompare(x[i], y[i]);
+
+      if (cmp !== 0) {
+        return cmp;
+      }
+    } // 数组长度不等时，元素少的字段放在前面
+
+
+    return x.length - y.length;
+  } // 对于不认识的数据类型，返回 0
+
+
+  return 0;
+}

package/lib/table/utils/traverseColumn.d.ts

@@ -0,0 +1,11 @@
+import { ArtColumn, TableTransform } from '../interfaces';
+declare type NormalizeAsArrayInput<T> = null | T | T[];
+/** @deprecated 该 API 已经过时，请使用 makeRecursiveMapper */
+export default function traverseColumn(fn: (column: ArtColumn, ctx: {
+    range: {
+        start: number;
+        end: number;
+    };
+    dataSource: any[];
+}) => NormalizeAsArrayInput<ArtColumn>): TableTransform;
+export {};

package/lib/table/utils/traverseColumn.js

@@ -0,0 +1,103 @@
+"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.default = traverseColumn;
+
+var _toConsumableArray2 = _interopRequireDefault(require("@babel/runtime-corejs3/helpers/toConsumableArray"));
+
+var _extends2 = _interopRequireDefault(require("@babel/runtime-corejs3/helpers/extends"));
+
+var _isLeafNode = _interopRequireDefault(require("./isLeafNode"));
+
+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 _context; if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = _sliceInstanceProperty(_context = Object.prototype.toString.call(o)).call(_context, 8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return _Array$from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
+
+function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
+
+function normalizeAsArray(input) {
+  if (input == null) {
+    return [];
+  } else if (Array.isArray(input)) {
+    return input;
+  } else {
+    return [input];
+  }
+}
+/** @deprecated 该 API 已经过时，请使用 makeRecursiveMapper */
+
+
+function traverseColumn(fn) {
+  return function (_ref) {
+    var columns = _ref.columns,
+        dataSource = _ref.dataSource;
+    return {
+      dataSource: dataSource,
+      columns: dfs(columns, 0).result
+    };
+
+    function dfs(columns, parentStartColIndex) {
+      var flatColCount = 0;
+      var result = [];
+
+      var _iterator = _createForOfIteratorHelper(columns),
+          _step;
+
+      try {
+        for (_iterator.s(); !(_step = _iterator.n()).done;) {
+          var col = _step.value;
+          var startColIndex = parentStartColIndex + flatColCount;
+          var unNormalized = void 0;
+
+          if ((0, _isLeafNode.default)(col)) {
+            unNormalized = fn(col, {
+              range: {
+                start: startColIndex,
+                end: startColIndex + 1
+              },
+              dataSource: dataSource
+            });
+            flatColCount += 1;
+          } else {
+            var dfsResult = dfs(col.children, startColIndex);
+            unNormalized = fn((0, _extends2.default)((0, _extends2.default)({}, col), {
+              children: dfsResult.result
+            }), {
+              range: {
+                start: startColIndex,
+                end: startColIndex + dfsResult.flatColCount
+              },
+              dataSource: dataSource
+            });
+            flatColCount += dfsResult.flatColCount;
+          }
+
+          result.push.apply(result, (0, _toConsumableArray2.default)(normalizeAsArray(unNormalized)));
+        }
+      } catch (err) {
+        _iterator.e(err);
+      } finally {
+        _iterator.f();
+      }
+
+      return {
+        result: result,
+        flatColCount: flatColCount
+      };
+    }
+  };
+}

package/lib/table/utils/tree-data-helpers/StrictTreeDataHelper.d.ts

@@ -0,0 +1,22 @@
+import { AbstractTreeNode } from '../../interfaces';
+export interface StrictTreeDataHelperOptions<N extends AbstractTreeNode> {
+    tree: N[];
+    getNodeValue(node: N): string;
+    value: string[];
+}
+export default class StrictTreeDataHelper<N extends AbstractTreeNode> {
+    private readonly opts;
+    private readonly valueSet;
+    private wrapperMap;
+    private rootWrapper;
+    constructor(opts: StrictTreeDataHelperOptions<N>);
+    private initWrapperTree;
+    private get value();
+    isIndeterminate(nodeValue: string): boolean;
+    isChecked(nodeValue: string): boolean;
+    getValueAfterCheck(nodeValue: string): string[];
+    getValueAfterUncheck(nodeValue: string): string[];
+    getValueAfterToggle(nodeValue: string): string[];
+    getNode(nodeValue: string): N;
+    getCleanValue(): string[];
+}

package/lib/table/utils/tree-data-helpers/StrictTreeDataHelper.js

@@ -0,0 +1,154 @@
+"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.default = void 0;
+
+var _set = _interopRequireDefault(require("@babel/runtime-corejs3/core-js-stable/set"));
+
+var _map = _interopRequireDefault(require("@babel/runtime-corejs3/core-js-stable/map"));
+
+var _createClass2 = _interopRequireDefault(require("@babel/runtime-corejs3/helpers/createClass"));
+
+var _extends2 = _interopRequireDefault(require("@babel/runtime-corejs3/helpers/extends"));
+
+var _classCallCheck2 = _interopRequireDefault(require("@babel/runtime-corejs3/helpers/classCallCheck"));
+
+var _isLeafNode = _interopRequireDefault(require("../isLeafNode"));
+
+var _others = require("../others");
+
+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 _context; if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = _sliceInstanceProperty(_context = Object.prototype.toString.call(o)).call(_context, 8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return _Array$from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
+
+function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
+
+var Wrapper = function Wrapper(input) {
+  (0, _classCallCheck2.default)(this, Wrapper);
+  (0, _extends2.default)(this, input);
+};
+
+var StrictTreeDataHelper = /*#__PURE__*/function () {
+  function StrictTreeDataHelper(opts) {
+    (0, _classCallCheck2.default)(this, StrictTreeDataHelper);
+    this.opts = opts;
+    this.valueSet = new _set.default(opts.value);
+    this.initWrapperTree();
+  }
+
+  (0, _createClass2.default)(StrictTreeDataHelper, [{
+    key: "initWrapperTree",
+    value: function initWrapperTree() {
+      var _this = this;
+
+      var getNodeValue = this.opts.getNodeValue;
+      this.rootWrapper = new Wrapper({
+        root: true,
+        children: []
+      });
+      this.wrapperMap = new _map.default();
+
+      var dfs = function dfs(parentWrapper, nodes) {
+        var _iterator = _createForOfIteratorHelper(nodes),
+            _step;
+
+        try {
+          for (_iterator.s(); !(_step = _iterator.n()).done;) {
+            var node = _step.value;
+            var wrapper = new Wrapper({
+              parent: parentWrapper,
+              node: node,
+              checked: _this.valueSet.has(getNodeValue(node))
+            });
+
+            _this.wrapperMap.set(getNodeValue(node), wrapper);
+
+            parentWrapper.children.push(wrapper);
+
+            if (!(0, _isLeafNode.default)(node)) {
+              wrapper.children = [];
+              dfs(wrapper, node.children);
+            }
+          }
+        } catch (err) {
+          _iterator.e(err);
+        } finally {
+          _iterator.f();
+        }
+      };
+
+      dfs(this.rootWrapper, this.opts.tree);
+    }
+  }, {
+    key: "value",
+    get: function get() {
+      return this.opts.value;
+    }
+  }, {
+    key: "isIndeterminate",
+    value: function isIndeterminate(nodeValue) {
+      return false;
+    }
+  }, {
+    key: "isChecked",
+    value: function isChecked(nodeValue) {
+      return this.valueSet.has(nodeValue);
+    }
+  }, {
+    key: "getValueAfterCheck",
+    value: function getValueAfterCheck(nodeValue) {
+      if (!this.isChecked(nodeValue)) {
+        return _others.arrayUtils.merge(this.value, [nodeValue]);
+      }
+
+      return this.value;
+    }
+  }, {
+    key: "getValueAfterUncheck",
+    value: function getValueAfterUncheck(nodeValue) {
+      if (this.isChecked(nodeValue)) {
+        return _others.arrayUtils.diff(this.value, [nodeValue]);
+      }
+
+      return this.value;
+    }
+  }, {
+    key: "getValueAfterToggle",
+    value: function getValueAfterToggle(nodeValue) {
+      if (this.isChecked(nodeValue)) {
+        return this.getValueAfterUncheck(nodeValue);
+      } else {
+        return this.getValueAfterCheck(nodeValue);
+      }
+    }
+  }, {
+    key: "getNode",
+    value: function getNode(nodeValue) {
+      var _a;
+
+      return (_a = this.wrapperMap.get(nodeValue)) === null || _a === void 0 ? void 0 : _a.node;
+    }
+  }, {
+    key: "getCleanValue",
+    value: function getCleanValue() {
+      return this.value;
+    }
+  }]);
+  return StrictTreeDataHelper;
+}();
+
+exports.default = StrictTreeDataHelper;

package/lib/table/utils/tree-data-helpers/TreeDataHelper.d.ts

@@ -0,0 +1,26 @@
+import { AbstractTreeNode } from '../../interfaces';
+export declare type CheckedStrategy = 'all' | 'parent' | 'child';
+export interface TreeDataHelperOptions<N extends AbstractTreeNode> {
+    tree: N[];
+    getNodeValue(node: N): string;
+    value: string[];
+    checkedStrategy: CheckedStrategy;
+    isDetached?(node: N): boolean;
+}
+export default class TreeDataHelper<N extends AbstractTreeNode> {
+    private readonly opts;
+    private readonly valueSet;
+    private wrapperMap;
+    private rootWrapper;
+    constructor(opts: TreeDataHelperOptions<N>);
+    private get value();
+    private isDetached;
+    private initWrapperTree;
+    isIndeterminate(nodeValue: string): boolean;
+    isChecked(nodeValue: string): boolean;
+    getValueAfterCheck(nodeValue: string): string[];
+    getValueAfterUncheck(nodeValue: string): string[];
+    getValueAfterToggle(nodeValue: string): string[];
+    getNode(nodeValue: string): N;
+    getCleanValue(): string[];
+}