tdesign-react 1.5.6-alpha.1 → 1.5.6-alpha.3

package/cjs/_chunks/dep-e98eb681.js

@@ -0,0 +1,76 @@
+/**
+ * tdesign v1.5.6-alpha.2
+ * (c) 2024 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var _cacheHas = require('./dep-ca11638b.js');
+var toString = require('./dep-da9fe1df.js');
+var _baseUnary = require('./dep-9e3116a4.js');
+
+var SetCache = _cacheHas._SetCache,
+  arrayIncludes = _cacheHas._arrayIncludes,
+  arrayIncludesWith = _cacheHas._arrayIncludesWith,
+  arrayMap = toString._arrayMap,
+  baseUnary = _baseUnary._baseUnary,
+  cacheHas = _cacheHas._cacheHas;
+
+/** Used as the size to enable large array optimizations. */
+var LARGE_ARRAY_SIZE = 200;
+
+/**
+ * The base implementation of methods like `_.difference` without support
+ * for excluding multiple arrays or iteratee shorthands.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {Array} values The values to exclude.
+ * @param {Function} [iteratee] The iteratee invoked per element.
+ * @param {Function} [comparator] The comparator invoked per element.
+ * @returns {Array} Returns the new array of filtered values.
+ */
+function baseDifference(array, values, iteratee, comparator) {
+  var index = -1,
+    includes = arrayIncludes,
+    isCommon = true,
+    length = array.length,
+    result = [],
+    valuesLength = values.length;
+  if (!length) {
+    return result;
+  }
+  if (iteratee) {
+    values = arrayMap(values, baseUnary(iteratee));
+  }
+  if (comparator) {
+    includes = arrayIncludesWith;
+    isCommon = false;
+  } else if (values.length >= LARGE_ARRAY_SIZE) {
+    includes = cacheHas;
+    isCommon = false;
+    values = new SetCache(values);
+  }
+  outer: while (++index < length) {
+    var value = array[index],
+      computed = iteratee == null ? value : iteratee(value);
+    value = comparator || value !== 0 ? value : 0;
+    if (isCommon && computed === computed) {
+      var valuesIndex = valuesLength;
+      while (valuesIndex--) {
+        if (values[valuesIndex] === computed) {
+          continue outer;
+        }
+      }
+      result.push(value);
+    } else if (!includes(values, computed, comparator)) {
+      result.push(value);
+    }
+  }
+  return result;
+}
+var _baseDifference = baseDifference;
+
+exports._baseDifference = _baseDifference;
+//# sourceMappingURL=dep-e98eb681.js.map

