tdesign-react 0.25.1 → 0.26.0

package/es/_chunks/dep-8d8a59c5.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-8d8a59c5.js","sources":["../../node_modules/lodash/_isKey.js","../../node_modules/lodash/memoize.js","../../node_modules/lodash/_memoizeCapped.js","../../node_modules/lodash/_stringToPath.js","../../node_modules/lodash/_castPath.js","../../node_modules/lodash/_toKey.js","../../node_modules/lodash/_baseGet.js"],"sourcesContent":["var isArray = require('./isArray'),\n    isSymbol = require('./isSymbol');\n\n/** Used to match property names within property paths. */\nvar reIsDeepProp = /\\.|\\[(?:[^[\\]]*|([\"'])(?:(?!\\1)[^\\\\]|\\\\.)*?\\1)\\]/,\n    reIsPlainProp = /^\\w*$/;\n\n/**\n * Checks if `value` is a property name and not a property path.\n *\n * @private\n * @param {*} value The value to check.\n * @param {Object} [object] The object to query keys on.\n * @returns {boolean} Returns `true` if `value` is a property name, else `false`.\n */\nfunction isKey(value, object) {\n  if (isArray(value)) {\n    return false;\n  }\n  var type = typeof value;\n  if (type == 'number' || type == 'symbol' || type == 'boolean' ||\n      value == null || isSymbol(value)) {\n    return true;\n  }\n  return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||\n    (object != null && value in Object(object));\n}\n\nmodule.exports = isKey;\n","var MapCache = require('./_MapCache');\n\n/** Error message constants. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/**\n * Creates a function that memoizes the result of `func`. If `resolver` is\n * provided, it determines the cache key for storing the result based on the\n * arguments provided to the memoized function. By default, the first argument\n * provided to the memoized function is used as the map cache key. The `func`\n * is invoked with the `this` binding of the memoized function.\n *\n * **Note:** The cache is exposed as the `cache` property on the memoized\n * function. Its creation may be customized by replacing the `_.memoize.Cache`\n * constructor with one whose instances implement the\n * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)\n * method interface of `clear`, `delete`, `get`, `has`, and `set`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to have its output memoized.\n * @param {Function} [resolver] The function to resolve the cache key.\n * @returns {Function} Returns the new memoized function.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n * var other = { 'c': 3, 'd': 4 };\n *\n * var values = _.memoize(_.values);\n * values(object);\n * // => [1, 2]\n *\n * values(other);\n * // => [3, 4]\n *\n * object.a = 2;\n * values(object);\n * // => [1, 2]\n *\n * // Modify the result cache.\n * values.cache.set(object, ['a', 'b']);\n * values(object);\n * // => ['a', 'b']\n *\n * // Replace `_.memoize.Cache`.\n * _.memoize.Cache = WeakMap;\n */\nfunction memoize(func, resolver) {\n  if (typeof func != 'function' || (resolver != null && typeof resolver != 'function')) {\n    throw new TypeError(FUNC_ERROR_TEXT);\n  }\n  var memoized = function() {\n    var args = arguments,\n        key = resolver ? resolver.apply(this, args) : args[0],\n        cache = memoized.cache;\n\n    if (cache.has(key)) {\n      return cache.get(key);\n    }\n    var result = func.apply(this, args);\n    memoized.cache = cache.set(key, result) || cache;\n    return result;\n  };\n  memoized.cache = new (memoize.Cache || MapCache);\n  return memoized;\n}\n\n// Expose `MapCache`.\nmemoize.Cache = MapCache;\n\nmodule.exports = memoize;\n","var memoize = require('./memoize');\n\n/** Used as the maximum memoize cache size. */\nvar MAX_MEMOIZE_SIZE = 500;\n\n/**\n * A specialized version of `_.memoize` which clears the memoized function's\n * cache when it exceeds `MAX_MEMOIZE_SIZE`.\n *\n * @private\n * @param {Function} func The function to have its output memoized.\n * @returns {Function} Returns the new memoized function.\n */\nfunction memoizeCapped(func) {\n  var result = memoize(func, function(key) {\n    if (cache.size === MAX_MEMOIZE_SIZE) {\n      cache.clear();\n    }\n    return key;\n  });\n\n  var cache = result.cache;\n  return result;\n}\n\nmodule.exports = memoizeCapped;\n","var memoizeCapped = require('./_memoizeCapped');\n\n/** Used to match property names within property paths. */\nvar rePropName = /[^.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|$))/g;\n\n/** Used to match backslashes in property paths. */\nvar reEscapeChar = /\\\\(\\\\)?/g;\n\n/**\n * Converts `string` to a property path array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the property path array.\n */\nvar stringToPath = memoizeCapped(function(string) {\n  var result = [];\n  if (string.charCodeAt(0) === 46 /* . */) {\n    result.push('');\n  }\n  string.replace(rePropName, function(match, number, quote, subString) {\n    result.push(quote ? subString.replace(reEscapeChar, '$1') : (number || match));\n  });\n  return result;\n});\n\nmodule.exports = stringToPath;\n","var isArray = require('./isArray'),\n    isKey = require('./_isKey'),\n    stringToPath = require('./_stringToPath'),\n    toString = require('./toString');\n\n/**\n * Casts `value` to a path array if it's not one.\n *\n * @private\n * @param {*} value The value to inspect.\n * @param {Object} [object] The object to query keys on.\n * @returns {Array} Returns the cast property path array.\n */\nfunction castPath(value, object) {\n  if (isArray(value)) {\n    return value;\n  }\n  return isKey(value, object) ? [value] : stringToPath(toString(value));\n}\n\nmodule.exports = castPath;\n","var isSymbol = require('./isSymbol');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/**\n * Converts `value` to a string key if it's not a string or symbol.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {string|symbol} Returns the key.\n */\nfunction toKey(value) {\n  if (typeof value == 'string' || isSymbol(value)) {\n    return value;\n  }\n  var result = (value + '');\n  return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\nmodule.exports = toKey;\n","var castPath = require('./_castPath'),\n    toKey = require('./_toKey');\n\n/**\n * The base implementation of `_.get` without support for default values.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @returns {*} Returns the resolved value.\n */\nfunction baseGet(object, path) {\n  path = castPath(path, object);\n\n  var index = 0,\n      length = path.length;\n\n  while (object != null && index < length) {\n    object = object[toKey(path[index++])];\n  }\n  return (index && index == length) ? object : undefined;\n}\n\nmodule.exports = baseGet;\n"],"names":["isArray","require$$0","isSymbol","require$$1","reIsDeepProp","reIsPlainProp","isKey","value","object","type","test","Object","_isKey","MapCache","FUNC_ERROR_TEXT","memoize","func","resolver","TypeError","memoized","args","arguments","key","apply","cache","has","get","result","set","Cache","memoize_1","MAX_MEMOIZE_SIZE","memoizeCapped","size","clear","_memoizeCapped","rePropName","reEscapeChar","stringToPath","string","charCodeAt","push","replace","match","number","quote","subString","_stringToPath","require$$2","toString","require$$3","castPath","_castPath","INFINITY","toKey","_toKey","baseGet","path","index","length","undefined","_baseGet"],"mappings":";;;;;;;;;;;;;;AAAA,IAAIA,SAAO,GAAGC,SAAd;AAAA,IACIC,UAAQ,GAAGC,UADf;AAGA;;AACA,IAAIC,YAAY,GAAG,kDAAnB;AAAA,IACIC,aAAa,GAAG,OADpB;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,OAAT,CAAeC,KAAf,EAAsBC,MAAtB,EAA8B;AAC5B,MAAIR,SAAO,CAACO,KAAD,CAAX,EAAoB;AAClB,WAAO,KAAP;AACD;;AACD,MAAIE,IAAI,WAAUF,KAAV,CAAR;;AACA,MAAIE,IAAI,IAAI,QAAR,IAAoBA,IAAI,IAAI,QAA5B,IAAwCA,IAAI,IAAI,SAAhD,IACAF,KAAK,IAAI,IADT,IACiBL,UAAQ,CAACK,KAAD,CAD7B,EACsC;AACpC,WAAO,IAAP;AACD;;AACD,SAAOF,aAAa,CAACK,IAAd,CAAmBH,KAAnB,KAA6B,CAACH,YAAY,CAACM,IAAb,CAAkBH,KAAlB,CAA9B,IACJC,MAAM,IAAI,IAAV,IAAkBD,KAAK,IAAII,MAAM,CAACH,MAAD,CADpC;AAED;;IAEDI,MAAc,GAAGN;;AC5BjB,IAAIO,QAAQ,GAAGZ,SAAf;AAEA;;AACA,IAAIa,eAAe,GAAG,qBAAtB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,SAAT,CAAiBC,IAAjB,EAAuBC,QAAvB,EAAiC;AAC/B,MAAI,OAAOD,IAAP,IAAe,UAAf,IAA8BC,QAAQ,IAAI,IAAZ,IAAoB,OAAOA,QAAP,IAAmB,UAAzE,EAAsF;AACpF,UAAM,IAAIC,SAAJ,CAAcJ,eAAd,CAAN;AACD;;AACD,MAAIK,QAAQ,GAAG,SAAXA,QAAW,GAAW;AACxB,QAAIC,IAAI,GAAGC,SAAX;AAAA,QACIC,GAAG,GAAGL,QAAQ,GAAGA,QAAQ,CAACM,KAAT,CAAe,IAAf,EAAqBH,IAArB,CAAH,GAAgCA,IAAI,CAAC,CAAD,CADtD;AAAA,QAEII,KAAK,GAAGL,QAAQ,CAACK,KAFrB;;AAIA,QAAIA,KAAK,CAACC,GAAN,CAAUH,GAAV,CAAJ,EAAoB;AAClB,aAAOE,KAAK,CAACE,GAAN,CAAUJ,GAAV,CAAP;AACD;;AACD,QAAIK,MAAM,GAAGX,IAAI,CAACO,KAAL,CAAW,IAAX,EAAiBH,IAAjB,CAAb;AACAD,IAAAA,QAAQ,CAACK,KAAT,GAAiBA,KAAK,CAACI,GAAN,CAAUN,GAAV,EAAeK,MAAf,KAA0BH,KAA3C;AACA,WAAOG,MAAP;AACD,GAXD;;AAYAR,EAAAA,QAAQ,CAACK,KAAT,GAAiB,KAAKT,SAAO,CAACc,KAAR,IAAiBhB,QAAtB,GAAjB;AACA,SAAOM,QAAP;AACD;;;AAGDJ,SAAO,CAACc,KAAR,GAAgBhB,QAAhB;IAEAiB,SAAc,GAAGf;;ACxEjB,IAAIA,OAAO,GAAGd,SAAd;AAEA;;AACA,IAAI8B,gBAAgB,GAAG,GAAvB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,eAAT,CAAuBhB,IAAvB,EAA6B;AAC3B,MAAIW,MAAM,GAAGZ,OAAO,CAACC,IAAD,EAAO,UAASM,GAAT,EAAc;AACvC,QAAIE,KAAK,CAACS,IAAN,KAAeF,gBAAnB,EAAqC;AACnCP,MAAAA,KAAK,CAACU,KAAN;AACD;;AACD,WAAOZ,GAAP;AACD,GALmB,CAApB;AAOA,MAAIE,KAAK,GAAGG,MAAM,CAACH,KAAnB;AACA,SAAOG,MAAP;AACD;;IAEDQ,cAAc,GAAGH;;ACzBjB,IAAIA,aAAa,GAAG/B,cAApB;AAEA;;AACA,IAAImC,UAAU,GAAG,kGAAjB;AAEA;;AACA,IAAIC,YAAY,GAAG,UAAnB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,IAAIC,cAAY,GAAGN,aAAa,CAAC,UAASO,MAAT,EAAiB;AAChD,MAAIZ,MAAM,GAAG,EAAb;;AACA,MAAIY,MAAM,CAACC,UAAP,CAAkB,CAAlB,MAAyB;;AAA7B,IAAyC;AACvCb,IAAAA,MAAM,CAACc,IAAP,CAAY,EAAZ;AACD;;AACDF,EAAAA,MAAM,CAACG,OAAP,CAAeN,UAAf,EAA2B,UAASO,KAAT,EAAgBC,MAAhB,EAAwBC,KAAxB,EAA+BC,SAA/B,EAA0C;AACnEnB,IAAAA,MAAM,CAACc,IAAP,CAAYI,KAAK,GAAGC,SAAS,CAACJ,OAAV,CAAkBL,YAAlB,EAAgC,IAAhC,CAAH,GAA4CO,MAAM,IAAID,KAAvE;AACD,GAFD;AAGA,SAAOhB,MAAP;AACD,CAT+B,CAAhC;IAWAoB,aAAc,GAAGT;;AC1BjB,IAAItC,OAAO,GAAGC,SAAd;AAAA,IACIK,KAAK,GAAGH,MADZ;AAAA,IAEImC,YAAY,GAAGU,aAFnB;AAAA,IAGIC,QAAQ,GAAGC,UAHf;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,UAAT,CAAkB5C,KAAlB,EAAyBC,MAAzB,EAAiC;AAC/B,MAAIR,OAAO,CAACO,KAAD,CAAX,EAAoB;AAClB,WAAOA,KAAP;AACD;;AACD,SAAOD,KAAK,CAACC,KAAD,EAAQC,MAAR,CAAL,GAAuB,CAACD,KAAD,CAAvB,GAAiC+B,YAAY,CAACW,QAAQ,CAAC1C,KAAD,CAAT,CAApD;AACD;;IAED6C,SAAc,GAAGD;;ACpBjB,IAAIjD,QAAQ,GAAGD,UAAf;AAEA;;AACA,IAAIoD,QAAQ,GAAG,IAAI,CAAnB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,OAAT,CAAe/C,KAAf,EAAsB;AACpB,MAAI,OAAOA,KAAP,IAAgB,QAAhB,IAA4BL,QAAQ,CAACK,KAAD,CAAxC,EAAiD;AAC/C,WAAOA,KAAP;AACD;;AACD,MAAIoB,MAAM,GAAIpB,KAAK,GAAG,EAAtB;AACA,SAAQoB,MAAM,IAAI,GAAV,IAAkB,IAAIpB,KAAL,IAAe,CAAC8C,QAAlC,GAA8C,IAA9C,GAAqD1B,MAA5D;AACD;;IAED4B,MAAc,GAAGD;;ACpBjB,IAAIH,QAAQ,GAAGlD,SAAf;AAAA,IACIqD,KAAK,GAAGnD,MADZ;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASqD,OAAT,CAAiBhD,MAAjB,EAAyBiD,IAAzB,EAA+B;AAC7BA,EAAAA,IAAI,GAAGN,QAAQ,CAACM,IAAD,EAAOjD,MAAP,CAAf;AAEA,MAAIkD,KAAK,GAAG,CAAZ;AAAA,MACIC,MAAM,GAAGF,IAAI,CAACE,MADlB;;AAGA,SAAOnD,MAAM,IAAI,IAAV,IAAkBkD,KAAK,GAAGC,MAAjC,EAAyC;AACvCnD,IAAAA,MAAM,GAAGA,MAAM,CAAC8C,KAAK,CAACG,IAAI,CAACC,KAAK,EAAN,CAAL,CAAN,CAAf;AACD;;AACD,SAAQA,KAAK,IAAIA,KAAK,IAAIC,MAAnB,GAA6BnD,MAA7B,GAAsCoD,SAA7C;AACD;;IAEDC,QAAc,GAAGL;;;;"}

package/es/_chunks/dep-8fea0649.js

@@ -0,0 +1,509 @@
+/**
+ * tdesign v0.26.0
+ * (c) 2022 tdesign
+ * @license MIT
+ */
+
+import './dep-c5e6a539.js';
+import { f as _ListCache, b as _MapCache, e as _assignValue, _ as _baseAssignValue } from './dep-4506ade7.js';
+import { a as _Map, i as isArguments_1 } from './dep-96268fc3.js';
+import { b as _root } from './dep-76bc9a8e.js';
+import { a as isObject_1 } from './dep-08a538d7.js';
+import { b as _getPrototype } from './dep-6ef661cb.js';
+import { b as _isPrototype, i as isBuffer$1, a as isTypedArray_1 } from './dep-5e81ed02.js';
+import { i as isArray_1 } from './dep-d945c24c.js';
+import './dep-43841bc9.js';
+import { _ as _isIndex } from './dep-f81e5642.js';
+import { i as isArrayLike_1 } from './dep-a3b25bd0.js';
+
+var ListCache$2 = _ListCache;
+/**
+ * Removes all key-value entries from the stack.
+ *
+ * @private
+ * @name clear
+ * @memberOf Stack
+ */
+
+function stackClear$1() {
+  this.__data__ = new ListCache$2();
+  this.size = 0;
+}
+
+var _stackClear = stackClear$1;
+
+/**
+ * Removes `key` and its value from the stack.
+ *
+ * @private
+ * @name delete
+ * @memberOf Stack
+ * @param {string} key The key of the value to remove.
+ * @returns {boolean} Returns `true` if the entry was removed, else `false`.
+ */
+
+function stackDelete$1(key) {
+  var data = this.__data__,
+      result = data['delete'](key);
+  this.size = data.size;
+  return result;
+}
+
+var _stackDelete = stackDelete$1;
+
+/**
+ * Gets the stack value for `key`.
+ *
+ * @private
+ * @name get
+ * @memberOf Stack
+ * @param {string} key The key of the value to get.
+ * @returns {*} Returns the entry value.
+ */
+
+function stackGet$1(key) {
+  return this.__data__.get(key);
+}
+
+var _stackGet = stackGet$1;
+
+/**
+ * Checks if a stack value for `key` exists.
+ *
+ * @private
+ * @name has
+ * @memberOf Stack
+ * @param {string} key The key of the entry to check.
+ * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+ */
+
+function stackHas$1(key) {
+  return this.__data__.has(key);
+}
+
+var _stackHas = stackHas$1;
+
+var ListCache$1 = _ListCache,
+    Map = _Map,
+    MapCache = _MapCache;
+/** Used as the size to enable large array optimizations. */
+
+var LARGE_ARRAY_SIZE = 200;
+/**
+ * Sets the stack `key` to `value`.
+ *
+ * @private
+ * @name set
+ * @memberOf Stack
+ * @param {string} key The key of the value to set.
+ * @param {*} value The value to set.
+ * @returns {Object} Returns the stack cache instance.
+ */
+
+function stackSet$1(key, value) {
+  var data = this.__data__;
+
+  if (data instanceof ListCache$1) {
+    var pairs = data.__data__;
+
+    if (!Map || pairs.length < LARGE_ARRAY_SIZE - 1) {
+      pairs.push([key, value]);
+      this.size = ++data.size;
+      return this;
+    }
+
+    data = this.__data__ = new MapCache(pairs);
+  }
+
+  data.set(key, value);
+  this.size = data.size;
+  return this;
+}
+
+var _stackSet = stackSet$1;
+
+var ListCache = _ListCache,
+    stackClear = _stackClear,
+    stackDelete = _stackDelete,
+    stackGet = _stackGet,
+    stackHas = _stackHas,
+    stackSet = _stackSet;
+/**
+ * Creates a stack cache object to store key-value pairs.
+ *
+ * @private
+ * @constructor
+ * @param {Array} [entries] The key-value pairs to cache.
+ */
+
+function Stack(entries) {
+  var data = this.__data__ = new ListCache(entries);
+  this.size = data.size;
+} // Add methods to `Stack`.
+
+
+Stack.prototype.clear = stackClear;
+Stack.prototype['delete'] = stackDelete;
+Stack.prototype.get = stackGet;
+Stack.prototype.has = stackHas;
+Stack.prototype.set = stackSet;
+var _Stack = Stack;
+
+var _cloneBuffer$1 = {exports: {}};
+
+(function (module, exports) {
+  var root = _root;
+  /** Detect free variable `exports`. */
+
+  var freeExports = 'object' == 'object' && exports && !exports.nodeType && exports;
+  /** Detect free variable `module`. */
+
+  var freeModule = freeExports && 'object' == 'object' && module && !module.nodeType && module;
+  /** Detect the popular CommonJS extension `module.exports`. */
+
+  var moduleExports = freeModule && freeModule.exports === freeExports;
+  /** Built-in value references. */
+
+  var Buffer = moduleExports ? root.Buffer : undefined,
+      allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined;
+  /**
+   * Creates a clone of  `buffer`.
+   *
+   * @private
+   * @param {Buffer} buffer The buffer to clone.
+   * @param {boolean} [isDeep] Specify a deep clone.
+   * @returns {Buffer} Returns the cloned buffer.
+   */
+
+  function cloneBuffer(buffer, isDeep) {
+    if (isDeep) {
+      return buffer.slice();
+    }
+
+    var length = buffer.length,
+        result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);
+    buffer.copy(result);
+    return result;
+  }
+
+  module.exports = cloneBuffer;
+})(_cloneBuffer$1, _cloneBuffer$1.exports);
+
+var _cloneBuffer = _cloneBuffer$1.exports;
+
+var root = _root;
+/** Built-in value references. */
+
+var Uint8Array$1 = root.Uint8Array;
+var _Uint8Array = Uint8Array$1;
+
+var Uint8Array = _Uint8Array;
+/**
+ * Creates a clone of `arrayBuffer`.
+ *
+ * @private
+ * @param {ArrayBuffer} arrayBuffer The array buffer to clone.
+ * @returns {ArrayBuffer} Returns the cloned array buffer.
+ */
+
+function cloneArrayBuffer$1(arrayBuffer) {
+  var result = new arrayBuffer.constructor(arrayBuffer.byteLength);
+  new Uint8Array(result).set(new Uint8Array(arrayBuffer));
+  return result;
+}
+
+var _cloneArrayBuffer = cloneArrayBuffer$1;
+
+var cloneArrayBuffer = _cloneArrayBuffer;
+/**
+ * Creates a clone of `typedArray`.
+ *
+ * @private
+ * @param {Object} typedArray The typed array to clone.
+ * @param {boolean} [isDeep] Specify a deep clone.
+ * @returns {Object} Returns the cloned typed array.
+ */
+
+function cloneTypedArray(typedArray, isDeep) {
+  var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;
+  return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);
+}
+
+var _cloneTypedArray = cloneTypedArray;
+
+/**
+ * Copies the values of `source` to `array`.
+ *
+ * @private
+ * @param {Array} source The array to copy values from.
+ * @param {Array} [array=[]] The array to copy values to.
+ * @returns {Array} Returns `array`.
+ */
+
+function copyArray(source, array) {
+  var index = -1,
+      length = source.length;
+  array || (array = Array(length));
+
+  while (++index < length) {
+    array[index] = source[index];
+  }
+
+  return array;
+}
+
+var _copyArray = copyArray;
+
+var isObject$1 = isObject_1;
+/** Built-in value references. */
+
+var objectCreate = Object.create;
+/**
+ * The base implementation of `_.create` without support for assigning
+ * properties to the created object.
+ *
+ * @private
+ * @param {Object} proto The object to inherit from.
+ * @returns {Object} Returns the new object.
+ */
+
+var baseCreate$1 = function () {
+  function object() {}
+
+  return function (proto) {
+    if (!isObject$1(proto)) {
+      return {};
+    }
+
+    if (objectCreate) {
+      return objectCreate(proto);
+    }
+
+    object.prototype = proto;
+    var result = new object();
+    object.prototype = undefined;
+    return result;
+  };
+}();
+
+var _baseCreate = baseCreate$1;
+
+var baseCreate = _baseCreate,
+    getPrototype = _getPrototype,
+    isPrototype$1 = _isPrototype;
+/**
+ * Initializes an object clone.
+ *
+ * @private
+ * @param {Object} object The object to clone.
+ * @returns {Object} Returns the initialized clone.
+ */
+
+function initCloneObject(object) {
+  return typeof object.constructor == 'function' && !isPrototype$1(object) ? baseCreate(getPrototype(object)) : {};
+}
+
+var _initCloneObject = initCloneObject;
+
+var assignValue = _assignValue,
+    baseAssignValue = _baseAssignValue;
+/**
+ * Copies properties of `source` to `object`.
+ *
+ * @private
+ * @param {Object} source The object to copy properties from.
+ * @param {Array} props The property identifiers to copy.
+ * @param {Object} [object={}] The object to copy properties to.
+ * @param {Function} [customizer] The function to customize copied values.
+ * @returns {Object} Returns `object`.
+ */
+
+function copyObject(source, props, object, customizer) {
+  var isNew = !object;
+  object || (object = {});
+  var index = -1,
+      length = props.length;
+
+  while (++index < length) {
+    var key = props[index];
+    var newValue = customizer ? customizer(object[key], source[key], key, object, source) : undefined;
+
+    if (newValue === undefined) {
+      newValue = source[key];
+    }
+
+    if (isNew) {
+      baseAssignValue(object, key, newValue);
+    } else {
+      assignValue(object, key, newValue);
+    }
+  }
+
+  return object;
+}
+
+var _copyObject = copyObject;
+
+/**
+ * The base implementation of `_.times` without support for iteratee shorthands
+ * or max array length checks.
+ *
+ * @private
+ * @param {number} n The number of times to invoke `iteratee`.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @returns {Array} Returns the array of results.
+ */
+
+function baseTimes$1(n, iteratee) {
+  var index = -1,
+      result = Array(n);
+
+  while (++index < n) {
+    result[index] = iteratee(index);
+  }
+
+  return result;
+}
+
+var _baseTimes = baseTimes$1;
+
+var baseTimes = _baseTimes,
+    isArguments = isArguments_1,
+    isArray = isArray_1,
+    isBuffer = isBuffer$1.exports,
+    isIndex = _isIndex,
+    isTypedArray = isTypedArray_1;
+/** Used for built-in method references. */
+
+var objectProto$1 = Object.prototype;
+/** Used to check objects for own properties. */
+
+var hasOwnProperty$1 = objectProto$1.hasOwnProperty;
+/**
+ * Creates an array of the enumerable property names of the array-like `value`.
+ *
+ * @private
+ * @param {*} value The value to query.
+ * @param {boolean} inherited Specify returning inherited property names.
+ * @returns {Array} Returns the array of property names.
+ */
+
+function arrayLikeKeys$1(value, inherited) {
+  var isArr = isArray(value),
+      isArg = !isArr && isArguments(value),
+      isBuff = !isArr && !isArg && isBuffer(value),
+      isType = !isArr && !isArg && !isBuff && isTypedArray(value),
+      skipIndexes = isArr || isArg || isBuff || isType,
+      result = skipIndexes ? baseTimes(value.length, String) : [],
+      length = result.length;
+
+  for (var key in value) {
+    if ((inherited || hasOwnProperty$1.call(value, key)) && !(skipIndexes && ( // Safari 9 has enumerable `arguments.length` in strict mode.
+    key == 'length' || // Node.js 0.10 has enumerable non-index properties on buffers.
+    isBuff && (key == 'offset' || key == 'parent') || // PhantomJS 2 has enumerable non-index properties on typed arrays.
+    isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset') || // Skip index properties.
+    isIndex(key, length)))) {
+      result.push(key);
+    }
+  }
+
+  return result;
+}
+
+var _arrayLikeKeys = arrayLikeKeys$1;
+
+/**
+ * This function is like
+ * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)
+ * except that it includes inherited enumerable properties.
+ *
+ * @private
+ * @param {Object} object The object to query.
+ * @returns {Array} Returns the array of property names.
+ */
+
+function nativeKeysIn$1(object) {
+  var result = [];
+
+  if (object != null) {
+    for (var key in Object(object)) {
+      result.push(key);
+    }
+  }
+
+  return result;
+}
+
+var _nativeKeysIn = nativeKeysIn$1;
+
+var isObject = isObject_1,
+    isPrototype = _isPrototype,
+    nativeKeysIn = _nativeKeysIn;
+/** Used for built-in method references. */
+
+var objectProto = Object.prototype;
+/** Used to check objects for own properties. */
+
+var hasOwnProperty = objectProto.hasOwnProperty;
+/**
+ * The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.
+ *
+ * @private
+ * @param {Object} object The object to query.
+ * @returns {Array} Returns the array of property names.
+ */
+
+function baseKeysIn$1(object) {
+  if (!isObject(object)) {
+    return nativeKeysIn(object);
+  }
+
+  var isProto = isPrototype(object),
+      result = [];
+
+  for (var key in object) {
+    if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {
+      result.push(key);
+    }
+  }
+
+  return result;
+}
+
+var _baseKeysIn = baseKeysIn$1;
+
+var arrayLikeKeys = _arrayLikeKeys,
+    baseKeysIn = _baseKeysIn,
+    isArrayLike = isArrayLike_1;
+/**
+ * Creates an array of the own and inherited enumerable property names of `object`.
+ *
+ * **Note:** Non-object values are coerced to objects.
+ *
+ * @static
+ * @memberOf _
+ * @since 3.0.0
+ * @category Object
+ * @param {Object} object The object to query.
+ * @returns {Array} Returns the array of property names.
+ * @example
+ *
+ * function Foo() {
+ *   this.a = 1;
+ *   this.b = 2;
+ * }
+ *
+ * Foo.prototype.c = 3;
+ *
+ * _.keysIn(new Foo);
+ * // => ['a', 'b', 'c'] (iteration order is not guaranteed)
+ */
+
+function keysIn(object) {
+  return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);
+}
+
+var keysIn_1 = keysIn;
+
+export { _copyObject as _, _cloneBuffer$1 as a, _cloneTypedArray as b, _copyArray as c, _initCloneObject as d, _Stack as e, _Uint8Array as f, _cloneArrayBuffer as g, _arrayLikeKeys as h, keysIn_1 as k };
+//# sourceMappingURL=dep-8fea0649.js.map

