bkui-vue 0.0.2-beta.93 → 0.0.2-beta.94

package/lib/tree/index.js

@@ -6,8 +6,274 @@ import * as __WEBPACK_EXTERNAL_MODULE_vue_types_22de060a__ from "vue-types";
 import * as __WEBPACK_EXTERNAL_MODULE__exception_12c197e0__ from "../exception";
 import * as __WEBPACK_EXTERNAL_MODULE__checkbox_a57bcb84__ from "../checkbox";
 import * as __WEBPACK_EXTERNAL_MODULE__icon_85385c3e__ from "../icon";
-/******/ // The require scope
-/******/ var __webpack_require__ = {};
+/******/ var __webpack_modules__ = ({
+
+/***/ 8022:
+/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
+
+var v1 = __webpack_require__(4481);
+var v4 = __webpack_require__(6426);
+
+var uuid = v4;
+uuid.v1 = v1;
+uuid.v4 = v4;
+
+module.exports = uuid;
+
+
+/***/ }),
+
+/***/ 8725:
+/***/ ((module) => {
+
+/**
+ * Convert array of 16 byte values to UUID string format of the form:
+ * XXXXXXXX-XXXX-XXXX-XXXX-XXXXXXXXXXXX
+ */
+var byteToHex = [];
+for (var i = 0; i < 256; ++i) {
+  byteToHex[i] = (i + 0x100).toString(16).substr(1);
+}
+
+function bytesToUuid(buf, offset) {
+  var i = offset || 0;
+  var bth = byteToHex;
+  // join used to fix memory issue caused by concatenation: https://bugs.chromium.org/p/v8/issues/detail?id=3175#c4
+  return ([
+    bth[buf[i++]], bth[buf[i++]],
+    bth[buf[i++]], bth[buf[i++]], '-',
+    bth[buf[i++]], bth[buf[i++]], '-',
+    bth[buf[i++]], bth[buf[i++]], '-',
+    bth[buf[i++]], bth[buf[i++]], '-',
+    bth[buf[i++]], bth[buf[i++]],
+    bth[buf[i++]], bth[buf[i++]],
+    bth[buf[i++]], bth[buf[i++]]
+  ]).join('');
+}
+
+module.exports = bytesToUuid;
+
+
+/***/ }),
+
+/***/ 9157:
+/***/ ((module) => {
+
+// Unique ID creation requires a high quality random # generator.  In the
+// browser this is a little complicated due to unknown quality of Math.random()
+// and inconsistent support for the `crypto` API.  We do the best we can via
+// feature-detection
+
+// getRandomValues needs to be invoked in a context where "this" is a Crypto
+// implementation. Also, find the complete implementation of crypto on IE11.
+var getRandomValues = (typeof(crypto) != 'undefined' && crypto.getRandomValues && crypto.getRandomValues.bind(crypto)) ||
+                      (typeof(msCrypto) != 'undefined' && typeof window.msCrypto.getRandomValues == 'function' && msCrypto.getRandomValues.bind(msCrypto));
+
+if (getRandomValues) {
+  // WHATWG crypto RNG - http://wiki.whatwg.org/wiki/Crypto
+  var rnds8 = new Uint8Array(16); // eslint-disable-line no-undef
+
+  module.exports = function whatwgRNG() {
+    getRandomValues(rnds8);
+    return rnds8;
+  };
+} else {
+  // Math.random()-based (RNG)
+  //
+  // If all else fails, use Math.random().  It's fast, but is of unspecified
+  // quality.
+  var rnds = new Array(16);
+
+  module.exports = function mathRNG() {
+    for (var i = 0, r; i < 16; i++) {
+      if ((i & 0x03) === 0) r = Math.random() * 0x100000000;
+      rnds[i] = r >>> ((i & 0x03) << 3) & 0xff;
+    }
+
+    return rnds;
+  };
+}
+
+
+/***/ }),
+
+/***/ 4481:
+/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
+
+var rng = __webpack_require__(9157);
+var bytesToUuid = __webpack_require__(8725);
+
+// **`v1()` - Generate time-based UUID**
+//
+// Inspired by https://github.com/LiosK/UUID.js
+// and http://docs.python.org/library/uuid.html
+
+var _nodeId;
+var _clockseq;
+
+// Previous uuid creation time
+var _lastMSecs = 0;
+var _lastNSecs = 0;
+
+// See https://github.com/uuidjs/uuid for API details
+function v1(options, buf, offset) {
+  var i = buf && offset || 0;
+  var b = buf || [];
+
+  options = options || {};
+  var node = options.node || _nodeId;
+  var clockseq = options.clockseq !== undefined ? options.clockseq : _clockseq;
+
+  // node and clockseq need to be initialized to random values if they're not
+  // specified.  We do this lazily to minimize issues related to insufficient
+  // system entropy.  See #189
+  if (node == null || clockseq == null) {
+    var seedBytes = rng();
+    if (node == null) {
+      // Per 4.5, create and 48-bit node id, (47 random bits + multicast bit = 1)
+      node = _nodeId = [
+        seedBytes[0] | 0x01,
+        seedBytes[1], seedBytes[2], seedBytes[3], seedBytes[4], seedBytes[5]
+      ];
+    }
+    if (clockseq == null) {
+      // Per 4.2.2, randomize (14 bit) clockseq
+      clockseq = _clockseq = (seedBytes[6] << 8 | seedBytes[7]) & 0x3fff;
+    }
+  }
+
+  // UUID timestamps are 100 nano-second units since the Gregorian epoch,
+  // (1582-10-15 00:00).  JSNumbers aren't precise enough for this, so
+  // time is handled internally as 'msecs' (integer milliseconds) and 'nsecs'
+  // (100-nanoseconds offset from msecs) since unix epoch, 1970-01-01 00:00.
+  var msecs = options.msecs !== undefined ? options.msecs : new Date().getTime();
+
+  // Per 4.2.1.2, use count of uuid's generated during the current clock
+  // cycle to simulate higher resolution clock
+  var nsecs = options.nsecs !== undefined ? options.nsecs : _lastNSecs + 1;
+
+  // Time since last uuid creation (in msecs)
+  var dt = (msecs - _lastMSecs) + (nsecs - _lastNSecs)/10000;
+
+  // Per 4.2.1.2, Bump clockseq on clock regression
+  if (dt < 0 && options.clockseq === undefined) {
+    clockseq = clockseq + 1 & 0x3fff;
+  }
+
+  // Reset nsecs if clock regresses (new clockseq) or we've moved onto a new
+  // time interval
+  if ((dt < 0 || msecs > _lastMSecs) && options.nsecs === undefined) {
+    nsecs = 0;
+  }
+
+  // Per 4.2.1.2 Throw error if too many uuids are requested
+  if (nsecs >= 10000) {
+    throw new Error('uuid.v1(): Can\'t create more than 10M uuids/sec');
+  }
+
+  _lastMSecs = msecs;
+  _lastNSecs = nsecs;
+  _clockseq = clockseq;
+
+  // Per 4.1.4 - Convert from unix epoch to Gregorian epoch
+  msecs += 12219292800000;
+
+  // `time_low`
+  var tl = ((msecs & 0xfffffff) * 10000 + nsecs) % 0x100000000;
+  b[i++] = tl >>> 24 & 0xff;
+  b[i++] = tl >>> 16 & 0xff;
+  b[i++] = tl >>> 8 & 0xff;
+  b[i++] = tl & 0xff;
+
+  // `time_mid`
+  var tmh = (msecs / 0x100000000 * 10000) & 0xfffffff;
+  b[i++] = tmh >>> 8 & 0xff;
+  b[i++] = tmh & 0xff;
+
+  // `time_high_and_version`
+  b[i++] = tmh >>> 24 & 0xf | 0x10; // include version
+  b[i++] = tmh >>> 16 & 0xff;
+
+  // `clock_seq_hi_and_reserved` (Per 4.2.2 - include variant)
+  b[i++] = clockseq >>> 8 | 0x80;
+
+  // `clock_seq_low`
+  b[i++] = clockseq & 0xff;
+
+  // `node`
+  for (var n = 0; n < 6; ++n) {
+    b[i + n] = node[n];
+  }
+
+  return buf ? buf : bytesToUuid(b);
+}
+
+module.exports = v1;
+
+
+/***/ }),
+
+/***/ 6426:
+/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
+
+var rng = __webpack_require__(9157);
+var bytesToUuid = __webpack_require__(8725);
+
+function v4(options, buf, offset) {
+  var i = buf && offset || 0;
+
+  if (typeof(options) == 'string') {
+    buf = options === 'binary' ? new Array(16) : null;
+    options = null;
+  }
+  options = options || {};
+
+  var rnds = options.random || (options.rng || rng)();
+
+  // Per 4.4, set bits for version and `clock_seq_hi_and_reserved`
+  rnds[6] = (rnds[6] & 0x0f) | 0x40;
+  rnds[8] = (rnds[8] & 0x3f) | 0x80;
+
+  // Copy bytes to buffer, if provided
+  if (buf) {
+    for (var ii = 0; ii < 16; ++ii) {
+      buf[i + ii] = rnds[ii];
+    }
+  }
+
+  return buf || bytesToUuid(rnds);
+}
+
+module.exports = v4;
+
+
+/***/ })
+
+/******/ });
+/************************************************************************/
+/******/ // The module cache
+/******/ var __webpack_module_cache__ = {};
+/******/ 
+/******/ // The require function
+/******/ function __webpack_require__(moduleId) {
+/******/ 	// Check if module is in cache
+/******/ 	var cachedModule = __webpack_module_cache__[moduleId];
+/******/ 	if (cachedModule !== undefined) {
+/******/ 		return cachedModule.exports;
+/******/ 	}
+/******/ 	// Create a new module (and put it into the cache)
+/******/ 	var module = __webpack_module_cache__[moduleId] = {
+/******/ 		// no module.id needed
+/******/ 		// no module.loaded needed
+/******/ 		exports: {}
+/******/ 	};
+/******/ 
+/******/ 	// Execute the module function
+/******/ 	__webpack_modules__[moduleId](module, module.exports, __webpack_require__);
+/******/ 
+/******/ 	// Return the exports of the module
+/******/ 	return module.exports;
+/******/ }
 /******/ 
 /************************************************************************/
 /******/ /* webpack/runtime/define property getters */
