tdesign-react 0.40.2 → 0.40.3

package/esm/_chunks/dep-361f6701.js

@@ -0,0 +1,117 @@
+/**
+ * tdesign v0.40.3
+ * (c) 2022 tdesign
+ * @license MIT
+ */
+
+import './dep-e4f326ea.js';
+import { _ as _MapCache } from './dep-7ab5c787.js';
+
+/** Used to stand-in for `undefined` hash values. */
+var HASH_UNDEFINED = '__lodash_hash_undefined__';
+/**
+ * Adds `value` to the array cache.
+ *
+ * @private
+ * @name add
+ * @memberOf SetCache
+ * @alias push
+ * @param {*} value The value to cache.
+ * @returns {Object} Returns the cache instance.
+ */
+
+function setCacheAdd$1(value) {
+  this.__data__.set(value, HASH_UNDEFINED);
+
+  return this;
+}
+
+var _setCacheAdd = setCacheAdd$1;
+
+/**
+ * Checks if `value` is in the array cache.
+ *
+ * @private
+ * @name has
+ * @memberOf SetCache
+ * @param {*} value The value to search for.
+ * @returns {number} Returns `true` if `value` is found, else `false`.
+ */
+
+function setCacheHas$1(value) {
+  return this.__data__.has(value);
+}
+
+var _setCacheHas = setCacheHas$1;
+
+var MapCache = _MapCache,
+    setCacheAdd = _setCacheAdd,
+    setCacheHas = _setCacheHas;
+/**
+ *
+ * Creates an array cache object to store unique values.
+ *
+ * @private
+ * @constructor
+ * @param {Array} [values] The values to cache.
+ */
+
+function SetCache(values) {
+  var index = -1,
+      length = values == null ? 0 : values.length;
+  this.__data__ = new MapCache();
+
+  while (++index < length) {
+    this.add(values[index]);
+  }
+} // Add methods to `SetCache`.
+
+
+SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;
+SetCache.prototype.has = setCacheHas;
+var _SetCache = SetCache;
+
+/**
+ * The base implementation of `_.findIndex` and `_.findLastIndex` without
+ * support for iteratee shorthands.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {Function} predicate The function invoked per iteration.
+ * @param {number} fromIndex The index to search from.
+ * @param {boolean} [fromRight] Specify iterating from right to left.
+ * @returns {number} Returns the index of the matched value, else `-1`.
+ */
+
+function baseFindIndex(array, predicate, fromIndex, fromRight) {
+  var length = array.length,
+      index = fromIndex + (fromRight ? 1 : -1);
+
+  while (fromRight ? index-- : ++index < length) {
+    if (predicate(array[index], index, array)) {
+      return index;
+    }
+  }
+
+  return -1;
+}
+
+var _baseFindIndex = baseFindIndex;
+
+/**
+ * Checks if a `cache` value for `key` exists.
+ *
+ * @private
+ * @param {Object} cache The cache to query.
+ * @param {string} key The key of the entry to check.
+ * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+ */
+
+function cacheHas(cache, key) {
+  return cache.has(key);
+}
+
+var _cacheHas = cacheHas;
+
+export { _baseFindIndex as _, _SetCache as a, _cacheHas as b };
+//# sourceMappingURL=dep-361f6701.js.map