package/es/_chunks/dep-8fea0649.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-8fea0649.js","sources":["../../node_modules/lodash/_stackClear.js","../../node_modules/lodash/_stackDelete.js","../../node_modules/lodash/_stackGet.js","../../node_modules/lodash/_stackHas.js","../../node_modules/lodash/_stackSet.js","../../node_modules/lodash/_Stack.js","../../node_modules/lodash/_cloneBuffer.js","../../node_modules/lodash/_Uint8Array.js","../../node_modules/lodash/_cloneArrayBuffer.js","../../node_modules/lodash/_cloneTypedArray.js","../../node_modules/lodash/_copyArray.js","../../node_modules/lodash/_baseCreate.js","../../node_modules/lodash/_initCloneObject.js","../../node_modules/lodash/_copyObject.js","../../node_modules/lodash/_baseTimes.js","../../node_modules/lodash/_arrayLikeKeys.js","../../node_modules/lodash/_nativeKeysIn.js","../../node_modules/lodash/_baseKeysIn.js","../../node_modules/lodash/keysIn.js"],"sourcesContent":["var ListCache = require('./_ListCache');\n\n/**\n * Removes all key-value entries from the stack.\n *\n * @private\n * @name clear\n * @memberOf Stack\n */\nfunction stackClear() {\n  this.__data__ = new ListCache;\n  this.size = 0;\n}\n\nmodule.exports = stackClear;\n","/**\n * Removes `key` and its value from the stack.\n *\n * @private\n * @name delete\n * @memberOf Stack\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction stackDelete(key) {\n  var data = this.__data__,\n      result = data['delete'](key);\n\n  this.size = data.size;\n  return result;\n}\n\nmodule.exports = stackDelete;\n","/**\n * Gets the stack value for `key`.\n *\n * @private\n * @name get\n * @memberOf Stack\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction stackGet(key) {\n  return this.__data__.get(key);\n}\n\nmodule.exports = stackGet;\n","/**\n * Checks if a stack value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Stack\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 stackHas(key) {\n  return this.__data__.has(key);\n}\n\nmodule.exports = stackHas;\n","var ListCache = require('./_ListCache'),\n    Map = require('./_Map'),\n    MapCache = require('./_MapCache');\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * Sets the stack `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Stack\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the stack cache instance.\n */\nfunction stackSet(key, value) {\n  var data = this.__data__;\n  if (data instanceof ListCache) {\n    var pairs = data.__data__;\n    if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n      pairs.push([key, value]);\n      this.size = ++data.size;\n      return this;\n    }\n    data = this.__data__ = new MapCache(pairs);\n  }\n  data.set(key, value);\n  this.size = data.size;\n  return this;\n}\n\nmodule.exports = stackSet;\n","var ListCache = require('./_ListCache'),\n    stackClear = require('./_stackClear'),\n    stackDelete = require('./_stackDelete'),\n    stackGet = require('./_stackGet'),\n    stackHas = require('./_stackHas'),\n    stackSet = require('./_stackSet');\n\n/**\n * Creates a stack cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Stack(entries) {\n  var data = this.__data__ = new ListCache(entries);\n  this.size = data.size;\n}\n\n// Add methods to `Stack`.\nStack.prototype.clear = stackClear;\nStack.prototype['delete'] = stackDelete;\nStack.prototype.get = stackGet;\nStack.prototype.has = stackHas;\nStack.prototype.set = stackSet;\n\nmodule.exports = Stack;\n","var root = require('./_root');\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Built-in value references. */\nvar Buffer = moduleExports ? root.Buffer : undefined,\n    allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined;\n\n/**\n * Creates a clone of  `buffer`.\n *\n * @private\n * @param {Buffer} buffer The buffer to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Buffer} Returns the cloned buffer.\n */\nfunction cloneBuffer(buffer, isDeep) {\n  if (isDeep) {\n    return buffer.slice();\n  }\n  var length = buffer.length,\n      result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);\n\n  buffer.copy(result);\n  return result;\n}\n\nmodule.exports = cloneBuffer;\n","var root = require('./_root');\n\n/** Built-in value references. */\nvar Uint8Array = root.Uint8Array;\n\nmodule.exports = Uint8Array;\n","var Uint8Array = require('./_Uint8Array');\n\n/**\n * Creates a clone of `arrayBuffer`.\n *\n * @private\n * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\n * @returns {ArrayBuffer} Returns the cloned array buffer.\n */\nfunction cloneArrayBuffer(arrayBuffer) {\n  var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n  new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n  return result;\n}\n\nmodule.exports = cloneArrayBuffer;\n","var cloneArrayBuffer = require('./_cloneArrayBuffer');\n\n/**\n * Creates a clone of `typedArray`.\n *\n * @private\n * @param {Object} typedArray The typed array to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned typed array.\n */\nfunction cloneTypedArray(typedArray, isDeep) {\n  var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n  return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n}\n\nmodule.exports = cloneTypedArray;\n","/**\n * Copies the values of `source` to `array`.\n *\n * @private\n * @param {Array} source The array to copy values from.\n * @param {Array} [array=[]] The array to copy values to.\n * @returns {Array} Returns `array`.\n */\nfunction copyArray(source, array) {\n  var index = -1,\n      length = source.length;\n\n  array || (array = Array(length));\n  while (++index < length) {\n    array[index] = source[index];\n  }\n  return array;\n}\n\nmodule.exports = copyArray;\n","var isObject = require('./isObject');\n\n/** Built-in value references. */\nvar objectCreate = Object.create;\n\n/**\n * The base implementation of `_.create` without support for assigning\n * properties to the created object.\n *\n * @private\n * @param {Object} proto The object to inherit from.\n * @returns {Object} Returns the new object.\n */\nvar baseCreate = (function() {\n  function object() {}\n  return function(proto) {\n    if (!isObject(proto)) {\n      return {};\n    }\n    if (objectCreate) {\n      return objectCreate(proto);\n    }\n    object.prototype = proto;\n    var result = new object;\n    object.prototype = undefined;\n    return result;\n  };\n}());\n\nmodule.exports = baseCreate;\n","var baseCreate = require('./_baseCreate'),\n    getPrototype = require('./_getPrototype'),\n    isPrototype = require('./_isPrototype');\n\n/**\n * Initializes an object clone.\n *\n * @private\n * @param {Object} object The object to clone.\n * @returns {Object} Returns the initialized clone.\n */\nfunction initCloneObject(object) {\n  return (typeof object.constructor == 'function' && !isPrototype(object))\n    ? baseCreate(getPrototype(object))\n    : {};\n}\n\nmodule.exports = initCloneObject;\n","var assignValue = require('./_assignValue'),\n    baseAssignValue = require('./_baseAssignValue');\n\n/**\n * Copies properties of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy properties from.\n * @param {Array} props The property identifiers to copy.\n * @param {Object} [object={}] The object to copy properties to.\n * @param {Function} [customizer] The function to customize copied values.\n * @returns {Object} Returns `object`.\n */\nfunction copyObject(source, props, object, customizer) {\n  var isNew = !object;\n  object || (object = {});\n\n  var index = -1,\n      length = props.length;\n\n  while (++index < length) {\n    var key = props[index];\n\n    var newValue = customizer\n      ? customizer(object[key], source[key], key, object, source)\n      : undefined;\n\n    if (newValue === undefined) {\n      newValue = source[key];\n    }\n    if (isNew) {\n      baseAssignValue(object, key, newValue);\n    } else {\n      assignValue(object, key, newValue);\n    }\n  }\n  return object;\n}\n\nmodule.exports = copyObject;\n","/**\n * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\nfunction baseTimes(n, iteratee) {\n  var index = -1,\n      result = Array(n);\n\n  while (++index < n) {\n    result[index] = iteratee(index);\n  }\n  return result;\n}\n\nmodule.exports = baseTimes;\n","var baseTimes = require('./_baseTimes'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray'),\n    isBuffer = require('./isBuffer'),\n    isIndex = require('./_isIndex'),\n    isTypedArray = require('./isTypedArray');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\nfunction arrayLikeKeys(value, inherited) {\n  var isArr = isArray(value),\n      isArg = !isArr && isArguments(value),\n      isBuff = !isArr && !isArg && isBuffer(value),\n      isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n      skipIndexes = isArr || isArg || isBuff || isType,\n      result = skipIndexes ? baseTimes(value.length, String) : [],\n      length = result.length;\n\n  for (var key in value) {\n    if ((inherited || hasOwnProperty.call(value, key)) &&\n        !(skipIndexes && (\n           // Safari 9 has enumerable `arguments.length` in strict mode.\n           key == 'length' ||\n           // Node.js 0.10 has enumerable non-index properties on buffers.\n           (isBuff && (key == 'offset' || key == 'parent')) ||\n           // PhantomJS 2 has enumerable non-index properties on typed arrays.\n           (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||\n           // Skip index properties.\n           isIndex(key, length)\n        ))) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nmodule.exports = arrayLikeKeys;\n","/**\n * This function is like\n * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * except that it includes inherited enumerable properties.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction nativeKeysIn(object) {\n  var result = [];\n  if (object != null) {\n    for (var key in Object(object)) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nmodule.exports = nativeKeysIn;\n","var isObject = require('./isObject'),\n    isPrototype = require('./_isPrototype'),\n    nativeKeysIn = require('./_nativeKeysIn');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction baseKeysIn(object) {\n  if (!isObject(object)) {\n    return nativeKeysIn(object);\n  }\n  var isProto = isPrototype(object),\n      result = [];\n\n  for (var key in object) {\n    if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseKeysIn;\n","var arrayLikeKeys = require('./_arrayLikeKeys'),\n    baseKeysIn = require('./_baseKeysIn'),\n    isArrayLike = require('./isArrayLike');\n\n/**\n * Creates an array of the own and inherited enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keysIn(new Foo);\n * // => ['a', 'b', 'c'] (iteration order is not guaranteed)\n */\nfunction keysIn(object) {\n  return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);\n}\n\nmodule.exports = keysIn;\n"],"names":["ListCache","require$$0","stackClear","__data__","size","_stackClear","stackDelete","key","data","result","_stackDelete","stackGet","get","_stackGet","stackHas","has","_stackHas","Map","require$$1","MapCache","require$$2","LARGE_ARRAY_SIZE","stackSet","value","pairs","length","push","set","_stackSet","require$$3","require$$4","require$$5","Stack","entries","prototype","clear","_Stack","root","freeExports","exports","nodeType","freeModule","module","moduleExports","Buffer","undefined","allocUnsafe","cloneBuffer","buffer","isDeep","slice","constructor","copy","Uint8Array","_Uint8Array","cloneArrayBuffer","arrayBuffer","byteLength","_cloneArrayBuffer","cloneTypedArray","typedArray","byteOffset","_cloneTypedArray","copyArray","source","array","index","Array","_copyArray","isObject","objectCreate","Object","create","baseCreate","object","proto","_baseCreate","getPrototype","isPrototype","initCloneObject","_initCloneObject","assignValue","baseAssignValue","copyObject","props","customizer","isNew","newValue","_copyObject","baseTimes","n","iteratee","_baseTimes","isArguments","isArray","isBuffer","isIndex","isTypedArray","objectProto","hasOwnProperty","arrayLikeKeys","inherited","isArr","isArg","isBuff","isType","skipIndexes","String","call","_arrayLikeKeys","nativeKeysIn","_nativeKeysIn","baseKeysIn","isProto","_baseKeysIn","isArrayLike","keysIn","keysIn_1"],"mappings":";;;;;;;;;;;;;;;;;;AAAA,IAAIA,WAAS,GAAGC,UAAhB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,YAAT,GAAsB;AACpB,OAAKC,QAAL,GAAgB,IAAIH,WAAJ,EAAhB;AACA,OAAKI,IAAL,GAAY,CAAZ;AACD;;IAEDC,WAAc,GAAGH;;;;;;;;;;;;ACLjB,SAASI,aAAT,CAAqBC,GAArB,EAA0B;AACxB,MAAIC,IAAI,GAAG,KAAKL,QAAhB;AAAA,MACIM,MAAM,GAAGD,IAAI,CAAC,QAAD,CAAJ,CAAeD,GAAf,CADb;AAGA,OAAKH,IAAL,GAAYI,IAAI,CAACJ,IAAjB;AACA,SAAOK,MAAP;AACD;;IAEDC,YAAc,GAAGJ;;;;;;;;;;;;ACRjB,SAASK,UAAT,CAAkBJ,GAAlB,EAAuB;AACrB,SAAO,KAAKJ,QAAL,CAAcS,GAAd,CAAkBL,GAAlB,CAAP;AACD;;IAEDM,SAAc,GAAGF;;;;;;;;;;;;ACJjB,SAASG,UAAT,CAAkBP,GAAlB,EAAuB;AACrB,SAAO,KAAKJ,QAAL,CAAcY,GAAd,CAAkBR,GAAlB,CAAP;AACD;;IAEDS,SAAc,GAAGF;;ACbjB,IAAId,WAAS,GAAGC,UAAhB;AAAA,IACIgB,GAAG,GAAGC,IADV;AAAA,IAEIC,QAAQ,GAAGC,SAFf;AAIA;;AACA,IAAIC,gBAAgB,GAAG,GAAvB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,UAAT,CAAkBf,GAAlB,EAAuBgB,KAAvB,EAA8B;AAC5B,MAAIf,IAAI,GAAG,KAAKL,QAAhB;;AACA,MAAIK,IAAI,YAAYR,WAApB,EAA+B;AAC7B,QAAIwB,KAAK,GAAGhB,IAAI,CAACL,QAAjB;;AACA,QAAI,CAACc,GAAD,IAASO,KAAK,CAACC,MAAN,GAAeJ,gBAAgB,GAAG,CAA/C,EAAmD;AACjDG,MAAAA,KAAK,CAACE,IAAN,CAAW,CAACnB,GAAD,EAAMgB,KAAN,CAAX;AACA,WAAKnB,IAAL,GAAY,EAAEI,IAAI,CAACJ,IAAnB;AACA,aAAO,IAAP;AACD;;AACDI,IAAAA,IAAI,GAAG,KAAKL,QAAL,GAAgB,IAAIgB,QAAJ,CAAaK,KAAb,CAAvB;AACD;;AACDhB,EAAAA,IAAI,CAACmB,GAAL,CAASpB,GAAT,EAAcgB,KAAd;AACA,OAAKnB,IAAL,GAAYI,IAAI,CAACJ,IAAjB;AACA,SAAO,IAAP;AACD;;IAEDwB,SAAc,GAAGN;;ACjCjB,IAAItB,SAAS,GAAGC,UAAhB;AAAA,IACIC,UAAU,GAAGgB,WADjB;AAAA,IAEIZ,WAAW,GAAGc,YAFlB;AAAA,IAGIT,QAAQ,GAAGkB,SAHf;AAAA,IAIIf,QAAQ,GAAGgB,SAJf;AAAA,IAKIR,QAAQ,GAAGS,SALf;AAOA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,KAAT,CAAeC,OAAf,EAAwB;AACtB,MAAIzB,IAAI,GAAG,KAAKL,QAAL,GAAgB,IAAIH,SAAJ,CAAciC,OAAd,CAA3B;AACA,OAAK7B,IAAL,GAAYI,IAAI,CAACJ,IAAjB;AACD;;;AAGD4B,KAAK,CAACE,SAAN,CAAgBC,KAAhB,GAAwBjC,UAAxB;AACA8B,KAAK,CAACE,SAAN,CAAgB,QAAhB,IAA4B5B,WAA5B;AACA0B,KAAK,CAACE,SAAN,CAAgBtB,GAAhB,GAAsBD,QAAtB;AACAqB,KAAK,CAACE,SAAN,CAAgBnB,GAAhB,GAAsBD,QAAtB;AACAkB,KAAK,CAACE,SAAN,CAAgBP,GAAhB,GAAsBL,QAAtB;IAEAc,MAAc,GAAGJ;;;;;AC1BjB,MAAIK,IAAI,GAAGpC,KAAX;AAEA;;AACA,MAAIqC,WAAW,GAAG,YAAkB,QAAlB,IAA8BC,OAA9B,IAAyC,CAACA,OAAO,CAACC,QAAlD,IAA8DD,OAAhF;AAEA;;AACA,MAAIE,UAAU,GAAGH,WAAW,IAAI,YAAiB,QAAhC,IAA4CI,MAA5C,IAAsD,CAACA,MAAM,CAACF,QAA9D,IAA0EE,MAA3F;AAEA;;AACA,MAAIC,aAAa,GAAGF,UAAU,IAAIA,UAAU,CAACF,OAAX,KAAuBD,WAAzD;AAEA;;AACA,MAAIM,MAAM,GAAGD,aAAa,GAAGN,IAAI,CAACO,MAAR,GAAiBC,SAA3C;AAAA,MACIC,WAAW,GAAGF,MAAM,GAAGA,MAAM,CAACE,WAAV,GAAwBD,SADhD;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,WAASE,WAAT,CAAqBC,MAArB,EAA6BC,MAA7B,EAAqC;AACnC,QAAIA,MAAJ,EAAY;AACV,aAAOD,MAAM,CAACE,KAAP,EAAP;AACD;;AACD,QAAIzB,MAAM,GAAGuB,MAAM,CAACvB,MAApB;AAAA,QACIhB,MAAM,GAAGqC,WAAW,GAAGA,WAAW,CAACrB,MAAD,CAAd,GAAyB,IAAIuB,MAAM,CAACG,WAAX,CAAuB1B,MAAvB,CADjD;AAGAuB,IAAAA,MAAM,CAACI,IAAP,CAAY3C,MAAZ;AACA,WAAOA,MAAP;AACD;;AAEDiC,EAAAA,cAAA,GAAiBK,WAAjB;;;;;AClCA,IAAIV,IAAI,GAAGpC,KAAX;AAEA;;AACA,IAAIoD,YAAU,GAAGhB,IAAI,CAACgB,UAAtB;IAEAC,WAAc,GAAGD;;ACLjB,IAAIA,UAAU,GAAGpD,WAAjB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASsD,kBAAT,CAA0BC,WAA1B,EAAuC;AACrC,MAAI/C,MAAM,GAAG,IAAI+C,WAAW,CAACL,WAAhB,CAA4BK,WAAW,CAACC,UAAxC,CAAb;AACA,MAAIJ,UAAJ,CAAe5C,MAAf,EAAuBkB,GAAvB,CAA2B,IAAI0B,UAAJ,CAAeG,WAAf,CAA3B;AACA,SAAO/C,MAAP;AACD;;IAEDiD,iBAAc,GAAGH;;ACfjB,IAAIA,gBAAgB,GAAGtD,iBAAvB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAAS0D,eAAT,CAAyBC,UAAzB,EAAqCX,MAArC,EAA6C;AAC3C,MAAID,MAAM,GAAGC,MAAM,GAAGM,gBAAgB,CAACK,UAAU,CAACZ,MAAZ,CAAnB,GAAyCY,UAAU,CAACZ,MAAvE;AACA,SAAO,IAAIY,UAAU,CAACT,WAAf,CAA2BH,MAA3B,EAAmCY,UAAU,CAACC,UAA9C,EAA0DD,UAAU,CAACnC,MAArE,CAAP;AACD;;IAEDqC,gBAAc,GAAGH;;;;;;;;;;;ACPjB,SAASI,SAAT,CAAmBC,MAAnB,EAA2BC,KAA3B,EAAkC;AAChC,MAAIC,KAAK,GAAG,CAAC,CAAb;AAAA,MACIzC,MAAM,GAAGuC,MAAM,CAACvC,MADpB;AAGAwC,EAAAA,KAAK,KAAKA,KAAK,GAAGE,KAAK,CAAC1C,MAAD,CAAlB,CAAL;;AACA,SAAO,EAAEyC,KAAF,GAAUzC,MAAjB,EAAyB;AACvBwC,IAAAA,KAAK,CAACC,KAAD,CAAL,GAAeF,MAAM,CAACE,KAAD,CAArB;AACD;;AACD,SAAOD,KAAP;AACD;;IAEDG,UAAc,GAAGL;;ACnBjB,IAAIM,UAAQ,GAAGpE,UAAf;AAEA;;AACA,IAAIqE,YAAY,GAAGC,MAAM,CAACC,MAA1B;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,IAAIC,YAAU,GAAI,YAAW;AAC3B,WAASC,MAAT,GAAkB;;AAClB,SAAO,UAASC,KAAT,EAAgB;AACrB,QAAI,CAACN,UAAQ,CAACM,KAAD,CAAb,EAAsB;AACpB,aAAO,EAAP;AACD;;AACD,QAAIL,YAAJ,EAAkB;AAChB,aAAOA,YAAY,CAACK,KAAD,CAAnB;AACD;;AACDD,IAAAA,MAAM,CAACxC,SAAP,GAAmByC,KAAnB;AACA,QAAIlE,MAAM,GAAG,IAAIiE,MAAJ,EAAb;AACAA,IAAAA,MAAM,CAACxC,SAAP,GAAmBW,SAAnB;AACA,WAAOpC,MAAP;AACD,GAXD;AAYD,CAdiB,EAAlB;;IAgBAmE,WAAc,GAAGH;;AC7BjB,IAAIA,UAAU,GAAGxE,WAAjB;AAAA,IACI4E,YAAY,GAAG3D,aADnB;AAAA,IAEI4D,aAAW,GAAG1D,YAFlB;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAAS2D,eAAT,CAAyBL,MAAzB,EAAiC;AAC/B,SAAQ,OAAOA,MAAM,CAACvB,WAAd,IAA6B,UAA7B,IAA2C,CAAC2B,aAAW,CAACJ,MAAD,CAAxD,GACHD,UAAU,CAACI,YAAY,CAACH,MAAD,CAAb,CADP,GAEH,EAFJ;AAGD;;IAEDM,gBAAc,GAAGD;;ACjBjB,IAAIE,WAAW,GAAGhF,YAAlB;AAAA,IACIiF,eAAe,GAAGhE,gBADtB;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASiE,UAAT,CAAoBnB,MAApB,EAA4BoB,KAA5B,EAAmCV,MAAnC,EAA2CW,UAA3C,EAAuD;AACrD,MAAIC,KAAK,GAAG,CAACZ,MAAb;AACAA,EAAAA,MAAM,KAAKA,MAAM,GAAG,EAAd,CAAN;AAEA,MAAIR,KAAK,GAAG,CAAC,CAAb;AAAA,MACIzC,MAAM,GAAG2D,KAAK,CAAC3D,MADnB;;AAGA,SAAO,EAAEyC,KAAF,GAAUzC,MAAjB,EAAyB;AACvB,QAAIlB,GAAG,GAAG6E,KAAK,CAAClB,KAAD,CAAf;AAEA,QAAIqB,QAAQ,GAAGF,UAAU,GACrBA,UAAU,CAACX,MAAM,CAACnE,GAAD,CAAP,EAAcyD,MAAM,CAACzD,GAAD,CAApB,EAA2BA,GAA3B,EAAgCmE,MAAhC,EAAwCV,MAAxC,CADW,GAErBnB,SAFJ;;AAIA,QAAI0C,QAAQ,KAAK1C,SAAjB,EAA4B;AAC1B0C,MAAAA,QAAQ,GAAGvB,MAAM,CAACzD,GAAD,CAAjB;AACD;;AACD,QAAI+E,KAAJ,EAAW;AACTJ,MAAAA,eAAe,CAACR,MAAD,EAASnE,GAAT,EAAcgF,QAAd,CAAf;AACD,KAFD,MAEO;AACLN,MAAAA,WAAW,CAACP,MAAD,EAASnE,GAAT,EAAcgF,QAAd,CAAX;AACD;AACF;;AACD,SAAOb,MAAP;AACD;;IAEDc,WAAc,GAAGL;;;;;;;;;;;;AC9BjB,SAASM,WAAT,CAAmBC,CAAnB,EAAsBC,QAAtB,EAAgC;AAC9B,MAAIzB,KAAK,GAAG,CAAC,CAAb;AAAA,MACIzD,MAAM,GAAG0D,KAAK,CAACuB,CAAD,CADlB;;AAGA,SAAO,EAAExB,KAAF,GAAUwB,CAAjB,EAAoB;AAClBjF,IAAAA,MAAM,CAACyD,KAAD,CAAN,GAAgByB,QAAQ,CAACzB,KAAD,CAAxB;AACD;;AACD,SAAOzD,MAAP;AACD;;IAEDmF,UAAc,GAAGH;;ACnBjB,IAAIA,SAAS,GAAGxF,UAAhB;AAAA,IACI4F,WAAW,GAAG3E,aADlB;AAAA,IAEI4E,OAAO,GAAG1E,SAFd;AAAA,IAGI2E,QAAQ,GAAGlE,kBAHf;AAAA,IAIImE,OAAO,GAAGlE,QAJd;AAAA,IAKImE,YAAY,GAAGlE,cALnB;AAOA;;AACA,IAAImE,aAAW,GAAG3B,MAAM,CAACrC,SAAzB;AAEA;;AACA,IAAIiE,gBAAc,GAAGD,aAAW,CAACC,cAAjC;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,eAAT,CAAuB7E,KAAvB,EAA8B8E,SAA9B,EAAyC;AACvC,MAAIC,KAAK,GAAGR,OAAO,CAACvE,KAAD,CAAnB;AAAA,MACIgF,KAAK,GAAG,CAACD,KAAD,IAAUT,WAAW,CAACtE,KAAD,CADjC;AAAA,MAEIiF,MAAM,GAAG,CAACF,KAAD,IAAU,CAACC,KAAX,IAAoBR,QAAQ,CAACxE,KAAD,CAFzC;AAAA,MAGIkF,MAAM,GAAG,CAACH,KAAD,IAAU,CAACC,KAAX,IAAoB,CAACC,MAArB,IAA+BP,YAAY,CAAC1E,KAAD,CAHxD;AAAA,MAIImF,WAAW,GAAGJ,KAAK,IAAIC,KAAT,IAAkBC,MAAlB,IAA4BC,MAJ9C;AAAA,MAKIhG,MAAM,GAAGiG,WAAW,GAAGjB,SAAS,CAAClE,KAAK,CAACE,MAAP,EAAekF,MAAf,CAAZ,GAAqC,EAL7D;AAAA,MAMIlF,MAAM,GAAGhB,MAAM,CAACgB,MANpB;;AAQA,OAAK,IAAIlB,GAAT,IAAgBgB,KAAhB,EAAuB;AACrB,QAAI,CAAC8E,SAAS,IAAIF,gBAAc,CAACS,IAAf,CAAoBrF,KAApB,EAA2BhB,GAA3B,CAAd,KACA,EAAEmG,WAAW;AAEVnG,IAAAA,GAAG,IAAI,QAAP;AAECiG,IAAAA,MAAM,KAAKjG,GAAG,IAAI,QAAP,IAAmBA,GAAG,IAAI,QAA/B,CAFP;AAICkG,IAAAA,MAAM,KAAKlG,GAAG,IAAI,QAAP,IAAmBA,GAAG,IAAI,YAA1B,IAA0CA,GAAG,IAAI,YAAtD,CAJP;AAMAyF,IAAAA,OAAO,CAACzF,GAAD,EAAMkB,MAAN,CARG,CAAb,CADJ,EAUQ;AACNhB,MAAAA,MAAM,CAACiB,IAAP,CAAYnB,GAAZ;AACD;AACF;;AACD,SAAOE,MAAP;AACD;;IAEDoG,cAAc,GAAGT;;;;;;;;;;;;ACvCjB,SAASU,cAAT,CAAsBpC,MAAtB,EAA8B;AAC5B,MAAIjE,MAAM,GAAG,EAAb;;AACA,MAAIiE,MAAM,IAAI,IAAd,EAAoB;AAClB,SAAK,IAAInE,GAAT,IAAgBgE,MAAM,CAACG,MAAD,CAAtB,EAAgC;AAC9BjE,MAAAA,MAAM,CAACiB,IAAP,CAAYnB,GAAZ;AACD;AACF;;AACD,SAAOE,MAAP;AACD;;IAEDsG,aAAc,GAAGD;;ACnBjB,IAAIzC,QAAQ,GAAGpE,UAAf;AAAA,IACI6E,WAAW,GAAG5D,YADlB;AAAA,IAEI4F,YAAY,GAAG1F,aAFnB;AAIA;;AACA,IAAI8E,WAAW,GAAG3B,MAAM,CAACrC,SAAzB;AAEA;;AACA,IAAIiE,cAAc,GAAGD,WAAW,CAACC,cAAjC;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASa,YAAT,CAAoBtC,MAApB,EAA4B;AAC1B,MAAI,CAACL,QAAQ,CAACK,MAAD,CAAb,EAAuB;AACrB,WAAOoC,YAAY,CAACpC,MAAD,CAAnB;AACD;;AACD,MAAIuC,OAAO,GAAGnC,WAAW,CAACJ,MAAD,CAAzB;AAAA,MACIjE,MAAM,GAAG,EADb;;AAGA,OAAK,IAAIF,GAAT,IAAgBmE,MAAhB,EAAwB;AACtB,QAAI,EAAEnE,GAAG,IAAI,aAAP,KAAyB0G,OAAO,IAAI,CAACd,cAAc,CAACS,IAAf,CAAoBlC,MAApB,EAA4BnE,GAA5B,CAArC,CAAF,CAAJ,EAA+E;AAC7EE,MAAAA,MAAM,CAACiB,IAAP,CAAYnB,GAAZ;AACD;AACF;;AACD,SAAOE,MAAP;AACD;;IAEDyG,WAAc,GAAGF;;AChCjB,IAAIZ,aAAa,GAAGnG,cAApB;AAAA,IACI+G,UAAU,GAAG9F,WADjB;AAAA,IAEIiG,WAAW,GAAG/F,aAFlB;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASgG,MAAT,CAAgB1C,MAAhB,EAAwB;AACtB,SAAOyC,WAAW,CAACzC,MAAD,CAAX,GAAsB0B,aAAa,CAAC1B,MAAD,EAAS,IAAT,CAAnC,GAAoDsC,UAAU,CAACtC,MAAD,CAArE;AACD;;IAED2C,QAAc,GAAGD;;;;"}