@@ -29,6 +295,8 @@ import * as __WEBPACK_EXTERNAL_MODULE__icon_85385c3e__ from "../icon";
 /******/ 
 /************************************************************************/
 var __webpack_exports__ = {};
+// This entry need to be wrapped in an IIFE because it need to be isolated against other modules in the chunk.
+(() => {
 
 // EXPORTS
 __webpack_require__.d(__webpack_exports__, {
@@ -317,7 +585,7 @@ var treeProps = {
   /**
    * 是否支持多选
    */
-  showCheckbox: external_shared_namespaceObject.PropTypes.bool.def(false),
+  showCheckbox: external_shared_namespaceObject.PropTypes.oneOfType([external_shared_namespaceObject.PropTypes.bool, external_shared_namespaceObject.PropTypes.func]).def(false),
   checked: external_shared_namespaceObject.PropTypes.arrayOf(external_shared_namespaceObject.PropTypes.any).def([]),
   /**
    * 是否显示节点类型Icon
@@ -905,6 +1173,12 @@ var resolvePropIsMatched = function resolvePropIsMatched(node, prop, id) {
   }
   return node === prop;
 };
+var showCheckbox = function showCheckbox(props, node) {
+  if (typeof props.showCheckbox === 'function') {
+    return props.showCheckbox(node);
+  }
+  return props.showCheckbox;
+};
 ;// CONCATENATED MODULE: ../../packages/tree/src/use-node-async.tsx
 
 /*
@@ -1220,7 +1494,7 @@ var use_node_action_this = undefined;
     return isNodeChecked(item) && getNodeAttr(item, NODE_ATTRIBUTES.IS_INDETERMINATE);
   };
   var getCheckboxRender = function getCheckboxRender(item) {
-    if (!props.showCheckbox) {
+    if (!showCheckbox(props, extendNodeScopedData(item))) {
       return null;
     }
     return (0,external_vue_namespaceObject.createVNode)("span", {
@@ -1847,94 +2121,8 @@ var use_search_this = undefined;
     showChildNodes: showChildNodes
   };
 });
-;// CONCATENATED MODULE: ../../node_modules/uuid/dist/esm-browser/native.js
-const randomUUID = typeof crypto !== 'undefined' && crypto.randomUUID && crypto.randomUUID.bind(crypto);
-/* harmony default export */ const esm_browser_native = ({
-  randomUUID
-});
-;// CONCATENATED MODULE: ../../node_modules/uuid/dist/esm-browser/rng.js
-// Unique ID creation requires a high quality random # generator. In the browser we therefore
-// require the crypto API and do not support built-in fallback to lower quality random number
-// generators (like Math.random()).
-let getRandomValues;
-const rnds8 = new Uint8Array(16);
-function rng() {
-  // lazy load so that environments that need to polyfill have a chance to do so
-  if (!getRandomValues) {
-    // getRandomValues needs to be invoked in a context where "this" is a Crypto implementation.
-    getRandomValues = typeof crypto !== 'undefined' && crypto.getRandomValues && crypto.getRandomValues.bind(crypto);
-
-    if (!getRandomValues) {
-      throw new Error('crypto.getRandomValues() not supported. See https://github.com/uuidjs/uuid#getrandomvalues-not-supported');
-    }
-  }
-
-  return getRandomValues(rnds8);
-}
-;// CONCATENATED MODULE: ../../node_modules/uuid/dist/esm-browser/stringify.js
-
-/**
- * Convert array of 16 byte values to UUID string format of the form:
- * XXXXXXXX-XXXX-XXXX-XXXX-XXXXXXXXXXXX
- */
-
-const byteToHex = [];
-
-for (let i = 0; i < 256; ++i) {
-  byteToHex.push((i + 0x100).toString(16).slice(1));
-}
-
-function unsafeStringify(arr, offset = 0) {
-  // Note: Be careful editing this code!  It's been tuned for performance
-  // and works in ways you may not expect. See https://github.com/uuidjs/uuid/pull/434
-  return byteToHex[arr[offset + 0]] + byteToHex[arr[offset + 1]] + byteToHex[arr[offset + 2]] + byteToHex[arr[offset + 3]] + '-' + byteToHex[arr[offset + 4]] + byteToHex[arr[offset + 5]] + '-' + byteToHex[arr[offset + 6]] + byteToHex[arr[offset + 7]] + '-' + byteToHex[arr[offset + 8]] + byteToHex[arr[offset + 9]] + '-' + byteToHex[arr[offset + 10]] + byteToHex[arr[offset + 11]] + byteToHex[arr[offset + 12]] + byteToHex[arr[offset + 13]] + byteToHex[arr[offset + 14]] + byteToHex[arr[offset + 15]];
-}
-
-function stringify(arr, offset = 0) {
-  const uuid = unsafeStringify(arr, offset); // Consistency check for valid UUID.  If this throws, it's likely due to one
-  // of the following:
-  // - One or more input array values don't map to a hex octet (leading to
-  // "undefined" in the uuid)
-  // - Invalid input values for the RFC `version` or `variant` fields
-
-  if (!validate(uuid)) {
-    throw TypeError('Stringified UUID is invalid');
-  }
-
-  return uuid;
-}
-
-/* harmony default export */ const esm_browser_stringify = ((/* unused pure expression or super */ null && (stringify)));
-;// CONCATENATED MODULE: ../../node_modules/uuid/dist/esm-browser/v4.js
-
-
-
-
-function v4(options, buf, offset) {
-  if (esm_browser_native.randomUUID && !buf && !options) {
-    return esm_browser_native.randomUUID();
-  }
-
-  options = options || {};
-  const rnds = options.random || (options.rng || rng)(); // Per 4.4, set bits for version and `clock_seq_hi_and_reserved`
-
-  rnds[6] = rnds[6] & 0x0f | 0x40;
-  rnds[8] = rnds[8] & 0x3f | 0x80; // Copy bytes to buffer, if provided
-
-  if (buf) {
-    offset = offset || 0;
-
-    for (let i = 0; i < 16; ++i) {
-      buf[offset + i] = rnds[i];
-    }
-
-    return buf;
-  }
-
-  return unsafeStringify(rnds);
-}
-
-/* harmony default export */ const esm_browser_v4 = (v4);
+// EXTERNAL MODULE: ../../node_modules/uuid/index.js
+var uuid = __webpack_require__(8022);
 ;// CONCATENATED MODULE: ../../packages/tree/src/use-tree-init.tsx
 
 
@@ -2012,9 +2200,9 @@ var use_tree_init_this = undefined;
     function getUid(item) {
       var uid = null;
       if (typeof props.nodeKey === 'string') {
-        uid = item[props.nodeKey] || esm_browser_v4();
+        uid = item[props.nodeKey] || (0,uuid.v4)();
       }
-      return uid || item[NODE_ATTRIBUTES.UUID] || esm_browser_v4();
+      return uid || item[NODE_ATTRIBUTES.UUID] || (0,uuid.v4)();
     }
     /**
      * 默认设置
@@ -2089,8 +2277,12 @@ var use_tree_init_this = undefined;
       var isParentOpened = treeSchema.has(parent) ? (_treeSchema$get = treeSchema.get(parent)) === null || _treeSchema$get === void 0 ? void 0 : _treeSchema$get[NODE_ATTRIBUTES.IS_OPEN] : true;
       return isItemOpened && isParentOpened;
     }
-    function isCheckedNode(node, uuid) {
-      if (!props.showCheckbox) {
+    function isCheckedNode(node, uuid, attributes) {
+      var isChecked = showCheckbox(props, {
+        data: node,
+        attributes: attributes
+      });
+      if (!isChecked) {
         return false;
       }
       var isMatch = resolvePropIsMatched(node, props.checked, uuid);
@@ -2118,7 +2310,7 @@ var use_tree_init_this = undefined;
           flatten(item, depth, parent, path);
         } else {
           if (_typeof(item) === 'object' && item !== null) {
-            var _treeSchema$set;
+            var _attributes;
             var currentPath = path !== null ? "".concat(path, "-").concat(i) : "".concat(i);
             var uuid = "".concat(getUid(item));
             var hasChildren = !!(item[children] || []).length;
@@ -2140,13 +2332,14 @@ var use_tree_init_this = undefined;
                */
               isOpened = isNodeOpend(uuid, item, parent);
             }
-            var isChecked = isCheckedNode(item, uuid);
-            if (isChecked) {
+            var attributes = (_attributes = {}, _defineProperty(_attributes, NODE_ATTRIBUTES.DEPTH, depth), _defineProperty(_attributes, NODE_ATTRIBUTES.INDEX, i), _defineProperty(_attributes, NODE_ATTRIBUTES.UUID, uuid), _defineProperty(_attributes, NODE_ATTRIBUTES.PARENT, parent), _defineProperty(_attributes, NODE_ATTRIBUTES.HAS_CHILD, hasChildren), _defineProperty(_attributes, NODE_ATTRIBUTES.PATH, currentPath), _defineProperty(_attributes, NODE_ATTRIBUTES.IS_ROOT, parent === null), _defineProperty(_attributes, NODE_ATTRIBUTES.ORDER, order), _defineProperty(_attributes, NODE_ATTRIBUTES.IS_SELECTED, isCachedTreeNodeSelected(uuid, item)), _defineProperty(_attributes, NODE_ATTRIBUTES.IS_MATCH, getCachedTreeNodeAttr(uuid, item, NODE_ATTRIBUTES.IS_MATCH)), _defineProperty(_attributes, NODE_ATTRIBUTES.IS_OPEN, isOpened), _defineProperty(_attributes, NODE_ATTRIBUTES.IS_CHECKED, undefined), _defineProperty(_attributes, NODE_ATTRIBUTES.IS_CACHED, getCachedTreeNodeAttr(uuid, item, NODE_ATTRIBUTES.IS_CACHED)), _defineProperty(_attributes, NODE_ATTRIBUTES.IS_ASYNC, getCachedTreeNodeAttr(uuid, item, NODE_ATTRIBUTES.IS_ASYNC)), _defineProperty(_attributes, NODE_ATTRIBUTES.IS_LOADING, getCachedTreeNodeAttr(uuid, item, NODE_ATTRIBUTES.IS_LOADING)), _defineProperty(_attributes, NODE_ATTRIBUTES.IS_INDETERMINATE, false), _attributes);
+            attributes[NODE_ATTRIBUTES.IS_CHECKED] = isCheckedNode(item, uuid, attributes);
+            if (attributes[NODE_ATTRIBUTES.IS_CHECKED]) {
               checkedList.push(item);
             }
-            treeSchema.set(item, (_treeSchema$set = {}, _defineProperty(_treeSchema$set, NODE_ATTRIBUTES.DEPTH, depth), _defineProperty(_treeSchema$set, NODE_ATTRIBUTES.INDEX, i), _defineProperty(_treeSchema$set, NODE_ATTRIBUTES.UUID, uuid), _defineProperty(_treeSchema$set, NODE_ATTRIBUTES.PARENT, parent), _defineProperty(_treeSchema$set, NODE_ATTRIBUTES.HAS_CHILD, hasChildren), _defineProperty(_treeSchema$set, NODE_ATTRIBUTES.PATH, currentPath), _defineProperty(_treeSchema$set, NODE_ATTRIBUTES.IS_ROOT, parent === null), _defineProperty(_treeSchema$set, NODE_ATTRIBUTES.ORDER, order), _defineProperty(_treeSchema$set, NODE_ATTRIBUTES.IS_SELECTED, isCachedTreeNodeSelected(uuid, item)), _defineProperty(_treeSchema$set, NODE_ATTRIBUTES.IS_MATCH, getCachedTreeNodeAttr(uuid, item, NODE_ATTRIBUTES.IS_MATCH)), _defineProperty(_treeSchema$set, NODE_ATTRIBUTES.IS_OPEN, isOpened), _defineProperty(_treeSchema$set, NODE_ATTRIBUTES.IS_CHECKED, isChecked), _defineProperty(_treeSchema$set, NODE_ATTRIBUTES.IS_CACHED, getCachedTreeNodeAttr(uuid, item, NODE_ATTRIBUTES.IS_CACHED)), _defineProperty(_treeSchema$set, NODE_ATTRIBUTES.IS_ASYNC, getCachedTreeNodeAttr(uuid, item, NODE_ATTRIBUTES.IS_ASYNC)), _defineProperty(_treeSchema$set, NODE_ATTRIBUTES.IS_LOADING, getCachedTreeNodeAttr(uuid, item, NODE_ATTRIBUTES.IS_LOADING)), _defineProperty(_treeSchema$set, NODE_ATTRIBUTES.IS_INDETERMINATE, false), _treeSchema$set));
-            order += 1;
+            treeSchema.set(item, attributes);
             outputData.push(item);
+            order += 1;
             if (Object.prototype.hasOwnProperty.call(item, children)) {
               flatten(item[children] || [], depth + 1, item, currentPath);
             }
@@ -2155,7 +2348,7 @@ var use_tree_init_this = undefined;
       }
     }
     flatten(treeData !== null && treeData !== void 0 ? treeData : data);
-    if (props.showCheckbox) {
+    if (props.showCheckbox !== false) {
       checkedList === null || checkedList === void 0 ? void 0 : checkedList.forEach(function (value) {
         loopUpdateNodeAttr(value, NODE_ATTRIBUTES.IS_CHECKED, true, loopUpdateCheckedEvent);
       });
@@ -2514,5 +2707,7 @@ var use_tree_init_this = undefined;
 
 var BkTree = (0,external_shared_namespaceObject.withInstall)(tree);
 /* harmony default export */ const src = (BkTree);
+})();
+
 var __webpack_exports__default = __webpack_exports__.Z;
 export { __webpack_exports__default as default };

package/lib/tree/props.d.ts

@@ -150,10 +150,8 @@ export declare const treeProps: {
     /**
      * 是否支持多选
      */
-    showCheckbox: import("vue-types").VueTypeValidableDef<boolean> & {
-        default: boolean;
-    } & {
-        default: boolean;
+    showCheckbox: import("vue-types").VueTypeDef<any> & {
+        default: any;
     };
     checked: import("vue-types").VueTypeDef<any[]> & {
         default: () => any[];

package/lib/tree/tree.d.ts

@@ -81,10 +81,8 @@ declare const _default: import("vue").DefineComponent<{
     } & {
         default: boolean;
     };
-    showCheckbox: import("vue-types").VueTypeValidableDef<boolean> & {
-        default: boolean;
-    } & {
-        default: boolean;
+    showCheckbox: import("vue-types").VueTypeDef<any> & {
+        default: any;
     };
     checked: import("vue-types").VueTypeDef<any[]> & {
         default: () => any[];
@@ -212,10 +210,8 @@ declare const _default: import("vue").DefineComponent<{
     } & {
         default: boolean;
     };
-    showCheckbox: import("vue-types").VueTypeValidableDef<boolean> & {
-        default: boolean;
-    } & {
-        default: boolean;
+    showCheckbox: import("vue-types").VueTypeDef<any> & {
+        default: any;
     };
     checked: import("vue-types").VueTypeDef<any[]> & {
         default: () => any[];
@@ -285,7 +281,7 @@ declare const _default: import("vue").DefineComponent<{
     dragSort: boolean;
     selectable: any;
     disabledFolderSelectable: boolean;
-    showCheckbox: boolean;
+    showCheckbox: any;
     showNodeTypeIcon: boolean;
     autoCheckChildren: any;
     autoOpenParentNode: boolean;

package/lib/tree/util.d.ts

@@ -71,3 +71,4 @@ export declare const updateTreeNode: (path: string, treeData: any[], childKey: s
 export declare const assignTreeNode: (path: string, treeData: any[], childKey: string, assignVal: any) => void;
 export declare const resolveNodeItem: (node: any) => any;
 export declare const resolvePropIsMatched: (node: any, prop: any, id: any) => any;
+export declare const showCheckbox: (props: TreePropTypes, node?: any) => any;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "bkui-vue",
-  "version": "0.0.2-beta.93",
+  "version": "0.0.2-beta.94",
   "workspaces": {
     "packages": [
       "packages/!(**.bak)*",