package/cjs/_chunks/dep-e98eb681.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-e98eb681.js","sources":["../../node_modules/lodash/_baseDifference.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/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * The base implementation of methods like `_.difference` without support\n * for excluding multiple arrays or iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Array} values The values to exclude.\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 filtered values.\n */\nfunction baseDifference(array, values, iteratee, comparator) {\n  var index = -1,\n      includes = arrayIncludes,\n      isCommon = true,\n      length = array.length,\n      result = [],\n      valuesLength = values.length;\n\n  if (!length) {\n    return result;\n  }\n  if (iteratee) {\n    values = arrayMap(values, baseUnary(iteratee));\n  }\n  if (comparator) {\n    includes = arrayIncludesWith;\n    isCommon = false;\n  }\n  else if (values.length >= LARGE_ARRAY_SIZE) {\n    includes = cacheHas;\n    isCommon = false;\n    values = new SetCache(values);\n  }\n  outer:\n  while (++index < length) {\n    var value = array[index],\n        computed = iteratee == null ? value : iteratee(value);\n\n    value = (comparator || value !== 0) ? value : 0;\n    if (isCommon && computed === computed) {\n      var valuesIndex = valuesLength;\n      while (valuesIndex--) {\n        if (values[valuesIndex] === computed) {\n          continue outer;\n        }\n      }\n      result.push(value);\n    }\n    else if (!includes(values, computed, comparator)) {\n      result.push(value);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseDifference;\n"],"names":["SetCache","require$$0","arrayIncludes","require$$1","arrayIncludesWith","require$$2","arrayMap","require$$3","baseUnary","require$$4","cacheHas","require$$5","LARGE_ARRAY_SIZE","baseDifference","array","values","iteratee","comparator","index","includes","isCommon","length","result","valuesLength","outer","value","computed","valuesIndex","push","_baseDifference"],"mappings":";;;;;;;;;;;;AAAA,IAAIA,QAAQ,GAAGC,mBAAsB;AACjCC,EAAAA,aAAa,GAAGC,wBAA2B;AAC3CC,EAAAA,iBAAiB,GAAGC,4BAA+B;AACnDC,EAAAA,QAAQ,GAAGC,kBAAsB;AACjCC,EAAAA,SAAS,GAAGC,qBAAuB;AACnCC,EAAAA,QAAQ,GAAGC,mBAAsB,CAAA;;AAErC;AACA,IAAIC,gBAAgB,GAAG,GAAG,CAAA;;AAE1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,cAAcA,CAACC,KAAK,EAAEC,MAAM,EAAEC,QAAQ,EAAEC,UAAU,EAAE;EAC3D,IAAIC,KAAK,GAAG,CAAC,CAAC;AACVC,IAAAA,QAAQ,GAAGjB,aAAa;AACxBkB,IAAAA,QAAQ,GAAG,IAAI;IACfC,MAAM,GAAGP,KAAK,CAACO,MAAM;AACrBC,IAAAA,MAAM,GAAG,EAAE;IACXC,YAAY,GAAGR,MAAM,CAACM,MAAM,CAAA;EAEhC,IAAI,CAACA,MAAM,EAAE;AACX,IAAA,OAAOC,MAAM,CAAA;AACd,GAAA;AACD,EAAA,IAAIN,QAAQ,EAAE;IACZD,MAAM,GAAGT,QAAQ,CAACS,MAAM,EAAEP,SAAS,CAACQ,QAAQ,CAAC,CAAC,CAAA;AAC/C,GAAA;AACD,EAAA,IAAIC,UAAU,EAAE;AACdE,IAAAA,QAAQ,GAAGf,iBAAiB,CAAA;AAC5BgB,IAAAA,QAAQ,GAAG,KAAK,CAAA;AACjB,GAAA,MACI,IAAIL,MAAM,CAACM,MAAM,IAAIT,gBAAgB,EAAE;AAC1CO,IAAAA,QAAQ,GAAGT,QAAQ,CAAA;AACnBU,IAAAA,QAAQ,GAAG,KAAK,CAAA;AAChBL,IAAAA,MAAM,GAAG,IAAIf,QAAQ,CAACe,MAAM,CAAC,CAAA;AAC9B,GAAA;AACDS,EAAAA,KAAK,EACL,OAAO,EAAEN,KAAK,GAAGG,MAAM,EAAE;AACvB,IAAA,IAAII,KAAK,GAAGX,KAAK,CAACI,KAAK,CAAC;MACpBQ,QAAQ,GAAGV,QAAQ,IAAI,IAAI,GAAGS,KAAK,GAAGT,QAAQ,CAACS,KAAK,CAAC,CAAA;IAEzDA,KAAK,GAAIR,UAAU,IAAIQ,KAAK,KAAK,CAAC,GAAIA,KAAK,GAAG,CAAC,CAAA;AAC/C,IAAA,IAAIL,QAAQ,IAAIM,QAAQ,KAAKA,QAAQ,EAAE;MACrC,IAAIC,WAAW,GAAGJ,YAAY,CAAA;MAC9B,OAAOI,WAAW,EAAE,EAAE;AACpB,QAAA,IAAIZ,MAAM,CAACY,WAAW,CAAC,KAAKD,QAAQ,EAAE;AACpC,UAAA,SAASF,KAAK,CAAA;AACf,SAAA;AACF,OAAA;AACDF,MAAAA,MAAM,CAACM,IAAI,CAACH,KAAK,CAAC,CAAA;KACnB,MACI,IAAI,CAACN,QAAQ,CAACJ,MAAM,EAAEW,QAAQ,EAAET,UAAU,CAAC,EAAE;AAChDK,MAAAA,MAAM,CAACM,IAAI,CAACH,KAAK,CAAC,CAAA;AACnB,KAAA;AACF,GAAA;AACD,EAAA,OAAOH,MAAM,CAAA;AACf,CAAA;AAEAO,IAAAA,eAAc,GAAGhB;;;;"}

package/cjs/_chunks/dep-eaa123c1.js

@@ -0,0 +1,34 @@
+/**
+ * tdesign v1.5.6-alpha.2
+ * (c) 2024 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+/**
+ * A specialized version of `_.filter` for arrays without support for
+ * iteratee shorthands.
+ *
+ * @private
+ * @param {Array} [array] The array to iterate over.
+ * @param {Function} predicate The function invoked per iteration.
+ * @returns {Array} Returns the new filtered array.
+ */
+function arrayFilter(array, predicate) {
+  var index = -1,
+    length = array == null ? 0 : array.length,
+    resIndex = 0,
+    result = [];
+  while (++index < length) {
+    var value = array[index];
+    if (predicate(value, index, array)) {
+      result[resIndex++] = value;
+    }
+  }
+  return result;
+}
+var _arrayFilter = arrayFilter;
+
+exports._arrayFilter = _arrayFilter;
+//# sourceMappingURL=dep-eaa123c1.js.map

package/cjs/_chunks/dep-eaa123c1.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-eaa123c1.js","sources":["../../node_modules/lodash/_arrayFilter.js"],"sourcesContent":["/**\n * A specialized version of `_.filter` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\nfunction arrayFilter(array, predicate) {\n  var index = -1,\n      length = array == null ? 0 : array.length,\n      resIndex = 0,\n      result = [];\n\n  while (++index < length) {\n    var value = array[index];\n    if (predicate(value, index, array)) {\n      result[resIndex++] = value;\n    }\n  }\n  return result;\n}\n\nmodule.exports = arrayFilter;\n"],"names":["arrayFilter","array","predicate","index","length","resIndex","result","value","_arrayFilter"],"mappings":";;;;;;;;;;;;;;;;;AASA,SAASA,WAAWA,CAACC,KAAK,EAAEC,SAAS,EAAE;EACrC,IAAIC,KAAK,GAAG,CAAC,CAAC;IACVC,MAAM,GAAGH,KAAK,IAAI,IAAI,GAAG,CAAC,GAAGA,KAAK,CAACG,MAAM;AACzCC,IAAAA,QAAQ,GAAG,CAAC;AACZC,IAAAA,MAAM,GAAG,EAAE,CAAA;AAEf,EAAA,OAAO,EAAEH,KAAK,GAAGC,MAAM,EAAE;AACvB,IAAA,IAAIG,KAAK,GAAGN,KAAK,CAACE,KAAK,CAAC,CAAA;IACxB,IAAID,SAAS,CAACK,KAAK,EAAEJ,KAAK,EAAEF,KAAK,CAAC,EAAE;AAClCK,MAAAA,MAAM,CAACD,QAAQ,EAAE,CAAC,GAAGE,KAAK,CAAA;AAC3B,KAAA;AACF,GAAA;AACD,EAAA,OAAOD,MAAM,CAAA;AACf,CAAA;AAEAE,IAAAA,YAAc,GAAGR;;;;"}

package/cjs/_chunks/dep-ec9e4310.js

@@ -0,0 +1,110 @@
+/**
+ * tdesign v1.5.6-alpha.2
+ * (c) 2024 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var isObject$1 = require('./dep-7d9bddfe.js');
+var isSymbol$1 = require('./dep-f3f24f4a.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.isObject_1,
+  isSymbol = isSymbol$1.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;
+
+exports.toNumber_1 = toNumber_1;
+//# sourceMappingURL=dep-ec9e4310.js.map

package/cjs/_chunks/dep-ec9e4310.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-ec9e4310.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,IAAI,CAAA;;AAEvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,iBAAeA,CAACC,MAAM,EAAE;AAC/B,EAAA,IAAIC,KAAK,GAAGD,MAAM,CAACE,MAAM,CAAA;AAEzB,EAAA,OAAOD,KAAK,EAAE,IAAIH,YAAY,CAACK,IAAI,CAACH,MAAM,CAACI,MAAM,CAACH,KAAK,CAAC,CAAC,EAAE,EAAE;AAC7D,EAAA,OAAOA,KAAK,CAAA;AACd,CAAA;AAEA,IAAAI,gBAAc,GAAGN,iBAAe;;AClBhC,IAAIA,eAAe,GAAGO,gBAA6B,CAAA;;AAEnD;AACA,IAAIC,WAAW,GAAG,MAAM,CAAA;;AAExB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,UAAQA,CAACR,MAAM,EAAE;EACxB,OAAOA,MAAM,GACTA,MAAM,CAACS,KAAK,CAAC,CAAC,EAAEV,eAAe,CAACC,MAAM,CAAC,GAAG,CAAC,CAAC,CAACU,OAAO,CAACH,WAAW,EAAE,EAAE,CAAC,GACrEP,MAAM,CAAA;AACZ,CAAA;AAEA,IAAAW,SAAc,GAAGH,UAAQ;;AClBzB,IAAIA,QAAQ,GAAGF,SAAsB;AACjCM,EAAAA,QAAQ,GAAGC,qBAAqB;AAChCC,EAAAA,QAAQ,GAAGC,qBAAqB,CAAA;;AAEpC;AACA,IAAIC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAA;;AAEf;AACA,IAAIC,UAAU,GAAG,oBAAoB,CAAA;;AAErC;AACA,IAAIC,UAAU,GAAG,YAAY,CAAA;;AAE7B;AACA,IAAIC,SAAS,GAAG,aAAa,CAAA;;AAE7B;AACA,IAAIC,YAAY,GAAGC,QAAQ,CAAA;;AAE3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,QAAQA,CAACC,KAAK,EAAE;AACvB,EAAA,IAAI,OAAOA,KAAK,IAAI,QAAQ,EAAE;AAC5B,IAAA,OAAOA,KAAK,CAAA;AACb,GAAA;AACD,EAAA,IAAIT,QAAQ,CAACS,KAAK,CAAC,EAAE;AACnB,IAAA,OAAOP,GAAG,CAAA;AACX,GAAA;AACD,EAAA,IAAIJ,QAAQ,CAACW,KAAK,CAAC,EAAE;AACnB,IAAA,IAAIC,KAAK,GAAG,OAAOD,KAAK,CAACE,OAAO,IAAI,UAAU,GAAGF,KAAK,CAACE,OAAO,EAAE,GAAGF,KAAK,CAAA;IACxEA,KAAK,GAAGX,QAAQ,CAACY,KAAK,CAAC,GAAIA,KAAK,GAAG,EAAE,GAAIA,KAAK,CAAA;AAC/C,GAAA;AACD,EAAA,IAAI,OAAOD,KAAK,IAAI,QAAQ,EAAE;AAC5B,IAAA,OAAOA,KAAK,KAAK,CAAC,GAAGA,KAAK,GAAG,CAACA,KAAK,CAAA;AACpC,GAAA;AACDA,EAAAA,KAAK,GAAGf,QAAQ,CAACe,KAAK,CAAC,CAAA;AACvB,EAAA,IAAIG,QAAQ,GAAGR,UAAU,CAACf,IAAI,CAACoB,KAAK,CAAC,CAAA;AACrC,EAAA,OAAQG,QAAQ,IAAIP,SAAS,CAAChB,IAAI,CAACoB,KAAK,CAAC,GACrCH,YAAY,CAACG,KAAK,CAACd,KAAK,CAAC,CAAC,CAAC,EAAEiB,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC,GAC7CT,UAAU,CAACd,IAAI,CAACoB,KAAK,CAAC,GAAGP,GAAG,GAAG,CAACO,KAAM,CAAA;AAC7C,CAAA;AAEAI,IAAAA,UAAc,GAAGL;;;;"}

package/cjs/_chunks/dep-ed945294.js

@@ -0,0 +1,20 @@
+/**
+ * tdesign v1.5.6-alpha.3
+ * (c) 2024 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+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);
+}
+
+exports._typeof = _typeof;
+//# sourceMappingURL=dep-ed945294.js.map

package/cjs/_chunks/dep-ed945294.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-ed945294.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,OAAOA,CAACC,GAAG,EAAE;EACnC,yBAAyB,CAAA;;AAEzB,EAAA,OAAOD,OAAO,GAAG,UAAU,IAAI,OAAOE,MAAM,IAAI,QAAQ,IAAI,OAAOA,MAAM,CAACC,QAAQ,GAAG,UAAUF,GAAG,EAAE;AAClG,IAAA,OAAO,OAAOA,GAAG,CAAA;GAClB,GAAG,UAAUA,GAAG,EAAE;IACjB,OAAOA,GAAG,IAAI,UAAU,IAAI,OAAOC,MAAM,IAAID,GAAG,CAACG,WAAW,KAAKF,MAAM,IAAID,GAAG,KAAKC,MAAM,CAACG,SAAS,GAAG,QAAQ,GAAG,OAAOJ,GAAG,CAAA;AAC7H,GAAC,EAAED,OAAO,CAACC,GAAG,CAAC,CAAA;AACjB;;;;"}

package/cjs/_chunks/dep-f02c7339.js

@@ -0,0 +1,173 @@
+/**
+ * tdesign v1.5.6-alpha.2
+ * (c) 2024 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var _arrayFilter = require('./dep-eaa123c1.js');
+var _baseRest = require('./dep-9581147a.js');
+var _baseDifference = require('./dep-e98eb681.js');
+var _baseFlatten = require('./dep-dfc24a2a.js');
+var _cacheHas = require('./dep-ca11638b.js');
+var _Set = require('./dep-7f9ee808.js');
+var noop$1 = require('./dep-00de794e.js');
+var _setToArray = require('./dep-c131e34e.js');
+var last$1 = require('./dep-1445c5fd.js');
+
+var Set = _Set._Set,
+  noop = noop$1.noop_1,
+  setToArray$1 = _setToArray._setToArray;
+
+/** Used as references for various `Number` constants. */
+var INFINITY = 1 / 0;
+
+/**
+ * Creates a set object of `values`.
+ *
+ * @private
+ * @param {Array} values The values to add to the set.
+ * @returns {Object} Returns the new set.
+ */
+var createSet$1 = !(Set && 1 / setToArray$1(new Set([, -0]))[1] == INFINITY) ? noop : function (values) {
+  return new Set(values);
+};
+var _createSet = createSet$1;
+
+var SetCache = _cacheHas._SetCache,
+  arrayIncludes = _cacheHas._arrayIncludes,
+  arrayIncludesWith = _cacheHas._arrayIncludesWith,
+  cacheHas = _cacheHas._cacheHas,
+  createSet = _createSet,
+  setToArray = _setToArray._setToArray;
+
+/** Used as the size to enable large array optimizations. */
+var LARGE_ARRAY_SIZE = 200;
+
+/**
+ * The base implementation of `_.uniqBy` without support for iteratee shorthands.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {Function} [iteratee] The iteratee invoked per element.
+ * @param {Function} [comparator] The comparator invoked per element.
+ * @returns {Array} Returns the new duplicate free array.
+ */
+function baseUniq$1(array, iteratee, comparator) {
+  var index = -1,
+    includes = arrayIncludes,
+    length = array.length,
+    isCommon = true,
+    result = [],
+    seen = result;
+  if (comparator) {
+    isCommon = false;
+    includes = arrayIncludesWith;
+  } else if (length >= LARGE_ARRAY_SIZE) {
+    var set = iteratee ? null : createSet(array);
+    if (set) {
+      return setToArray(set);
+    }
+    isCommon = false;
+    includes = cacheHas;
+    seen = new SetCache();
+  } else {
+    seen = iteratee ? [] : result;
+  }
+  outer: while (++index < length) {
+    var value = array[index],
+      computed = iteratee ? iteratee(value) : value;
+    value = comparator || value !== 0 ? value : 0;
+    if (isCommon && computed === computed) {
+      var seenIndex = seen.length;
+      while (seenIndex--) {
+        if (seen[seenIndex] === computed) {
+          continue outer;
+        }
+      }
+      if (iteratee) {
+        seen.push(computed);
+      }
+      result.push(value);
+    } else if (!includes(seen, computed, comparator)) {
+      if (seen !== result) {
+        seen.push(computed);
+      }
+      result.push(value);
+    }
+  }
+  return result;
+}
+var _baseUniq = baseUniq$1;
+
+var baseDifference = _baseDifference._baseDifference,
+  baseFlatten = _baseFlatten._baseFlatten,
+  baseUniq = _baseUniq;
+
+/**
+ * The base implementation of methods like `_.xor`, 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 values.
+ */
+function baseXor$1(arrays, iteratee, comparator) {
+  var length = arrays.length;
+  if (length < 2) {
+    return length ? baseUniq(arrays[0]) : [];
+  }
+  var index = -1,
+    result = Array(length);
+  while (++index < length) {
+    var array = arrays[index],
+      othIndex = -1;
+    while (++othIndex < length) {
+      if (othIndex != index) {
+        result[index] = baseDifference(result[index] || array, arrays[othIndex], iteratee, comparator);
+      }
+    }
+  }
+  return baseUniq(baseFlatten(result, 1), iteratee, comparator);
+}
+var _baseXor = baseXor$1;
+
+var arrayFilter = _arrayFilter._arrayFilter,
+  baseRest = _baseRest._baseRest,
+  baseXor = _baseXor,
+  isArrayLikeObject = _baseRest.isArrayLikeObject_1,
+  last = last$1.last_1;
+
+/**
+ * This method is like `_.xor` except that it accepts `comparator` which is
+ * invoked to compare elements of `arrays`. The order of result values is
+ * determined by the order they occur in the arrays. The comparator is invoked
+ * with two arguments: (arrVal, othVal).
+ *
+ * @static
+ * @memberOf _
+ * @since 4.0.0
+ * @category Array
+ * @param {...Array} [arrays] The arrays to inspect.
+ * @param {Function} [comparator] The comparator invoked per element.
+ * @returns {Array} Returns the new array of filtered values.
+ * @example
+ *
+ * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];
+ * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];
+ *
+ * _.xorWith(objects, others, _.isEqual);
+ * // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]
+ */
+var xorWith = baseRest(function (arrays) {
+  var comparator = last(arrays);
+  comparator = typeof comparator == 'function' ? comparator : undefined;
+  return baseXor(arrayFilter(arrays, isArrayLikeObject), undefined, comparator);
+});
+var xorWith_1 = xorWith;
+
+exports.xorWith_1 = xorWith_1;
+//# sourceMappingURL=dep-f02c7339.js.map

package/cjs/_chunks/dep-f02c7339.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-f02c7339.js","sources":["../../node_modules/lodash/_createSet.js","../../node_modules/lodash/_baseUniq.js","../../node_modules/lodash/_baseXor.js","../../node_modules/lodash/xorWith.js"],"sourcesContent":["var Set = require('./_Set'),\n    noop = require('./noop'),\n    setToArray = require('./_setToArray');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/**\n * Creates a set object of `values`.\n *\n * @private\n * @param {Array} values The values to add to the set.\n * @returns {Object} Returns the new set.\n */\nvar createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n  return new Set(values);\n};\n\nmodule.exports = createSet;\n","var SetCache = require('./_SetCache'),\n    arrayIncludes = require('./_arrayIncludes'),\n    arrayIncludesWith = require('./_arrayIncludesWith'),\n    cacheHas = require('./_cacheHas'),\n    createSet = require('./_createSet'),\n    setToArray = require('./_setToArray');\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * The base implementation of `_.uniqBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array 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 duplicate free array.\n */\nfunction baseUniq(array, iteratee, comparator) {\n  var index = -1,\n      includes = arrayIncludes,\n      length = array.length,\n      isCommon = true,\n      result = [],\n      seen = result;\n\n  if (comparator) {\n    isCommon = false;\n    includes = arrayIncludesWith;\n  }\n  else if (length >= LARGE_ARRAY_SIZE) {\n    var set = iteratee ? null : createSet(array);\n    if (set) {\n      return setToArray(set);\n    }\n    isCommon = false;\n    includes = cacheHas;\n    seen = new SetCache;\n  }\n  else {\n    seen = iteratee ? [] : result;\n  }\n  outer:\n  while (++index < length) {\n    var value = array[index],\n        computed = iteratee ? iteratee(value) : value;\n\n    value = (comparator || value !== 0) ? value : 0;\n    if (isCommon && computed === computed) {\n      var seenIndex = seen.length;\n      while (seenIndex--) {\n        if (seen[seenIndex] === computed) {\n          continue outer;\n        }\n      }\n      if (iteratee) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n    else if (!includes(seen, computed, comparator)) {\n      if (seen !== result) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseUniq;\n","var baseDifference = require('./_baseDifference'),\n    baseFlatten = require('./_baseFlatten'),\n    baseUniq = require('./_baseUniq');\n\n/**\n * The base implementation of methods like `_.xor`, without support for\n * 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 values.\n */\nfunction baseXor(arrays, iteratee, comparator) {\n  var length = arrays.length;\n  if (length < 2) {\n    return length ? baseUniq(arrays[0]) : [];\n  }\n  var index = -1,\n      result = Array(length);\n\n  while (++index < length) {\n    var array = arrays[index],\n        othIndex = -1;\n\n    while (++othIndex < length) {\n      if (othIndex != index) {\n        result[index] = baseDifference(result[index] || array, arrays[othIndex], iteratee, comparator);\n      }\n    }\n  }\n  return baseUniq(baseFlatten(result, 1), iteratee, comparator);\n}\n\nmodule.exports = baseXor;\n","var arrayFilter = require('./_arrayFilter'),\n    baseRest = require('./_baseRest'),\n    baseXor = require('./_baseXor'),\n    isArrayLikeObject = require('./isArrayLikeObject'),\n    last = require('./last');\n\n/**\n * This method is like `_.xor` except that it accepts `comparator` which is\n * invoked to compare elements of `arrays`. The order of result values is\n * determined by the order they occur in the arrays. The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.xorWith(objects, others, _.isEqual);\n * // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n */\nvar xorWith = baseRest(function(arrays) {\n  var comparator = last(arrays);\n  comparator = typeof comparator == 'function' ? comparator : undefined;\n  return baseXor(arrayFilter(arrays, isArrayLikeObject), undefined, comparator);\n});\n\nmodule.exports = xorWith;\n"],"names":["Set","require$$0","noop","require$$1","setToArray","require$$2","INFINITY","createSet","values","_createSet","SetCache","arrayIncludes","arrayIncludesWith","cacheHas","require$$3","require$$4","require$$5","LARGE_ARRAY_SIZE","baseUniq","array","iteratee","comparator","index","includes","length","isCommon","result","seen","set","outer","value","computed","seenIndex","push","_baseUniq","baseDifference","baseFlatten","baseXor","arrays","Array","othIndex","_baseXor","arrayFilter","baseRest","isArrayLikeObject","last","xorWith","undefined","xorWith_1"],"mappings":";;;;;;;;;;;;;;;;;;AAAA,IAAIA,GAAG,GAAGC,SAAiB;AACvBC,EAAAA,IAAI,GAAGC,aAAiB;AACxBC,EAAAA,YAAU,GAAGC,uBAAwB,CAAA;;AAEzC;AACA,IAAIC,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAA;;AAEpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAIC,WAAS,GAAG,EAAEP,GAAG,IAAK,CAAC,GAAGI,YAAU,CAAC,IAAIJ,GAAG,CAAC,GAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAKM,QAAQ,CAAC,GAAGJ,IAAI,GAAG,UAASM,MAAM,EAAE;AAClG,EAAA,OAAO,IAAIR,GAAG,CAACQ,MAAM,CAAC,CAAA;AACxB,CAAC,CAAA;AAED,IAAAC,UAAc,GAAGF,WAAS;;AClB1B,IAAIG,QAAQ,GAAGT,mBAAsB;AACjCU,EAAAA,aAAa,GAAGR,wBAA2B;AAC3CS,EAAAA,iBAAiB,GAAGP,4BAA+B;AACnDQ,EAAAA,QAAQ,GAAGC,mBAAsB;AACjCP,EAAAA,SAAS,GAAGQ,UAAuB;AACnCX,EAAAA,UAAU,GAAGY,uBAAwB,CAAA;;AAEzC;AACA,IAAIC,gBAAgB,GAAG,GAAG,CAAA;;AAE1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,UAAQA,CAACC,KAAK,EAAEC,QAAQ,EAAEC,UAAU,EAAE;EAC7C,IAAIC,KAAK,GAAG,CAAC,CAAC;AACVC,IAAAA,QAAQ,GAAGZ,aAAa;IACxBa,MAAM,GAAGL,KAAK,CAACK,MAAM;AACrBC,IAAAA,QAAQ,GAAG,IAAI;AACfC,IAAAA,MAAM,GAAG,EAAE;AACXC,IAAAA,IAAI,GAAGD,MAAM,CAAA;AAEjB,EAAA,IAAIL,UAAU,EAAE;AACdI,IAAAA,QAAQ,GAAG,KAAK,CAAA;AAChBF,IAAAA,QAAQ,GAAGX,iBAAiB,CAAA;AAC7B,GAAA,MACI,IAAIY,MAAM,IAAIP,gBAAgB,EAAE;IACnC,IAAIW,GAAG,GAAGR,QAAQ,GAAG,IAAI,GAAGb,SAAS,CAACY,KAAK,CAAC,CAAA;AAC5C,IAAA,IAAIS,GAAG,EAAE;MACP,OAAOxB,UAAU,CAACwB,GAAG,CAAC,CAAA;AACvB,KAAA;AACDH,IAAAA,QAAQ,GAAG,KAAK,CAAA;AAChBF,IAAAA,QAAQ,GAAGV,QAAQ,CAAA;AACnBc,IAAAA,IAAI,GAAG,IAAIjB,QAAQ,EAAA,CAAA;AACpB,GAAA,MACI;AACHiB,IAAAA,IAAI,GAAGP,QAAQ,GAAG,EAAE,GAAGM,MAAM,CAAA;AAC9B,GAAA;AACDG,EAAAA,KAAK,EACL,OAAO,EAAEP,KAAK,GAAGE,MAAM,EAAE;AACvB,IAAA,IAAIM,KAAK,GAAGX,KAAK,CAACG,KAAK,CAAC;MACpBS,QAAQ,GAAGX,QAAQ,GAAGA,QAAQ,CAACU,KAAK,CAAC,GAAGA,KAAK,CAAA;IAEjDA,KAAK,GAAIT,UAAU,IAAIS,KAAK,KAAK,CAAC,GAAIA,KAAK,GAAG,CAAC,CAAA;AAC/C,IAAA,IAAIL,QAAQ,IAAIM,QAAQ,KAAKA,QAAQ,EAAE;AACrC,MAAA,IAAIC,SAAS,GAAGL,IAAI,CAACH,MAAM,CAAA;MAC3B,OAAOQ,SAAS,EAAE,EAAE;AAClB,QAAA,IAAIL,IAAI,CAACK,SAAS,CAAC,KAAKD,QAAQ,EAAE;AAChC,UAAA,SAASF,KAAK,CAAA;AACf,SAAA;AACF,OAAA;AACD,MAAA,IAAIT,QAAQ,EAAE;AACZO,QAAAA,IAAI,CAACM,IAAI,CAACF,QAAQ,CAAC,CAAA;AACpB,OAAA;AACDL,MAAAA,MAAM,CAACO,IAAI,CAACH,KAAK,CAAC,CAAA;KACnB,MACI,IAAI,CAACP,QAAQ,CAACI,IAAI,EAAEI,QAAQ,EAAEV,UAAU,CAAC,EAAE;MAC9C,IAAIM,IAAI,KAAKD,MAAM,EAAE;AACnBC,QAAAA,IAAI,CAACM,IAAI,CAACF,QAAQ,CAAC,CAAA;AACpB,OAAA;AACDL,MAAAA,MAAM,CAACO,IAAI,CAACH,KAAK,CAAC,CAAA;AACnB,KAAA;AACF,GAAA;AACD,EAAA,OAAOJ,MAAM,CAAA;AACf,CAAA;AAEA,IAAAQ,SAAc,GAAGhB,UAAQ;;ACvEzB,IAAIiB,cAAc,GAAGlC,+BAA4B;AAC7CmC,EAAAA,WAAW,GAAGjC,yBAAyB;AACvCe,EAAAA,QAAQ,GAAGb,SAAsB,CAAA;;AAErC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASgC,SAAOA,CAACC,MAAM,EAAElB,QAAQ,EAAEC,UAAU,EAAE;AAC7C,EAAA,IAAIG,MAAM,GAAGc,MAAM,CAACd,MAAM,CAAA;EAC1B,IAAIA,MAAM,GAAG,CAAC,EAAE;IACd,OAAOA,MAAM,GAAGN,QAAQ,CAACoB,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAA;AACzC,GAAA;EACD,IAAIhB,KAAK,GAAG,CAAC,CAAC;AACVI,IAAAA,MAAM,GAAGa,KAAK,CAACf,MAAM,CAAC,CAAA;AAE1B,EAAA,OAAO,EAAEF,KAAK,GAAGE,MAAM,EAAE;AACvB,IAAA,IAAIL,KAAK,GAAGmB,MAAM,CAAChB,KAAK,CAAC;MACrBkB,QAAQ,GAAG,CAAC,CAAC,CAAA;AAEjB,IAAA,OAAO,EAAEA,QAAQ,GAAGhB,MAAM,EAAE;MAC1B,IAAIgB,QAAQ,IAAIlB,KAAK,EAAE;QACrBI,MAAM,CAACJ,KAAK,CAAC,GAAGa,cAAc,CAACT,MAAM,CAACJ,KAAK,CAAC,IAAIH,KAAK,EAAEmB,MAAM,CAACE,QAAQ,CAAC,EAAEpB,QAAQ,EAAEC,UAAU,CAAC,CAAA;AAC/F,OAAA;AACF,KAAA;AACF,GAAA;AACD,EAAA,OAAOH,QAAQ,CAACkB,WAAW,CAACV,MAAM,EAAE,CAAC,CAAC,EAAEN,QAAQ,EAAEC,UAAU,CAAC,CAAA;AAC/D,CAAA;AAEA,IAAAoB,QAAc,GAAGJ,SAAO;;ACnCxB,IAAIK,WAAW,GAAGzC,yBAAyB;AACvC0C,EAAAA,QAAQ,GAAGxC,mBAAsB;AACjCkC,EAAAA,OAAO,GAAGhC,QAAqB;AAC/BuC,EAAAA,iBAAiB,GAAG9B,6BAA8B;AAClD+B,EAAAA,IAAI,GAAG9B,aAAiB,CAAA;;AAE5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI+B,OAAO,GAAGH,QAAQ,CAAC,UAASL,MAAM,EAAE;AACtC,EAAA,IAAIjB,UAAU,GAAGwB,IAAI,CAACP,MAAM,CAAC,CAAA;EAC7BjB,UAAU,GAAG,OAAOA,UAAU,IAAI,UAAU,GAAGA,UAAU,GAAG0B,SAAS,CAAA;AACrE,EAAA,OAAOV,OAAO,CAACK,WAAW,CAACJ,MAAM,EAAEM,iBAAiB,CAAC,EAAEG,SAAS,EAAE1B,UAAU,CAAC,CAAA;AAC/E,CAAC,CAAC,CAAA;AAEF2B,IAAAA,SAAc,GAAGF;;;;"}

package/cjs/_chunks/dep-f08845dc.js

@@ -0,0 +1,32 @@
+/**
+ * tdesign v1.5.6-alpha.3
+ * (c) 2024 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+/**
+ * Checks if `value` is `null`.
+ *
+ * @static
+ * @memberOf _
+ * @since 0.1.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is `null`, else `false`.
+ * @example
+ *
+ * _.isNull(null);
+ * // => true
+ *
+ * _.isNull(void 0);
+ * // => false
+ */
+function isNull(value) {
+  return value === null;
+}
+var isNull_1 = isNull;
+
+exports.isNull_1 = isNull_1;
+//# sourceMappingURL=dep-f08845dc.js.map

package/cjs/_chunks/dep-f08845dc.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-f08845dc.js","sources":["../../node_modules/lodash/isNull.js"],"sourcesContent":["/**\n * Checks if `value` is `null`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `null`, else `false`.\n * @example\n *\n * _.isNull(null);\n * // => true\n *\n * _.isNull(void 0);\n * // => false\n */\nfunction isNull(value) {\n  return value === null;\n}\n\nmodule.exports = isNull;\n"],"names":["isNull","value","isNull_1"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;AAiBA,SAASA,MAAMA,CAACC,KAAK,EAAE;EACrB,OAAOA,KAAK,KAAK,IAAI,CAAA;AACvB,CAAA;AAEAC,IAAAA,QAAc,GAAGF;;;;"}