package/es/_chunks/dep-93f0cc3c.js

@@ -0,0 +1,75 @@
+/**
+ * tdesign v0.26.0
+ * (c) 2022 tdesign
+ * @license MIT
+ */
+
+import './dep-c5e6a539.js';
+import { _ as _arrayPush } from './dep-a3e8ed28.js';
+import { a as _Symbol$1 } from './dep-76bc9a8e.js';
+import { i as isArguments_1 } from './dep-96268fc3.js';
+import { i as isArray_1 } from './dep-d945c24c.js';
+import './dep-43841bc9.js';
+
+var _Symbol = _Symbol$1,
+    isArguments = isArguments_1,
+    isArray = isArray_1;
+/** Built-in value references. */
+
+var spreadableSymbol = _Symbol ? _Symbol.isConcatSpreadable : undefined;
+/**
+ * Checks if `value` is a flattenable `arguments` object or array.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.
+ */
+
+function isFlattenable$1(value) {
+  return isArray(value) || isArguments(value) || !!(spreadableSymbol && value && value[spreadableSymbol]);
+}
+
+var _isFlattenable = isFlattenable$1;
+
+var arrayPush = _arrayPush,
+    isFlattenable = _isFlattenable;
+/**
+ * The base implementation of `_.flatten` with support for restricting flattening.
+ *
+ * @private
+ * @param {Array} array The array to flatten.
+ * @param {number} depth The maximum recursion depth.
+ * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.
+ * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.
+ * @param {Array} [result=[]] The initial result value.
+ * @returns {Array} Returns the new flattened array.
+ */
+
+function baseFlatten(array, depth, predicate, isStrict, result) {
+  var index = -1,
+      length = array.length;
+  predicate || (predicate = isFlattenable);
+  result || (result = []);
+
+  while (++index < length) {
+    var value = array[index];
+
+    if (depth > 0 && predicate(value)) {
+      if (depth > 1) {
+        // Recursively flatten arrays (susceptible to call stack limits).
+        baseFlatten(value, depth - 1, predicate, isStrict, result);
+      } else {
+        arrayPush(result, value);
+      }
+    } else if (!isStrict) {
+      result[result.length] = value;
+    }
+  }
+
+  return result;
+}
+
+var _baseFlatten = baseFlatten;
+
+export { _baseFlatten as _ };
+//# sourceMappingURL=dep-93f0cc3c.js.map