package/esm/_chunks/dep-361f6701.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-361f6701.js","sources":["../../node_modules/lodash/_setCacheAdd.js","../../node_modules/lodash/_setCacheHas.js","../../node_modules/lodash/_SetCache.js","../../node_modules/lodash/_baseFindIndex.js","../../node_modules/lodash/_cacheHas.js"],"sourcesContent":["/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/**\n * Adds `value` to the array cache.\n *\n * @private\n * @name add\n * @memberOf SetCache\n * @alias push\n * @param {*} value The value to cache.\n * @returns {Object} Returns the cache instance.\n */\nfunction setCacheAdd(value) {\n  this.__data__.set(value, HASH_UNDEFINED);\n  return this;\n}\n\nmodule.exports = setCacheAdd;\n","/**\n * Checks if `value` is in the array cache.\n *\n * @private\n * @name has\n * @memberOf SetCache\n * @param {*} value The value to search for.\n * @returns {number} Returns `true` if `value` is found, else `false`.\n */\nfunction setCacheHas(value) {\n  return this.__data__.has(value);\n}\n\nmodule.exports = setCacheHas;\n","var MapCache = require('./_MapCache'),\n    setCacheAdd = require('./_setCacheAdd'),\n    setCacheHas = require('./_setCacheHas');\n\n/**\n *\n * Creates an array cache object to store unique values.\n *\n * @private\n * @constructor\n * @param {Array} [values] The values to cache.\n */\nfunction SetCache(values) {\n  var index = -1,\n      length = values == null ? 0 : values.length;\n\n  this.__data__ = new MapCache;\n  while (++index < length) {\n    this.add(values[index]);\n  }\n}\n\n// Add methods to `SetCache`.\nSetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\nSetCache.prototype.has = setCacheHas;\n\nmodule.exports = SetCache;\n","/**\n * The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseFindIndex(array, predicate, fromIndex, fromRight) {\n  var length = array.length,\n      index = fromIndex + (fromRight ? 1 : -1);\n\n  while ((fromRight ? index-- : ++index < length)) {\n    if (predicate(array[index], index, array)) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = baseFindIndex;\n","/**\n * Checks if a `cache` value for `key` exists.\n *\n * @private\n * @param {Object} cache The cache to query.\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction cacheHas(cache, key) {\n  return cache.has(key);\n}\n\nmodule.exports = cacheHas;\n"],"names":["HASH_UNDEFINED","setCacheAdd","value","__data__","set","_setCacheAdd","setCacheHas","has","_setCacheHas","MapCache","require$$0","require$$1","require$$2","SetCache","values","index","length","add","prototype","push","_SetCache","baseFindIndex","array","predicate","fromIndex","fromRight","_baseFindIndex","cacheHas","cache","key","_cacheHas"],"mappings":";;;;;;;;;;AACA,IAAIA,cAAc,GAAG,2BAArB,CAAA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,aAAT,CAAqBC,KAArB,EAA4B;AAC1B,EAAA,IAAA,CAAKC,QAAL,CAAcC,GAAd,CAAkBF,KAAlB,EAAyBF,cAAzB,CAAA,CAAA;;AACA,EAAA,OAAO,IAAP,CAAA;AACD,CAAA;;AAED,IAAAK,YAAc,GAAGJ,aAAjB;;;;;;;;;;;;ACTA,SAASK,aAAT,CAAqBJ,KAArB,EAA4B;AAC1B,EAAA,OAAO,KAAKC,QAAL,CAAcI,GAAd,CAAkBL,KAAlB,CAAP,CAAA;AACD,CAAA;;AAED,IAAAM,YAAc,GAAGF,aAAjB;;ACbA,IAAIG,QAAQ,GAAGC,SAAf;AAAA,IACIT,WAAW,GAAGU,YADlB;AAAA,IAEIL,WAAW,GAAGM,YAFlB,CAAA;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,QAAT,CAAkBC,MAAlB,EAA0B;EACxB,IAAIC,KAAK,GAAG,CAAC,CAAb;MACIC,MAAM,GAAGF,MAAM,IAAI,IAAV,GAAiB,CAAjB,GAAqBA,MAAM,CAACE,MADzC,CAAA;AAGA,EAAA,IAAA,CAAKb,QAAL,GAAgB,IAAIM,QAAJ,EAAhB,CAAA;;AACA,EAAA,OAAO,EAAEM,KAAF,GAAUC,MAAjB,EAAyB;AACvB,IAAA,IAAA,CAAKC,GAAL,CAASH,MAAM,CAACC,KAAD,CAAf,CAAA,CAAA;AACD,GAAA;AACF;;;AAGDF,QAAQ,CAACK,SAAT,CAAmBD,GAAnB,GAAyBJ,QAAQ,CAACK,SAAT,CAAmBC,IAAnB,GAA0BlB,WAAnD,CAAA;AACAY,QAAQ,CAACK,SAAT,CAAmBX,GAAnB,GAAyBD,WAAzB,CAAA;AAEAc,IAAAA,SAAc,GAAGP;;;;;;;;;;;;;;ACfjB,SAASQ,aAAT,CAAuBC,KAAvB,EAA8BC,SAA9B,EAAyCC,SAAzC,EAAoDC,SAApD,EAA+D;AAC7D,EAAA,IAAIT,MAAM,GAAGM,KAAK,CAACN,MAAnB;MACID,KAAK,GAAGS,SAAS,IAAIC,SAAS,GAAG,CAAH,GAAO,CAAC,CAArB,CADrB,CAAA;;EAGA,OAAQA,SAAS,GAAGV,KAAK,EAAR,GAAa,EAAEA,KAAF,GAAUC,MAAxC,EAAiD;IAC/C,IAAIO,SAAS,CAACD,KAAK,CAACP,KAAD,CAAN,EAAeA,KAAf,EAAsBO,KAAtB,CAAb,EAA2C;AACzC,MAAA,OAAOP,KAAP,CAAA;AACD,KAAA;AACF,GAAA;;AACD,EAAA,OAAO,CAAC,CAAR,CAAA;AACD,CAAA;;AAEDW,IAAAA,cAAc,GAAGL;;;;;;;;;;;ACfjB,SAASM,QAAT,CAAkBC,KAAlB,EAAyBC,GAAzB,EAA8B;AAC5B,EAAA,OAAOD,KAAK,CAACrB,GAAN,CAAUsB,GAAV,CAAP,CAAA;AACD,CAAA;;AAEDC,IAAAA,SAAc,GAAGH;;;;"}

package/esm/_chunks/dep-397b0501.js

@@ -0,0 +1,119 @@
+/**
+ * tdesign v0.40.3
+ * (c) 2022 tdesign
+ * @license MIT
+ */
+
+import './dep-e4f326ea.js';
+import { i as isObject_1 } from './dep-03c2e515.js';
+import './dep-2a44b7ad.js';
+import { i as isSymbol_1 } from './dep-f4e3323d.js';
+
+/** Used to match a single whitespace character. */
+var reWhitespace = /\s/;
+/**
+ * Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace
+ * character of `string`.
+ *
+ * @private
+ * @param {string} string The string to inspect.
+ * @returns {number} Returns the index of the last non-whitespace character.
+ */
+
+function trimmedEndIndex$1(string) {
+  var index = string.length;
+
+  while (index-- && reWhitespace.test(string.charAt(index))) {}
+
+  return index;
+}
+
+var _trimmedEndIndex = trimmedEndIndex$1;
+
+var trimmedEndIndex = _trimmedEndIndex;
+/** Used to match leading whitespace. */
+
+var reTrimStart = /^\s+/;
+/**
+ * The base implementation of `_.trim`.
+ *
+ * @private
+ * @param {string} string The string to trim.
+ * @returns {string} Returns the trimmed string.
+ */
+
+function baseTrim$1(string) {
+  return string ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '') : string;
+}
+
+var _baseTrim = baseTrim$1;
+
+var baseTrim = _baseTrim,
+    isObject = isObject_1,
+    isSymbol = isSymbol_1;
+/** Used as references for various `Number` constants. */
+
+var NAN = 0 / 0;
+/** Used to detect bad signed hexadecimal string values. */
+
+var reIsBadHex = /^[-+]0x[0-9a-f]+$/i;
+/** Used to detect binary string values. */
+
+var reIsBinary = /^0b[01]+$/i;
+/** Used to detect octal string values. */
+
+var reIsOctal = /^0o[0-7]+$/i;
+/** Built-in method references without a dependency on `root`. */
+
+var freeParseInt = parseInt;
+/**
+ * Converts `value` to a number.
+ *
+ * @static
+ * @memberOf _
+ * @since 4.0.0
+ * @category Lang
+ * @param {*} value The value to process.
+ * @returns {number} Returns the number.
+ * @example
+ *
+ * _.toNumber(3.2);
+ * // => 3.2
+ *
+ * _.toNumber(Number.MIN_VALUE);
+ * // => 5e-324
+ *
+ * _.toNumber(Infinity);
+ * // => Infinity
+ *
+ * _.toNumber('3.2');
+ * // => 3.2
+ */
+
+function toNumber(value) {
+  if (typeof value == 'number') {
+    return value;
+  }
+
+  if (isSymbol(value)) {
+    return NAN;
+  }
+
+  if (isObject(value)) {
+    var other = typeof value.valueOf == 'function' ? value.valueOf() : value;
+    value = isObject(other) ? other + '' : other;
+  }
+
+  if (typeof value != 'string') {
+    return value === 0 ? value : +value;
+  }
+
+  value = baseTrim(value);
+  var isBinary = reIsBinary.test(value);
+  return isBinary || reIsOctal.test(value) ? freeParseInt(value.slice(2), isBinary ? 2 : 8) : reIsBadHex.test(value) ? NAN : +value;
+}
+
+var toNumber_1 = toNumber;
+
+export { toNumber_1 as t };
+//# sourceMappingURL=dep-397b0501.js.map