package/es/_chunks/dep-93f0cc3c.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-93f0cc3c.js","sources":["../../node_modules/lodash/_isFlattenable.js","../../node_modules/lodash/_baseFlatten.js"],"sourcesContent":["var Symbol = require('./_Symbol'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray');\n\n/** Built-in value references. */\nvar spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined;\n\n/**\n * Checks if `value` is a flattenable `arguments` object or array.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.\n */\nfunction isFlattenable(value) {\n  return isArray(value) || isArguments(value) ||\n    !!(spreadableSymbol && value && value[spreadableSymbol]);\n}\n\nmodule.exports = isFlattenable;\n","var arrayPush = require('./_arrayPush'),\n    isFlattenable = require('./_isFlattenable');\n\n/**\n * The base implementation of `_.flatten` with support for restricting flattening.\n *\n * @private\n * @param {Array} array The array to flatten.\n * @param {number} depth The maximum recursion depth.\n * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.\n * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.\n * @param {Array} [result=[]] The initial result value.\n * @returns {Array} Returns the new flattened array.\n */\nfunction baseFlatten(array, depth, predicate, isStrict, result) {\n  var index = -1,\n      length = array.length;\n\n  predicate || (predicate = isFlattenable);\n  result || (result = []);\n\n  while (++index < length) {\n    var value = array[index];\n    if (depth > 0 && predicate(value)) {\n      if (depth > 1) {\n        // Recursively flatten arrays (susceptible to call stack limits).\n        baseFlatten(value, depth - 1, predicate, isStrict, result);\n      } else {\n        arrayPush(result, value);\n      }\n    } else if (!isStrict) {\n      result[result.length] = value;\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseFlatten;\n"],"names":["Symbol","require$$0","isArguments","require$$1","isArray","require$$2","spreadableSymbol","isConcatSpreadable","undefined","isFlattenable","value","_isFlattenable","arrayPush","baseFlatten","array","depth","predicate","isStrict","result","index","length","_baseFlatten"],"mappings":";;;;;;;;;;;;;AAAA,IAAIA,OAAM,GAAGC,SAAb;AAAA,IACIC,WAAW,GAAGC,aADlB;AAAA,IAEIC,OAAO,GAAGC,SAFd;AAIA;;AACA,IAAIC,gBAAgB,GAAGN,OAAM,GAAGA,OAAM,CAACO,kBAAV,GAA+BC,SAA5D;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,eAAT,CAAuBC,KAAvB,EAA8B;AAC5B,SAAON,OAAO,CAACM,KAAD,CAAP,IAAkBR,WAAW,CAACQ,KAAD,CAA7B,IACL,CAAC,EAAEJ,gBAAgB,IAAII,KAApB,IAA6BA,KAAK,CAACJ,gBAAD,CAApC,CADH;AAED;;IAEDK,cAAc,GAAGF;;ACnBjB,IAAIG,SAAS,GAAGX,UAAhB;AAAA,IACIQ,aAAa,GAAGN,cADpB;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASU,WAAT,CAAqBC,KAArB,EAA4BC,KAA5B,EAAmCC,SAAnC,EAA8CC,QAA9C,EAAwDC,MAAxD,EAAgE;AAC9D,MAAIC,KAAK,GAAG,CAAC,CAAb;AAAA,MACIC,MAAM,GAAGN,KAAK,CAACM,MADnB;AAGAJ,EAAAA,SAAS,KAAKA,SAAS,GAAGP,aAAjB,CAAT;AACAS,EAAAA,MAAM,KAAKA,MAAM,GAAG,EAAd,CAAN;;AAEA,SAAO,EAAEC,KAAF,GAAUC,MAAjB,EAAyB;AACvB,QAAIV,KAAK,GAAGI,KAAK,CAACK,KAAD,CAAjB;;AACA,QAAIJ,KAAK,GAAG,CAAR,IAAaC,SAAS,CAACN,KAAD,CAA1B,EAAmC;AACjC,UAAIK,KAAK,GAAG,CAAZ,EAAe;;AAEbF,QAAAA,WAAW,CAACH,KAAD,EAAQK,KAAK,GAAG,CAAhB,EAAmBC,SAAnB,EAA8BC,QAA9B,EAAwCC,MAAxC,CAAX;AACD,OAHD,MAGO;AACLN,QAAAA,SAAS,CAACM,MAAD,EAASR,KAAT,CAAT;AACD;AACF,KAPD,MAOO,IAAI,CAACO,QAAL,EAAe;AACpBC,MAAAA,MAAM,CAACA,MAAM,CAACE,MAAR,CAAN,GAAwBV,KAAxB;AACD;AACF;;AACD,SAAOQ,MAAP;AACD;;IAEDG,YAAc,GAAGR;;;;"}