package/esm/_chunks/dep-397b0501.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-397b0501.js","sources":["../../node_modules/lodash/_trimmedEndIndex.js","../../node_modules/lodash/_baseTrim.js","../../node_modules/lodash/toNumber.js"],"sourcesContent":["/** Used to match a single whitespace character. */\nvar reWhitespace = /\\s/;\n\n/**\n * Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace\n * character of `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the index of the last non-whitespace character.\n */\nfunction trimmedEndIndex(string) {\n  var index = string.length;\n\n  while (index-- && reWhitespace.test(string.charAt(index))) {}\n  return index;\n}\n\nmodule.exports = trimmedEndIndex;\n","var trimmedEndIndex = require('./_trimmedEndIndex');\n\n/** Used to match leading whitespace. */\nvar reTrimStart = /^\\s+/;\n\n/**\n * The base implementation of `_.trim`.\n *\n * @private\n * @param {string} string The string to trim.\n * @returns {string} Returns the trimmed string.\n */\nfunction baseTrim(string) {\n  return string\n    ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')\n    : string;\n}\n\nmodule.exports = baseTrim;\n","var baseTrim = require('./_baseTrim'),\n    isObject = require('./isObject'),\n    isSymbol = require('./isSymbol');\n\n/** Used as references for various `Number` constants. */\nvar NAN = 0 / 0;\n\n/** Used to detect bad signed hexadecimal string values. */\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/** Used to detect binary string values. */\nvar reIsBinary = /^0b[01]+$/i;\n\n/** Used to detect octal string values. */\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/** Built-in method references without a dependency on `root`. */\nvar freeParseInt = parseInt;\n\n/**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\nfunction toNumber(value) {\n  if (typeof value == 'number') {\n    return value;\n  }\n  if (isSymbol(value)) {\n    return NAN;\n  }\n  if (isObject(value)) {\n    var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n    value = isObject(other) ? (other + '') : other;\n  }\n  if (typeof value != 'string') {\n    return value === 0 ? value : +value;\n  }\n  value = baseTrim(value);\n  var isBinary = reIsBinary.test(value);\n  return (isBinary || reIsOctal.test(value))\n    ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n    : (reIsBadHex.test(value) ? NAN : +value);\n}\n\nmodule.exports = toNumber;\n"],"names":["reWhitespace","trimmedEndIndex","string","index","length","test","charAt","_trimmedEndIndex","require$$0","reTrimStart","baseTrim","slice","replace","_baseTrim","isObject","require$$1","isSymbol","require$$2","NAN","reIsBadHex","reIsBinary","reIsOctal","freeParseInt","parseInt","toNumber","value","other","valueOf","isBinary","toNumber_1"],"mappings":";;;;;;;;;;;;AACA,IAAIA,YAAY,GAAG,IAAnB,CAAA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,iBAAT,CAAyBC,MAAzB,EAAiC;AAC/B,EAAA,IAAIC,KAAK,GAAGD,MAAM,CAACE,MAAnB,CAAA;;AAEA,EAAA,OAAOD,KAAK,EAAA,IAAMH,YAAY,CAACK,IAAb,CAAkBH,MAAM,CAACI,MAAP,CAAcH,KAAd,CAAlB,CAAlB,EAA2D,EAAE;;AAC7D,EAAA,OAAOA,KAAP,CAAA;AACD,CAAA;;AAED,IAAAI,gBAAc,GAAGN,iBAAjB;;AClBA,IAAIA,eAAe,GAAGO,gBAAtB,CAAA;AAEA;;AACA,IAAIC,WAAW,GAAG,MAAlB,CAAA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,UAAT,CAAkBR,MAAlB,EAA0B;EACxB,OAAOA,MAAM,GACTA,MAAM,CAACS,KAAP,CAAa,CAAb,EAAgBV,eAAe,CAACC,MAAD,CAAf,GAA0B,CAA1C,EAA6CU,OAA7C,CAAqDH,WAArD,EAAkE,EAAlE,CADS,GAETP,MAFJ,CAAA;AAGD,CAAA;;AAED,IAAAW,SAAc,GAAGH,UAAjB;;AClBA,IAAIA,QAAQ,GAAGF,SAAf;AAAA,IACIM,QAAQ,GAAGC,UADf;AAAA,IAEIC,QAAQ,GAAGC,UAFf,CAAA;AAIA;;AACA,IAAIC,GAAG,GAAG,CAAA,GAAI,CAAd,CAAA;AAEA;;AACA,IAAIC,UAAU,GAAG,oBAAjB,CAAA;AAEA;;AACA,IAAIC,UAAU,GAAG,YAAjB,CAAA;AAEA;;AACA,IAAIC,SAAS,GAAG,aAAhB,CAAA;AAEA;;AACA,IAAIC,YAAY,GAAGC,QAAnB,CAAA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,QAAT,CAAkBC,KAAlB,EAAyB;AACvB,EAAA,IAAI,OAAOA,KAAP,IAAgB,QAApB,EAA8B;AAC5B,IAAA,OAAOA,KAAP,CAAA;AACD,GAAA;;AACD,EAAA,IAAIT,QAAQ,CAACS,KAAD,CAAZ,EAAqB;AACnB,IAAA,OAAOP,GAAP,CAAA;AACD,GAAA;;AACD,EAAA,IAAIJ,QAAQ,CAACW,KAAD,CAAZ,EAAqB;AACnB,IAAA,IAAIC,KAAK,GAAG,OAAOD,KAAK,CAACE,OAAb,IAAwB,UAAxB,GAAqCF,KAAK,CAACE,OAAN,EAArC,GAAuDF,KAAnE,CAAA;IACAA,KAAK,GAAGX,QAAQ,CAACY,KAAD,CAAR,GAAmBA,KAAK,GAAG,EAA3B,GAAiCA,KAAzC,CAAA;AACD,GAAA;;AACD,EAAA,IAAI,OAAOD,KAAP,IAAgB,QAApB,EAA8B;AAC5B,IAAA,OAAOA,KAAK,KAAK,CAAV,GAAcA,KAAd,GAAsB,CAACA,KAA9B,CAAA;AACD,GAAA;;AACDA,EAAAA,KAAK,GAAGf,QAAQ,CAACe,KAAD,CAAhB,CAAA;AACA,EAAA,IAAIG,QAAQ,GAAGR,UAAU,CAACf,IAAX,CAAgBoB,KAAhB,CAAf,CAAA;AACA,EAAA,OAAQG,QAAQ,IAAIP,SAAS,CAAChB,IAAV,CAAeoB,KAAf,CAAb,GACHH,YAAY,CAACG,KAAK,CAACd,KAAN,CAAY,CAAZ,CAAD,EAAiBiB,QAAQ,GAAG,CAAH,GAAO,CAAhC,CADT,GAEFT,UAAU,CAACd,IAAX,CAAgBoB,KAAhB,CAAA,GAAyBP,GAAzB,GAA+B,CAACO,KAFrC,CAAA;AAGD,CAAA;;AAEDI,IAAAA,UAAc,GAAGL;;;;"}

package/esm/_chunks/dep-3b0f6c02.js

@@ -0,0 +1,131 @@
+/**
+ * tdesign v0.40.3
+ * (c) 2022 tdesign
+ * @license MIT
+ */
+
+import './dep-e4f326ea.js';
+import { _ as _arrayMap } from './dep-1a1f1825.js';
+import { a as _SetCache, b as _cacheHas } from './dep-361f6701.js';
+import { _ as _arrayIncludes, a as _arrayIncludesWith } from './dep-d0457fd0.js';
+import { _ as _baseUnary } from './dep-4b505236.js';
+import { i as isArrayLikeObject_1, _ as _baseRest } from './dep-ad60a537.js';
+
+var SetCache = _SetCache,
+    arrayIncludes = _arrayIncludes,
+    arrayIncludesWith = _arrayIncludesWith,
+    arrayMap$1 = _arrayMap,
+    baseUnary = _baseUnary,
+    cacheHas = _cacheHas;
+/* Built-in method references for those with the same name as other `lodash` methods. */
+
+var nativeMin = Math.min;
+/**
+ * The base implementation of methods like `_.intersection`, without support
+ * for iteratee shorthands, that accepts an array of arrays to inspect.
+ *
+ * @private
+ * @param {Array} arrays The arrays to inspect.
+ * @param {Function} [iteratee] The iteratee invoked per element.
+ * @param {Function} [comparator] The comparator invoked per element.
+ * @returns {Array} Returns the new array of shared values.
+ */
+
+function baseIntersection$1(arrays, iteratee, comparator) {
+  var includes = comparator ? arrayIncludesWith : arrayIncludes,
+      length = arrays[0].length,
+      othLength = arrays.length,
+      othIndex = othLength,
+      caches = Array(othLength),
+      maxLength = Infinity,
+      result = [];
+
+  while (othIndex--) {
+    var array = arrays[othIndex];
+
+    if (othIndex && iteratee) {
+      array = arrayMap$1(array, baseUnary(iteratee));
+    }
+
+    maxLength = nativeMin(array.length, maxLength);
+    caches[othIndex] = !comparator && (iteratee || length >= 120 && array.length >= 120) ? new SetCache(othIndex && array) : undefined;
+  }
+
+  array = arrays[0];
+  var index = -1,
+      seen = caches[0];
+
+  outer: while (++index < length && result.length < maxLength) {
+    var value = array[index],
+        computed = iteratee ? iteratee(value) : value;
+    value = comparator || value !== 0 ? value : 0;
+
+    if (!(seen ? cacheHas(seen, computed) : includes(result, computed, comparator))) {
+      othIndex = othLength;
+
+      while (--othIndex) {
+        var cache = caches[othIndex];
+
+        if (!(cache ? cacheHas(cache, computed) : includes(arrays[othIndex], computed, comparator))) {
+          continue outer;
+        }
+      }
+
+      if (seen) {
+        seen.push(computed);
+      }
+
+      result.push(value);
+    }
+  }
+
+  return result;
+}
+
+var _baseIntersection = baseIntersection$1;
+
+var isArrayLikeObject = isArrayLikeObject_1;
+/**
+ * Casts `value` to an empty array if it's not an array like object.
+ *
+ * @private
+ * @param {*} value The value to inspect.
+ * @returns {Array|Object} Returns the cast array-like object.
+ */
+
+function castArrayLikeObject$1(value) {
+  return isArrayLikeObject(value) ? value : [];
+}
+
+var _castArrayLikeObject = castArrayLikeObject$1;
+
+var arrayMap = _arrayMap,
+    baseIntersection = _baseIntersection,
+    baseRest = _baseRest,
+    castArrayLikeObject = _castArrayLikeObject;
+/**
+ * Creates an array of unique values that are included in all given arrays
+ * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
+ * for equality comparisons. The order and references of result values are
+ * determined by the first array.
+ *
+ * @static
+ * @memberOf _
+ * @since 0.1.0
+ * @category Array
+ * @param {...Array} [arrays] The arrays to inspect.
+ * @returns {Array} Returns the new array of intersecting values.
+ * @example
+ *
+ * _.intersection([2, 1], [2, 3]);
+ * // => [2]
+ */
+
+var intersection = baseRest(function (arrays) {
+  var mapped = arrayMap(arrays, castArrayLikeObject);
+  return mapped.length && mapped[0] === arrays[0] ? baseIntersection(mapped) : [];
+});
+var intersection_1 = intersection;
+
+export { intersection_1 as i };
+//# sourceMappingURL=dep-3b0f6c02.js.map

package/esm/_chunks/dep-3b0f6c02.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-3b0f6c02.js","sources":["../../node_modules/lodash/_baseIntersection.js","../../node_modules/lodash/_castArrayLikeObject.js","../../node_modules/lodash/intersection.js"],"sourcesContent":["var SetCache = require('./_SetCache'),\n    arrayIncludes = require('./_arrayIncludes'),\n    arrayIncludesWith = require('./_arrayIncludesWith'),\n    arrayMap = require('./_arrayMap'),\n    baseUnary = require('./_baseUnary'),\n    cacheHas = require('./_cacheHas');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMin = Math.min;\n\n/**\n * The base implementation of methods like `_.intersection`, without support\n * for iteratee shorthands, that accepts an array of arrays to inspect.\n *\n * @private\n * @param {Array} arrays The arrays to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of shared values.\n */\nfunction baseIntersection(arrays, iteratee, comparator) {\n  var includes = comparator ? arrayIncludesWith : arrayIncludes,\n      length = arrays[0].length,\n      othLength = arrays.length,\n      othIndex = othLength,\n      caches = Array(othLength),\n      maxLength = Infinity,\n      result = [];\n\n  while (othIndex--) {\n    var array = arrays[othIndex];\n    if (othIndex && iteratee) {\n      array = arrayMap(array, baseUnary(iteratee));\n    }\n    maxLength = nativeMin(array.length, maxLength);\n    caches[othIndex] = !comparator && (iteratee || (length >= 120 && array.length >= 120))\n      ? new SetCache(othIndex && array)\n      : undefined;\n  }\n  array = arrays[0];\n\n  var index = -1,\n      seen = caches[0];\n\n  outer:\n  while (++index < length && result.length < maxLength) {\n    var value = array[index],\n        computed = iteratee ? iteratee(value) : value;\n\n    value = (comparator || value !== 0) ? value : 0;\n    if (!(seen\n          ? cacheHas(seen, computed)\n          : includes(result, computed, comparator)\n        )) {\n      othIndex = othLength;\n      while (--othIndex) {\n        var cache = caches[othIndex];\n        if (!(cache\n              ? cacheHas(cache, computed)\n              : includes(arrays[othIndex], computed, comparator))\n            ) {\n          continue outer;\n        }\n      }\n      if (seen) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseIntersection;\n","var isArrayLikeObject = require('./isArrayLikeObject');\n\n/**\n * Casts `value` to an empty array if it's not an array like object.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Array|Object} Returns the cast array-like object.\n */\nfunction castArrayLikeObject(value) {\n  return isArrayLikeObject(value) ? value : [];\n}\n\nmodule.exports = castArrayLikeObject;\n","var arrayMap = require('./_arrayMap'),\n    baseIntersection = require('./_baseIntersection'),\n    baseRest = require('./_baseRest'),\n    castArrayLikeObject = require('./_castArrayLikeObject');\n\n/**\n * Creates an array of unique values that are included in all given arrays\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. The order and references of result values are\n * determined by the first array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * _.intersection([2, 1], [2, 3]);\n * // => [2]\n */\nvar intersection = baseRest(function(arrays) {\n  var mapped = arrayMap(arrays, castArrayLikeObject);\n  return (mapped.length && mapped[0] === arrays[0])\n    ? baseIntersection(mapped)\n    : [];\n});\n\nmodule.exports = intersection;\n"],"names":["SetCache","require$$0","arrayIncludes","require$$1","arrayIncludesWith","require$$2","arrayMap","require$$3","baseUnary","require$$4","cacheHas","require$$5","nativeMin","Math","min","baseIntersection","arrays","iteratee","comparator","includes","length","othLength","othIndex","caches","Array","maxLength","Infinity","result","array","undefined","index","seen","outer","value","computed","cache","push","_baseIntersection","isArrayLikeObject","castArrayLikeObject","_castArrayLikeObject","baseRest","intersection","mapped","intersection_1"],"mappings":";;;;;;;;;;;;;AAAA,IAAIA,QAAQ,GAAGC,SAAf;AAAA,IACIC,aAAa,GAAGC,cADpB;AAAA,IAEIC,iBAAiB,GAAGC,kBAFxB;AAAA,IAGIC,UAAQ,GAAGC,SAHf;AAAA,IAIIC,SAAS,GAAGC,UAJhB;AAAA,IAKIC,QAAQ,GAAGC,SALf,CAAA;AAOA;;AACA,IAAIC,SAAS,GAAGC,IAAI,CAACC,GAArB,CAAA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,kBAAT,CAA0BC,MAA1B,EAAkCC,QAAlC,EAA4CC,UAA5C,EAAwD;AACtD,EAAA,IAAIC,QAAQ,GAAGD,UAAU,GAAGd,iBAAH,GAAuBF,aAAhD;AAAA,MACIkB,MAAM,GAAGJ,MAAM,CAAC,CAAD,CAAN,CAAUI,MADvB;AAAA,MAEIC,SAAS,GAAGL,MAAM,CAACI,MAFvB;MAGIE,QAAQ,GAAGD,SAHf;AAAA,MAIIE,MAAM,GAAGC,KAAK,CAACH,SAAD,CAJlB;MAKII,SAAS,GAAGC,QALhB;MAMIC,MAAM,GAAG,EANb,CAAA;;EAQA,OAAOL,QAAQ,EAAf,EAAmB;AACjB,IAAA,IAAIM,KAAK,GAAGZ,MAAM,CAACM,QAAD,CAAlB,CAAA;;IACA,IAAIA,QAAQ,IAAIL,QAAhB,EAA0B;MACxBW,KAAK,GAAGtB,UAAQ,CAACsB,KAAD,EAAQpB,SAAS,CAACS,QAAD,CAAjB,CAAhB,CAAA;AACD,KAAA;;IACDQ,SAAS,GAAGb,SAAS,CAACgB,KAAK,CAACR,MAAP,EAAeK,SAAf,CAArB,CAAA;IACAF,MAAM,CAACD,QAAD,CAAN,GAAmB,CAACJ,UAAD,KAAgBD,QAAQ,IAAKG,MAAM,IAAI,GAAV,IAAiBQ,KAAK,CAACR,MAAN,IAAgB,GAA9D,CAAA,GACf,IAAIpB,QAAJ,CAAasB,QAAQ,IAAIM,KAAzB,CADe,GAEfC,SAFJ,CAAA;AAGD,GAAA;;AACDD,EAAAA,KAAK,GAAGZ,MAAM,CAAC,CAAD,CAAd,CAAA;EAEA,IAAIc,KAAK,GAAG,CAAC,CAAb;AAAA,MACIC,IAAI,GAAGR,MAAM,CAAC,CAAD,CADjB,CAAA;;AAGAS,EAAAA,KAAK,EACL,OAAO,EAAEF,KAAF,GAAUV,MAAV,IAAoBO,MAAM,CAACP,MAAP,GAAgBK,SAA3C,EAAsD;AACpD,IAAA,IAAIQ,KAAK,GAAGL,KAAK,CAACE,KAAD,CAAjB;QACII,QAAQ,GAAGjB,QAAQ,GAAGA,QAAQ,CAACgB,KAAD,CAAX,GAAqBA,KAD5C,CAAA;IAGAA,KAAK,GAAIf,UAAU,IAAIe,KAAK,KAAK,CAAzB,GAA8BA,KAA9B,GAAsC,CAA9C,CAAA;;AACA,IAAA,IAAI,EAAEF,IAAI,GACFrB,QAAQ,CAACqB,IAAD,EAAOG,QAAP,CADN,GAEFf,QAAQ,CAACQ,MAAD,EAASO,QAAT,EAAmBhB,UAAnB,CAFZ,CAAJ,EAGO;AACLI,MAAAA,QAAQ,GAAGD,SAAX,CAAA;;MACA,OAAO,EAAEC,QAAT,EAAmB;AACjB,QAAA,IAAIa,KAAK,GAAGZ,MAAM,CAACD,QAAD,CAAlB,CAAA;;QACA,IAAI,EAAEa,KAAK,GACHzB,QAAQ,CAACyB,KAAD,EAAQD,QAAR,CADL,GAEHf,QAAQ,CAACH,MAAM,CAACM,QAAD,CAAP,EAAmBY,QAAnB,EAA6BhB,UAA7B,CAFZ,CAAJ,EAGM;AACJ,UAAA,SAASc,KAAT,CAAA;AACD,SAAA;AACF,OAAA;;AACD,MAAA,IAAID,IAAJ,EAAU;QACRA,IAAI,CAACK,IAAL,CAAUF,QAAV,CAAA,CAAA;AACD,OAAA;;MACDP,MAAM,CAACS,IAAP,CAAYH,KAAZ,CAAA,CAAA;AACD,KAAA;AACF,GAAA;;AACD,EAAA,OAAON,MAAP,CAAA;AACD,CAAA;;AAED,IAAAU,iBAAc,GAAGtB,kBAAjB;;ACzEA,IAAIuB,iBAAiB,GAAGrC,mBAAxB,CAAA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASsC,qBAAT,CAA6BN,KAA7B,EAAoC;AAClC,EAAA,OAAOK,iBAAiB,CAACL,KAAD,CAAjB,GAA2BA,KAA3B,GAAmC,EAA1C,CAAA;AACD,CAAA;;AAED,IAAAO,oBAAc,GAAGD,qBAAjB;;ACbA,IAAIjC,QAAQ,GAAGL,SAAf;AAAA,IACIc,gBAAgB,GAAGZ,iBADvB;AAAA,IAEIsC,QAAQ,GAAGpC,SAFf;AAAA,IAGIkC,mBAAmB,GAAGhC,oBAH1B,CAAA;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,IAAImC,YAAY,GAAGD,QAAQ,CAAC,UAASzB,MAAT,EAAiB;AAC3C,EAAA,IAAI2B,MAAM,GAAGrC,QAAQ,CAACU,MAAD,EAASuB,mBAAT,CAArB,CAAA;AACA,EAAA,OAAQI,MAAM,CAACvB,MAAP,IAAiBuB,MAAM,CAAC,CAAD,CAAN,KAAc3B,MAAM,CAAC,CAAD,CAAtC,GACHD,gBAAgB,CAAC4B,MAAD,CADb,GAEH,EAFJ,CAAA;AAGD,CAL0B,CAA3B,CAAA;AAOAC,IAAAA,cAAc,GAAGF;;;;"}

package/esm/_chunks/dep-3d2351f8.js

@@ -0,0 +1,18 @@
+/**
+ * tdesign v0.40.3
+ * (c) 2022 tdesign
+ * @license MIT
+ */
+
+function _typeof(obj) {
+  "@babel/helpers - typeof";
+
+  return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (obj) {
+    return typeof obj;
+  } : function (obj) {
+    return obj && "function" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj;
+  }, _typeof(obj);
+}
+
+export { _typeof as _ };
+//# sourceMappingURL=dep-3d2351f8.js.map

package/esm/_chunks/dep-3d2351f8.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-3d2351f8.js","sources":["../../node_modules/@babel/runtime/helpers/esm/typeof.js"],"sourcesContent":["export default function _typeof(obj) {\n  \"@babel/helpers - typeof\";\n\n  return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (obj) {\n    return typeof obj;\n  } : function (obj) {\n    return obj && \"function\" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj;\n  }, _typeof(obj);\n}"],"names":["_typeof","obj","Symbol","iterator","constructor","prototype"],"mappings":";;;;;;AAAe,SAASA,OAAT,CAAiBC,GAAjB,EAAsB;AACnC,EAAA,yBAAA,CAAA;;AAEA,EAAA,OAAOD,OAAO,GAAG,UAAc,IAAA,OAAOE,MAArB,IAA+B,QAAA,IAAY,OAAOA,MAAM,CAACC,QAAzD,GAAoE,UAAUF,GAAV,EAAe;AAClG,IAAA,OAAO,OAAOA,GAAd,CAAA;GADe,GAEb,UAAUA,GAAV,EAAe;IACjB,OAAOA,GAAG,IAAI,UAAc,IAAA,OAAOC,MAA5B,IAAsCD,GAAG,CAACG,WAAJ,KAAoBF,MAA1D,IAAoED,GAAG,KAAKC,MAAM,CAACG,SAAnF,GAA+F,QAA/F,GAA0G,OAAOJ,GAAxH,CAAA;AACD,GAJM,EAIJD,OAAO,CAACC,GAAD,CAJV,CAAA;AAKD;;;;"}

package/esm/_chunks/dep-3e8a8268.js

@@ -0,0 +1,33 @@
+/**
+ * tdesign v0.40.3
+ * (c) 2022 tdesign
+ * @license MIT
+ */
+
+import './dep-e4f326ea.js';
+
+/**
+ * Appends the elements of `values` to `array`.
+ *
+ * @private
+ * @param {Array} array The array to modify.
+ * @param {Array} values The values to append.
+ * @returns {Array} Returns `array`.
+ */
+
+function arrayPush(array, values) {
+  var index = -1,
+      length = values.length,
+      offset = array.length;
+
+  while (++index < length) {
+    array[offset + index] = values[index];
+  }
+
+  return array;
+}
+
+var _arrayPush = arrayPush;
+
+export { _arrayPush as _ };
+//# sourceMappingURL=dep-3e8a8268.js.map

package/esm/_chunks/dep-3e8a8268.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-3e8a8268.js","sources":["../../node_modules/lodash/_arrayPush.js"],"sourcesContent":["/**\n * Appends the elements of `values` to `array`.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n */\nfunction arrayPush(array, values) {\n  var index = -1,\n      length = values.length,\n      offset = array.length;\n\n  while (++index < length) {\n    array[offset + index] = values[index];\n  }\n  return array;\n}\n\nmodule.exports = arrayPush;\n"],"names":["arrayPush","array","values","index","length","offset","_arrayPush"],"mappings":";;;;;;;;;;;;;;;;;AAQA,SAASA,SAAT,CAAmBC,KAAnB,EAA0BC,MAA1B,EAAkC;EAChC,IAAIC,KAAK,GAAG,CAAC,CAAb;AAAA,MACIC,MAAM,GAAGF,MAAM,CAACE,MADpB;AAAA,MAEIC,MAAM,GAAGJ,KAAK,CAACG,MAFnB,CAAA;;AAIA,EAAA,OAAO,EAAED,KAAF,GAAUC,MAAjB,EAAyB;IACvBH,KAAK,CAACI,MAAM,GAAGF,KAAV,CAAL,GAAwBD,MAAM,CAACC,KAAD,CAA9B,CAAA;AACD,GAAA;;AACD,EAAA,OAAOF,KAAP,CAAA;AACD,CAAA;;AAEDK,IAAAA,UAAc,GAAGN;;;;"}

package/esm/_chunks/dep-40de483b.js

@@ -0,0 +1,208 @@
+/**
+ * tdesign v0.40.3
+ * (c) 2022 tdesign
+ * @license MIT
+ */
+
+import { _ as _defineProperty } from './dep-ca97137d.js';
+import React, { useState, useMemo, useEffect } from 'react';
+import forwardRefWithStatics from '../_util/forwardRefWithStatics.js';
+import Check, { CheckContext } from '../common/Check.js';
+import { _ as _slicedToArray } from './dep-73ff9c2a.js';
+import { _ as _typeof } from './dep-3d2351f8.js';
+import classNames from 'classnames';
+import { i as isNumber_1 } from './dep-65594d7d.js';
+import useConfig from '../hooks/useConfig.js';
+import useControlled from '../hooks/useControlled.js';
+import { checkboxGroupDefaultProps, checkboxDefaultProps } from '../checkbox/defaultProps.js';
+
+function ownKeys$1(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }
+
+function _objectSpread$1(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys$1(Object(source), !0).forEach(function (key) { _defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys$1(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }
+
+var getCheckboxValue = function getCheckboxValue(v) {
+  switch (_typeof(v)) {
+    case "number":
+      return v;
+
+    case "string":
+      return v;
+
+    case "object":
+      {
+        var vs = v;
+        return vs.value;
+      }
+
+    default:
+      return void 0;
+  }
+};
+
+var CheckboxGroup = function CheckboxGroup(props) {
+  var _useConfig = useConfig(),
+      classPrefix = _useConfig.classPrefix;
+
+  var onChange = props.onChange,
+      disabled = props.disabled,
+      className = props.className,
+      style = props.style,
+      children = props.children,
+      max = props.max,
+      _props$options = props.options,
+      options = _props$options === void 0 ? [] : _props$options;
+  var intervalOptions = Array.isArray(options) && options.length > 0 ? options : React.Children.map(children, function (child) {
+    return child.props;
+  }) || [];
+  var optionsWithoutCheckAll = intervalOptions.filter(function (t) {
+    return _typeof(t) !== "object" || !t.checkAll;
+  });
+  var optionsWithoutCheckAllValues = [];
+  optionsWithoutCheckAll.forEach(function (v) {
+    var vs = getCheckboxValue(v);
+    optionsWithoutCheckAllValues.push(vs);
+  });
+
+  var _useControlled = useControlled(props, "value", onChange),
+      _useControlled2 = _slicedToArray(_useControlled, 2),
+      internalValue = _useControlled2[0],
+      setInternalValue = _useControlled2[1];
+
+  var _useState = useState(max),
+      _useState2 = _slicedToArray(_useState, 2),
+      localMax = _useState2[0],
+      setLocalMax = _useState2[1];
+
+  var checkedSet = useMemo(function () {
+    if (!Array.isArray(internalValue)) return /* @__PURE__ */new Set([]);
+    return new Set([].concat(internalValue));
+  }, [internalValue]);
+  var indeterminate = useMemo(function () {
+    var list = Array.from(checkedSet);
+    return list.length !== 0 && list.length !== optionsWithoutCheckAll.length;
+  }, [checkedSet, optionsWithoutCheckAll]);
+  var checkAllChecked = useMemo(function () {
+    var list = Array.from(checkedSet);
+    return list.length === optionsWithoutCheckAll.length;
+  }, [checkedSet, optionsWithoutCheckAll]);
+  useEffect(function () {
+    if (!isNumber_1(max)) return;
+
+    if (max < checkedSet.size) {
+      console.warn("[TDesign] max should be less than the length of value, change is invalid");
+    } else {
+      setLocalMax(max);
+    }
+  }, [max, checkedSet]);
+  var context = {
+    inject: function inject(checkProps) {
+      if (typeof checkProps.checked !== "undefined") {
+        return checkProps;
+      }
+
+      var checkValue = checkProps.value;
+      return _objectSpread$1(_objectSpread$1({}, checkProps), {}, {
+        checked: checkProps.checkAll ? checkAllChecked : checkedSet.has(checkValue),
+        indeterminate: checkProps.checkAll ? indeterminate : checkProps.indeterminate,
+        disabled: checkProps.disabled || disabled || checkedSet.size >= localMax && !checkedSet.has(checkValue),
+        onChange: function onChange(checked, _ref) {
+          var e = _ref.e;
+
+          if (typeof checkProps.onChange === "function") {
+            checkProps.onChange(checked, {
+              e: e
+            });
+          }
+
+          if (checkProps.checkAll) {
+            checkedSet.clear();
+
+            if (checked) {
+              optionsWithoutCheckAllValues.forEach(function (v) {
+                checkedSet.add(v);
+              });
+            }
+          } else if (checked) {
+            if (checkedSet.size >= localMax && isNumber_1(max)) return;
+            checkedSet.add(checkValue);
+          } else {
+            checkedSet["delete"](checkValue);
+          }
+
+          setInternalValue(Array.from(checkedSet), {
+            e: e,
+            current: checkProps.checkAll ? void 0 : checkValue,
+            type: checked ? "check" : "uncheck"
+          });
+        }
+      });
+    }
+  };
+  var useOptions = Array.isArray(options) && options.length !== 0;
+  return /* @__PURE__ */React.createElement("div", {
+    className: classNames("".concat(classPrefix, "-checkbox-group"), className),
+    style: style
+  }, /* @__PURE__ */React.createElement(CheckContext.Provider, {
+    value: context
+  }, useOptions ? options.map(function (v, index) {
+    var type = _typeof(v);
+
+    switch (type) {
+      case "string":
+        {
+          var vs = v;
+          return /* @__PURE__ */React.createElement(Checkbox$1, {
+            key: index,
+            label: vs,
+            value: vs
+          }, v);
+        }
+
+      case "number":
+        {
+          var _vs = v;
+          return /* @__PURE__ */React.createElement(Checkbox$1, {
+            key: index,
+            label: _vs,
+            value: _vs
+          }, v);
+        }
+
+      case "object":
+        {
+          var _vs2 = v;
+          return _vs2.checkAll ? /* @__PURE__ */React.createElement(Checkbox$1, _objectSpread$1(_objectSpread$1({}, _vs2), {}, {
+            key: "checkAll_".concat(index),
+            indeterminate: indeterminate
+          })) : /* @__PURE__ */React.createElement(Checkbox$1, _objectSpread$1(_objectSpread$1({}, _vs2), {}, {
+            key: index,
+            disabled: _vs2.disabled || disabled
+          }));
+        }
+
+      default:
+        return null;
+    }
+  }) : children));
+};
+
+CheckboxGroup.displayName = "CheckboxGroup";
+CheckboxGroup.defaultProps = checkboxGroupDefaultProps;
+
+function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }
+
+function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { _defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }
+var Checkbox = forwardRefWithStatics(function (props, ref) {
+  return /* @__PURE__ */React.createElement(Check, _objectSpread({
+    ref: ref,
+    type: "checkbox"
+  }, props));
+}, {
+  Group: CheckboxGroup
+});
+Checkbox.displayName = "Checkbox";
+Checkbox.defaultProps = checkboxDefaultProps;
+var Checkbox$1 = Checkbox;
+
+export { Checkbox$1 as C, CheckboxGroup as a };
+//# sourceMappingURL=dep-40de483b.js.map