tdesign-react 0.33.1 → 0.33.2

package/esm/_chunks/dep-28c6c81c.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-28c6c81c.js","sources":["../../node_modules/@babel/runtime/helpers/esm/asyncToGenerator.js","../../node_modules/regenerator-runtime/runtime.js","../../node_modules/@babel/runtime/regenerator/index.js"],"sourcesContent":["function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) {\n  try {\n    var info = gen[key](arg);\n    var value = info.value;\n  } catch (error) {\n    reject(error);\n    return;\n  }\n\n  if (info.done) {\n    resolve(value);\n  } else {\n    Promise.resolve(value).then(_next, _throw);\n  }\n}\n\nexport default function _asyncToGenerator(fn) {\n  return function () {\n    var self = this,\n        args = arguments;\n    return new Promise(function (resolve, reject) {\n      var gen = fn.apply(self, args);\n\n      function _next(value) {\n        asyncGeneratorStep(gen, resolve, reject, _next, _throw, \"next\", value);\n      }\n\n      function _throw(err) {\n        asyncGeneratorStep(gen, resolve, reject, _next, _throw, \"throw\", err);\n      }\n\n      _next(undefined);\n    });\n  };\n}","/**\n * Copyright (c) 2014-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\nvar runtime = (function (exports) {\n  \"use strict\";\n\n  var Op = Object.prototype;\n  var hasOwn = Op.hasOwnProperty;\n  var undefined; // More compressible than void 0.\n  var $Symbol = typeof Symbol === \"function\" ? Symbol : {};\n  var iteratorSymbol = $Symbol.iterator || \"@@iterator\";\n  var asyncIteratorSymbol = $Symbol.asyncIterator || \"@@asyncIterator\";\n  var toStringTagSymbol = $Symbol.toStringTag || \"@@toStringTag\";\n\n  function define(obj, key, value) {\n    Object.defineProperty(obj, key, {\n      value: value,\n      enumerable: true,\n      configurable: true,\n      writable: true\n    });\n    return obj[key];\n  }\n  try {\n    // IE 8 has a broken Object.defineProperty that only works on DOM objects.\n    define({}, \"\");\n  } catch (err) {\n    define = function(obj, key, value) {\n      return obj[key] = value;\n    };\n  }\n\n  function wrap(innerFn, outerFn, self, tryLocsList) {\n    // If outerFn provided and outerFn.prototype is a Generator, then outerFn.prototype instanceof Generator.\n    var protoGenerator = outerFn && outerFn.prototype instanceof Generator ? outerFn : Generator;\n    var generator = Object.create(protoGenerator.prototype);\n    var context = new Context(tryLocsList || []);\n\n    // The ._invoke method unifies the implementations of the .next,\n    // .throw, and .return methods.\n    generator._invoke = makeInvokeMethod(innerFn, self, context);\n\n    return generator;\n  }\n  exports.wrap = wrap;\n\n  // Try/catch helper to minimize deoptimizations. Returns a completion\n  // record like context.tryEntries[i].completion. This interface could\n  // have been (and was previously) designed to take a closure to be\n  // invoked without arguments, but in all the cases we care about we\n  // already have an existing method we want to call, so there's no need\n  // to create a new function object. We can even get away with assuming\n  // the method takes exactly one argument, since that happens to be true\n  // in every case, so we don't have to touch the arguments object. The\n  // only additional allocation required is the completion record, which\n  // has a stable shape and so hopefully should be cheap to allocate.\n  function tryCatch(fn, obj, arg) {\n    try {\n      return { type: \"normal\", arg: fn.call(obj, arg) };\n    } catch (err) {\n      return { type: \"throw\", arg: err };\n    }\n  }\n\n  var GenStateSuspendedStart = \"suspendedStart\";\n  var GenStateSuspendedYield = \"suspendedYield\";\n  var GenStateExecuting = \"executing\";\n  var GenStateCompleted = \"completed\";\n\n  // Returning this object from the innerFn has the same effect as\n  // breaking out of the dispatch switch statement.\n  var ContinueSentinel = {};\n\n  // Dummy constructor functions that we use as the .constructor and\n  // .constructor.prototype properties for functions that return Generator\n  // objects. For full spec compliance, you may wish to configure your\n  // minifier not to mangle the names of these two functions.\n  function Generator() {}\n  function GeneratorFunction() {}\n  function GeneratorFunctionPrototype() {}\n\n  // This is a polyfill for %IteratorPrototype% for environments that\n  // don't natively support it.\n  var IteratorPrototype = {};\n  define(IteratorPrototype, iteratorSymbol, function () {\n    return this;\n  });\n\n  var getProto = Object.getPrototypeOf;\n  var NativeIteratorPrototype = getProto && getProto(getProto(values([])));\n  if (NativeIteratorPrototype &&\n      NativeIteratorPrototype !== Op &&\n      hasOwn.call(NativeIteratorPrototype, iteratorSymbol)) {\n    // This environment has a native %IteratorPrototype%; use it instead\n    // of the polyfill.\n    IteratorPrototype = NativeIteratorPrototype;\n  }\n\n  var Gp = GeneratorFunctionPrototype.prototype =\n    Generator.prototype = Object.create(IteratorPrototype);\n  GeneratorFunction.prototype = GeneratorFunctionPrototype;\n  define(Gp, \"constructor\", GeneratorFunctionPrototype);\n  define(GeneratorFunctionPrototype, \"constructor\", GeneratorFunction);\n  GeneratorFunction.displayName = define(\n    GeneratorFunctionPrototype,\n    toStringTagSymbol,\n    \"GeneratorFunction\"\n  );\n\n  // Helper for defining the .next, .throw, and .return methods of the\n  // Iterator interface in terms of a single ._invoke method.\n  function defineIteratorMethods(prototype) {\n    [\"next\", \"throw\", \"return\"].forEach(function(method) {\n      define(prototype, method, function(arg) {\n        return this._invoke(method, arg);\n      });\n    });\n  }\n\n  exports.isGeneratorFunction = function(genFun) {\n    var ctor = typeof genFun === \"function\" && genFun.constructor;\n    return ctor\n      ? ctor === GeneratorFunction ||\n        // For the native GeneratorFunction constructor, the best we can\n        // do is to check its .name property.\n        (ctor.displayName || ctor.name) === \"GeneratorFunction\"\n      : false;\n  };\n\n  exports.mark = function(genFun) {\n    if (Object.setPrototypeOf) {\n      Object.setPrototypeOf(genFun, GeneratorFunctionPrototype);\n    } else {\n      genFun.__proto__ = GeneratorFunctionPrototype;\n      define(genFun, toStringTagSymbol, \"GeneratorFunction\");\n    }\n    genFun.prototype = Object.create(Gp);\n    return genFun;\n  };\n\n  // Within the body of any async function, `await x` is transformed to\n  // `yield regeneratorRuntime.awrap(x)`, so that the runtime can test\n  // `hasOwn.call(value, \"__await\")` to determine if the yielded value is\n  // meant to be awaited.\n  exports.awrap = function(arg) {\n    return { __await: arg };\n  };\n\n  function AsyncIterator(generator, PromiseImpl) {\n    function invoke(method, arg, resolve, reject) {\n      var record = tryCatch(generator[method], generator, arg);\n      if (record.type === \"throw\") {\n        reject(record.arg);\n      } else {\n        var result = record.arg;\n        var value = result.value;\n        if (value &&\n            typeof value === \"object\" &&\n            hasOwn.call(value, \"__await\")) {\n          return PromiseImpl.resolve(value.__await).then(function(value) {\n            invoke(\"next\", value, resolve, reject);\n          }, function(err) {\n            invoke(\"throw\", err, resolve, reject);\n          });\n        }\n\n        return PromiseImpl.resolve(value).then(function(unwrapped) {\n          // When a yielded Promise is resolved, its final value becomes\n          // the .value of the Promise<{value,done}> result for the\n          // current iteration.\n          result.value = unwrapped;\n          resolve(result);\n        }, function(error) {\n          // If a rejected Promise was yielded, throw the rejection back\n          // into the async generator function so it can be handled there.\n          return invoke(\"throw\", error, resolve, reject);\n        });\n      }\n    }\n\n    var previousPromise;\n\n    function enqueue(method, arg) {\n      function callInvokeWithMethodAndArg() {\n        return new PromiseImpl(function(resolve, reject) {\n          invoke(method, arg, resolve, reject);\n        });\n      }\n\n      return previousPromise =\n        // If enqueue has been called before, then we want to wait until\n        // all previous Promises have been resolved before calling invoke,\n        // so that results are always delivered in the correct order. If\n        // enqueue has not been called before, then it is important to\n        // call invoke immediately, without waiting on a callback to fire,\n        // so that the async generator function has the opportunity to do\n        // any necessary setup in a predictable way. This predictability\n        // is why the Promise constructor synchronously invokes its\n        // executor callback, and why async functions synchronously\n        // execute code before the first await. Since we implement simple\n        // async functions in terms of async generators, it is especially\n        // important to get this right, even though it requires care.\n        previousPromise ? previousPromise.then(\n          callInvokeWithMethodAndArg,\n          // Avoid propagating failures to Promises returned by later\n          // invocations of the iterator.\n          callInvokeWithMethodAndArg\n        ) : callInvokeWithMethodAndArg();\n    }\n\n    // Define the unified helper method that is used to implement .next,\n    // .throw, and .return (see defineIteratorMethods).\n    this._invoke = enqueue;\n  }\n\n  defineIteratorMethods(AsyncIterator.prototype);\n  define(AsyncIterator.prototype, asyncIteratorSymbol, function () {\n    return this;\n  });\n  exports.AsyncIterator = AsyncIterator;\n\n  // Note that simple async functions are implemented on top of\n  // AsyncIterator objects; they just return a Promise for the value of\n  // the final result produced by the iterator.\n  exports.async = function(innerFn, outerFn, self, tryLocsList, PromiseImpl) {\n    if (PromiseImpl === void 0) PromiseImpl = Promise;\n\n    var iter = new AsyncIterator(\n      wrap(innerFn, outerFn, self, tryLocsList),\n      PromiseImpl\n    );\n\n    return exports.isGeneratorFunction(outerFn)\n      ? iter // If outerFn is a generator, return the full iterator.\n      : iter.next().then(function(result) {\n          return result.done ? result.value : iter.next();\n        });\n  };\n\n  function makeInvokeMethod(innerFn, self, context) {\n    var state = GenStateSuspendedStart;\n\n    return function invoke(method, arg) {\n      if (state === GenStateExecuting) {\n        throw new Error(\"Generator is already running\");\n      }\n\n      if (state === GenStateCompleted) {\n        if (method === \"throw\") {\n          throw arg;\n        }\n\n        // Be forgiving, per 25.3.3.3.3 of the spec:\n        // https://people.mozilla.org/~jorendorff/es6-draft.html#sec-generatorresume\n        return doneResult();\n      }\n\n      context.method = method;\n      context.arg = arg;\n\n      while (true) {\n        var delegate = context.delegate;\n        if (delegate) {\n          var delegateResult = maybeInvokeDelegate(delegate, context);\n          if (delegateResult) {\n            if (delegateResult === ContinueSentinel) continue;\n            return delegateResult;\n          }\n        }\n\n        if (context.method === \"next\") {\n          // Setting context._sent for legacy support of Babel's\n          // function.sent implementation.\n          context.sent = context._sent = context.arg;\n\n        } else if (context.method === \"throw\") {\n          if (state === GenStateSuspendedStart) {\n            state = GenStateCompleted;\n            throw context.arg;\n          }\n\n          context.dispatchException(context.arg);\n\n        } else if (context.method === \"return\") {\n          context.abrupt(\"return\", context.arg);\n        }\n\n        state = GenStateExecuting;\n\n        var record = tryCatch(innerFn, self, context);\n        if (record.type === \"normal\") {\n          // If an exception is thrown from innerFn, we leave state ===\n          // GenStateExecuting and loop back for another invocation.\n          state = context.done\n            ? GenStateCompleted\n            : GenStateSuspendedYield;\n\n          if (record.arg === ContinueSentinel) {\n            continue;\n          }\n\n          return {\n            value: record.arg,\n            done: context.done\n          };\n\n        } else if (record.type === \"throw\") {\n          state = GenStateCompleted;\n          // Dispatch the exception by looping back around to the\n          // context.dispatchException(context.arg) call above.\n          context.method = \"throw\";\n          context.arg = record.arg;\n        }\n      }\n    };\n  }\n\n  // Call delegate.iterator[context.method](context.arg) and handle the\n  // result, either by returning a { value, done } result from the\n  // delegate iterator, or by modifying context.method and context.arg,\n  // setting context.delegate to null, and returning the ContinueSentinel.\n  function maybeInvokeDelegate(delegate, context) {\n    var method = delegate.iterator[context.method];\n    if (method === undefined) {\n      // A .throw or .return when the delegate iterator has no .throw\n      // method always terminates the yield* loop.\n      context.delegate = null;\n\n      if (context.method === \"throw\") {\n        // Note: [\"return\"] must be used for ES3 parsing compatibility.\n        if (delegate.iterator[\"return\"]) {\n          // If the delegate iterator has a return method, give it a\n          // chance to clean up.\n          context.method = \"return\";\n          context.arg = undefined;\n          maybeInvokeDelegate(delegate, context);\n\n          if (context.method === \"throw\") {\n            // If maybeInvokeDelegate(context) changed context.method from\n            // \"return\" to \"throw\", let that override the TypeError below.\n            return ContinueSentinel;\n          }\n        }\n\n        context.method = \"throw\";\n        context.arg = new TypeError(\n          \"The iterator does not provide a 'throw' method\");\n      }\n\n      return ContinueSentinel;\n    }\n\n    var record = tryCatch(method, delegate.iterator, context.arg);\n\n    if (record.type === \"throw\") {\n      context.method = \"throw\";\n      context.arg = record.arg;\n      context.delegate = null;\n      return ContinueSentinel;\n    }\n\n    var info = record.arg;\n\n    if (! info) {\n      context.method = \"throw\";\n      context.arg = new TypeError(\"iterator result is not an object\");\n      context.delegate = null;\n      return ContinueSentinel;\n    }\n\n    if (info.done) {\n      // Assign the result of the finished delegate to the temporary\n      // variable specified by delegate.resultName (see delegateYield).\n      context[delegate.resultName] = info.value;\n\n      // Resume execution at the desired location (see delegateYield).\n      context.next = delegate.nextLoc;\n\n      // If context.method was \"throw\" but the delegate handled the\n      // exception, let the outer generator proceed normally. If\n      // context.method was \"next\", forget context.arg since it has been\n      // \"consumed\" by the delegate iterator. If context.method was\n      // \"return\", allow the original .return call to continue in the\n      // outer generator.\n      if (context.method !== \"return\") {\n        context.method = \"next\";\n        context.arg = undefined;\n      }\n\n    } else {\n      // Re-yield the result returned by the delegate method.\n      return info;\n    }\n\n    // The delegate iterator is finished, so forget it and continue with\n    // the outer generator.\n    context.delegate = null;\n    return ContinueSentinel;\n  }\n\n  // Define Generator.prototype.{next,throw,return} in terms of the\n  // unified ._invoke helper method.\n  defineIteratorMethods(Gp);\n\n  define(Gp, toStringTagSymbol, \"Generator\");\n\n  // A Generator should always return itself as the iterator object when the\n  // @@iterator function is called on it. Some browsers' implementations of the\n  // iterator prototype chain incorrectly implement this, causing the Generator\n  // object to not be returned from this call. This ensures that doesn't happen.\n  // See https://github.com/facebook/regenerator/issues/274 for more details.\n  define(Gp, iteratorSymbol, function() {\n    return this;\n  });\n\n  define(Gp, \"toString\", function() {\n    return \"[object Generator]\";\n  });\n\n  function pushTryEntry(locs) {\n    var entry = { tryLoc: locs[0] };\n\n    if (1 in locs) {\n      entry.catchLoc = locs[1];\n    }\n\n    if (2 in locs) {\n      entry.finallyLoc = locs[2];\n      entry.afterLoc = locs[3];\n    }\n\n    this.tryEntries.push(entry);\n  }\n\n  function resetTryEntry(entry) {\n    var record = entry.completion || {};\n    record.type = \"normal\";\n    delete record.arg;\n    entry.completion = record;\n  }\n\n  function Context(tryLocsList) {\n    // The root entry object (effectively a try statement without a catch\n    // or a finally block) gives us a place to store values thrown from\n    // locations where there is no enclosing try statement.\n    this.tryEntries = [{ tryLoc: \"root\" }];\n    tryLocsList.forEach(pushTryEntry, this);\n    this.reset(true);\n  }\n\n  exports.keys = function(object) {\n    var keys = [];\n    for (var key in object) {\n      keys.push(key);\n    }\n    keys.reverse();\n\n    // Rather than returning an object with a next method, we keep\n    // things simple and return the next function itself.\n    return function next() {\n      while (keys.length) {\n        var key = keys.pop();\n        if (key in object) {\n          next.value = key;\n          next.done = false;\n          return next;\n        }\n      }\n\n      // To avoid creating an additional object, we just hang the .value\n      // and .done properties off the next function object itself. This\n      // also ensures that the minifier will not anonymize the function.\n      next.done = true;\n      return next;\n    };\n  };\n\n  function values(iterable) {\n    if (iterable) {\n      var iteratorMethod = iterable[iteratorSymbol];\n      if (iteratorMethod) {\n        return iteratorMethod.call(iterable);\n      }\n\n      if (typeof iterable.next === \"function\") {\n        return iterable;\n      }\n\n      if (!isNaN(iterable.length)) {\n        var i = -1, next = function next() {\n          while (++i < iterable.length) {\n            if (hasOwn.call(iterable, i)) {\n              next.value = iterable[i];\n              next.done = false;\n              return next;\n            }\n          }\n\n          next.value = undefined;\n          next.done = true;\n\n          return next;\n        };\n\n        return next.next = next;\n      }\n    }\n\n    // Return an iterator with no values.\n    return { next: doneResult };\n  }\n  exports.values = values;\n\n  function doneResult() {\n    return { value: undefined, done: true };\n  }\n\n  Context.prototype = {\n    constructor: Context,\n\n    reset: function(skipTempReset) {\n      this.prev = 0;\n      this.next = 0;\n      // Resetting context._sent for legacy support of Babel's\n      // function.sent implementation.\n      this.sent = this._sent = undefined;\n      this.done = false;\n      this.delegate = null;\n\n      this.method = \"next\";\n      this.arg = undefined;\n\n      this.tryEntries.forEach(resetTryEntry);\n\n      if (!skipTempReset) {\n        for (var name in this) {\n          // Not sure about the optimal order of these conditions:\n          if (name.charAt(0) === \"t\" &&\n              hasOwn.call(this, name) &&\n              !isNaN(+name.slice(1))) {\n            this[name] = undefined;\n          }\n        }\n      }\n    },\n\n    stop: function() {\n      this.done = true;\n\n      var rootEntry = this.tryEntries[0];\n      var rootRecord = rootEntry.completion;\n      if (rootRecord.type === \"throw\") {\n        throw rootRecord.arg;\n      }\n\n      return this.rval;\n    },\n\n    dispatchException: function(exception) {\n      if (this.done) {\n        throw exception;\n      }\n\n      var context = this;\n      function handle(loc, caught) {\n        record.type = \"throw\";\n        record.arg = exception;\n        context.next = loc;\n\n        if (caught) {\n          // If the dispatched exception was caught by a catch block,\n          // then let that catch block handle the exception normally.\n          context.method = \"next\";\n          context.arg = undefined;\n        }\n\n        return !! caught;\n      }\n\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        var record = entry.completion;\n\n        if (entry.tryLoc === \"root\") {\n          // Exception thrown outside of any try block that could handle\n          // it, so set the completion value of the entire function to\n          // throw the exception.\n          return handle(\"end\");\n        }\n\n        if (entry.tryLoc <= this.prev) {\n          var hasCatch = hasOwn.call(entry, \"catchLoc\");\n          var hasFinally = hasOwn.call(entry, \"finallyLoc\");\n\n          if (hasCatch && hasFinally) {\n            if (this.prev < entry.catchLoc) {\n              return handle(entry.catchLoc, true);\n            } else if (this.prev < entry.finallyLoc) {\n              return handle(entry.finallyLoc);\n            }\n\n          } else if (hasCatch) {\n            if (this.prev < entry.catchLoc) {\n              return handle(entry.catchLoc, true);\n            }\n\n          } else if (hasFinally) {\n            if (this.prev < entry.finallyLoc) {\n              return handle(entry.finallyLoc);\n            }\n\n          } else {\n            throw new Error(\"try statement without catch or finally\");\n          }\n        }\n      }\n    },\n\n    abrupt: function(type, arg) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.tryLoc <= this.prev &&\n            hasOwn.call(entry, \"finallyLoc\") &&\n            this.prev < entry.finallyLoc) {\n          var finallyEntry = entry;\n          break;\n        }\n      }\n\n      if (finallyEntry &&\n          (type === \"break\" ||\n           type === \"continue\") &&\n          finallyEntry.tryLoc <= arg &&\n          arg <= finallyEntry.finallyLoc) {\n        // Ignore the finally entry if control is not jumping to a\n        // location outside the try/catch block.\n        finallyEntry = null;\n      }\n\n      var record = finallyEntry ? finallyEntry.completion : {};\n      record.type = type;\n      record.arg = arg;\n\n      if (finallyEntry) {\n        this.method = \"next\";\n        this.next = finallyEntry.finallyLoc;\n        return ContinueSentinel;\n      }\n\n      return this.complete(record);\n    },\n\n    complete: function(record, afterLoc) {\n      if (record.type === \"throw\") {\n        throw record.arg;\n      }\n\n      if (record.type === \"break\" ||\n          record.type === \"continue\") {\n        this.next = record.arg;\n      } else if (record.type === \"return\") {\n        this.rval = this.arg = record.arg;\n        this.method = \"return\";\n        this.next = \"end\";\n      } else if (record.type === \"normal\" && afterLoc) {\n        this.next = afterLoc;\n      }\n\n      return ContinueSentinel;\n    },\n\n    finish: function(finallyLoc) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.finallyLoc === finallyLoc) {\n          this.complete(entry.completion, entry.afterLoc);\n          resetTryEntry(entry);\n          return ContinueSentinel;\n        }\n      }\n    },\n\n    \"catch\": function(tryLoc) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.tryLoc === tryLoc) {\n          var record = entry.completion;\n          if (record.type === \"throw\") {\n            var thrown = record.arg;\n            resetTryEntry(entry);\n          }\n          return thrown;\n        }\n      }\n\n      // The context.catch method must only be called with a location\n      // argument that corresponds to a known catch block.\n      throw new Error(\"illegal catch attempt\");\n    },\n\n    delegateYield: function(iterable, resultName, nextLoc) {\n      this.delegate = {\n        iterator: values(iterable),\n        resultName: resultName,\n        nextLoc: nextLoc\n      };\n\n      if (this.method === \"next\") {\n        // Deliberately forget the last sent value so that we don't\n        // accidentally pass it on to the delegate.\n        this.arg = undefined;\n      }\n\n      return ContinueSentinel;\n    }\n  };\n\n  // Regardless of whether this script is executing as a CommonJS module\n  // or not, return the runtime object so that we can declare the variable\n  // regeneratorRuntime in the outer scope, which allows this module to be\n  // injected easily by `bin/regenerator --include-runtime script.js`.\n  return exports;\n\n}(\n  // If this script is executing as a CommonJS module, use module.exports\n  // as the regeneratorRuntime namespace. Otherwise create a new empty\n  // object. Either way, the resulting object will be used to initialize\n  // the regeneratorRuntime variable at the top of this file.\n  typeof module === \"object\" ? module.exports : {}\n));\n\ntry {\n  regeneratorRuntime = runtime;\n} catch (accidentalStrictMode) {\n  // This module should not be running in strict mode, so the above\n  // assignment should always work unless something is misconfigured. Just\n  // in case runtime.js accidentally runs in strict mode, in modern engines\n  // we can explicitly access globalThis. In older engines we can escape\n  // strict mode using a global Function call. This could conceivably fail\n  // if a Content Security Policy forbids using Function, but in that case\n  // the proper solution is to fix the accidental strict mode problem. If\n  // you've misconfigured your bundler to force strict mode and applied a\n  // CSP to forbid Function, and you're not willing to fix either of those\n  // problems, please detail your unique predicament in a GitHub issue.\n  if (typeof globalThis === \"object\") {\n    globalThis.regeneratorRuntime = runtime;\n  } else {\n    Function(\"r\", \"regeneratorRuntime = r\")(runtime);\n  }\n}\n","module.exports = require(\"regenerator-runtime\");\n"],"names":["asyncGeneratorStep","gen","resolve","reject","_next","_throw","key","arg","info","value","error","done","Promise","then","_asyncToGenerator","fn","self","args","arguments","apply","err","undefined","runtime","exports","Op","Object","prototype","hasOwn","hasOwnProperty","$Symbol","Symbol","iteratorSymbol","iterator","asyncIteratorSymbol","asyncIterator","toStringTagSymbol","toStringTag","define","obj","defineProperty","enumerable","configurable","writable","wrap","innerFn","outerFn","tryLocsList","protoGenerator","Generator","generator","create","context","Context","_invoke","makeInvokeMethod","tryCatch","type","call","GenStateSuspendedStart","GenStateSuspendedYield","GenStateExecuting","GenStateCompleted","ContinueSentinel","GeneratorFunction","GeneratorFunctionPrototype","IteratorPrototype","getProto","getPrototypeOf","NativeIteratorPrototype","values","Gp","displayName","defineIteratorMethods","forEach","method","isGeneratorFunction","genFun","ctor","constructor","name","mark","setPrototypeOf","__proto__","awrap","__await","AsyncIterator","PromiseImpl","invoke","record","result","unwrapped","previousPromise","enqueue","callInvokeWithMethodAndArg","async","iter","next","state","Error","doneResult","delegate","delegateResult","maybeInvokeDelegate","sent","_sent","dispatchException","abrupt","TypeError","resultName","nextLoc","pushTryEntry","locs","entry","tryLoc","catchLoc","finallyLoc","afterLoc","tryEntries","push","resetTryEntry","completion","reset","keys","object","reverse","length","pop","iterable","iteratorMethod","isNaN","i","skipTempReset","prev","charAt","slice","stop","rootEntry","rootRecord","rval","exception","handle","loc","caught","hasCatch","hasFinally","finallyEntry","complete","finish","thrown","delegateYield","module","regeneratorRuntime","accidentalStrictMode","globalThis","Function","regenerator","require$$0"],"mappings":";;;;;;;;;AAAA,SAASA,kBAAT,CAA4BC,GAA5B,EAAiCC,OAAjC,EAA0CC,MAA1C,EAAkDC,KAAlD,EAAyDC,MAAzD,EAAiEC,GAAjE,EAAsEC,GAAtE,EAA2E;EACzE,IAAI;IACF,IAAIC,IAAI,GAAGP,GAAG,CAACK,GAAD,CAAH,CAASC,GAAT,CAAX,CAAA;AACA,IAAA,IAAIE,KAAK,GAAGD,IAAI,CAACC,KAAjB,CAAA;GAFF,CAGE,OAAOC,KAAP,EAAc;IACdP,MAAM,CAACO,KAAD,CAAN,CAAA;AACA,IAAA,OAAA;AACD,GAAA;;EAED,IAAIF,IAAI,CAACG,IAAT,EAAe;IACbT,OAAO,CAACO,KAAD,CAAP,CAAA;AACD,GAFD,MAEO;IACLG,OAAO,CAACV,OAAR,CAAgBO,KAAhB,EAAuBI,IAAvB,CAA4BT,KAA5B,EAAmCC,MAAnC,CAAA,CAAA;AACD,GAAA;AACF,CAAA;;AAEc,SAASS,iBAAT,CAA2BC,EAA3B,EAA+B;AAC5C,EAAA,OAAO,YAAY;IACjB,IAAIC,IAAI,GAAG,IAAX;QACIC,IAAI,GAAGC,SADX,CAAA;AAEA,IAAA,OAAO,IAAIN,OAAJ,CAAY,UAAUV,OAAV,EAAmBC,MAAnB,EAA2B;MAC5C,IAAIF,GAAG,GAAGc,EAAE,CAACI,KAAH,CAASH,IAAT,EAAeC,IAAf,CAAV,CAAA;;MAEA,SAASb,KAAT,CAAeK,KAAf,EAAsB;AACpBT,QAAAA,kBAAkB,CAACC,GAAD,EAAMC,OAAN,EAAeC,MAAf,EAAuBC,KAAvB,EAA8BC,MAA9B,EAAsC,MAAtC,EAA8CI,KAA9C,CAAlB,CAAA;AACD,OAAA;;MAED,SAASJ,MAAT,CAAgBe,GAAhB,EAAqB;AACnBpB,QAAAA,kBAAkB,CAACC,GAAD,EAAMC,OAAN,EAAeC,MAAf,EAAuBC,KAAvB,EAA8BC,MAA9B,EAAsC,OAAtC,EAA+Ce,GAA/C,CAAlB,CAAA;AACD,OAAA;;MAEDhB,KAAK,CAACiB,SAAD,CAAL,CAAA;AACD,KAZM,CAAP,CAAA;GAHF,CAAA;AAiBD;;;;;AC3BD,EAAA,IAAIC,OAAO,GAAI,UAAUC,OAAV,EAAmB;AAChC,IAAA,YAAA,CAAA;;AAEA,IAAA,IAAIC,EAAE,GAAGC,MAAM,CAACC,SAAhB,CAAA;AACA,IAAA,IAAIC,MAAM,GAAGH,EAAE,CAACI,cAAhB,CAAA;IACA,IAAIP,WAAJ,CALgC;;IAMhC,IAAIQ,OAAO,GAAG,OAAOC,MAAP,KAAkB,UAAlB,GAA+BA,MAA/B,GAAwC,EAAtD,CAAA;AACA,IAAA,IAAIC,cAAc,GAAGF,OAAO,CAACG,QAAR,IAAoB,YAAzC,CAAA;AACA,IAAA,IAAIC,mBAAmB,GAAGJ,OAAO,CAACK,aAAR,IAAyB,iBAAnD,CAAA;AACA,IAAA,IAAIC,iBAAiB,GAAGN,OAAO,CAACO,WAAR,IAAuB,eAA/C,CAAA;;AAEA,IAAA,SAASC,MAAT,CAAgBC,GAAhB,EAAqBhC,GAArB,EAA0BG,KAA1B,EAAiC;AAC/BgB,MAAAA,MAAM,CAACc,cAAP,CAAsBD,GAAtB,EAA2BhC,GAA3B,EAAgC;AAC9BG,QAAAA,KAAK,EAAEA,KADuB;AAE9B+B,QAAAA,UAAU,EAAE,IAFkB;AAG9BC,QAAAA,YAAY,EAAE,IAHgB;AAI9BC,QAAAA,QAAQ,EAAE,IAAA;OAJZ,CAAA,CAAA;MAMA,OAAOJ,GAAG,CAAChC,GAAD,CAAV,CAAA;AACD,KAAA;;IACD,IAAI;AACN;AACI+B,MAAAA,MAAM,CAAC,EAAD,EAAK,EAAL,CAAN,CAAA;KAFF,CAGE,OAAOjB,GAAP,EAAY;AACZiB,MAAAA,MAAM,GAAG,SAASC,MAAAA,CAAAA,GAAT,EAAchC,GAAd,EAAmBG,KAAnB,EAA0B;AACjC,QAAA,OAAO6B,GAAG,CAAChC,GAAD,CAAH,GAAWG,KAAlB,CAAA;OADF,CAAA;AAGD,KAAA;;IAED,SAASkC,IAAT,CAAcC,OAAd,EAAuBC,OAAvB,EAAgC7B,IAAhC,EAAsC8B,WAAtC,EAAmD;AACrD;AACI,MAAA,IAAIC,cAAc,GAAGF,OAAO,IAAIA,OAAO,CAACnB,SAAR,YAA6BsB,SAAxC,GAAoDH,OAApD,GAA8DG,SAAnF,CAAA;MACA,IAAIC,SAAS,GAAGxB,MAAM,CAACyB,MAAP,CAAcH,cAAc,CAACrB,SAA7B,CAAhB,CAAA;MACA,IAAIyB,OAAO,GAAG,IAAIC,OAAJ,CAAYN,WAAW,IAAI,EAA3B,CAAd,CAJiD;AAOrD;;MACIG,SAAS,CAACI,OAAV,GAAoBC,gBAAgB,CAACV,OAAD,EAAU5B,IAAV,EAAgBmC,OAAhB,CAApC,CAAA;AAEA,MAAA,OAAOF,SAAP,CAAA;AACD,KAAA;;AACD1B,IAAAA,OAAO,CAACoB,IAAR,GAAeA,IAAf,CAzCgC;AA4ClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACE,IAAA,SAASY,QAAT,CAAkBxC,EAAlB,EAAsBuB,GAAtB,EAA2B/B,GAA3B,EAAgC;MAC9B,IAAI;QACF,OAAO;AAAEiD,UAAAA,IAAI,EAAE,QAAR;AAAkBjD,UAAAA,GAAG,EAAEQ,EAAE,CAAC0C,IAAH,CAAQnB,GAAR,EAAa/B,GAAb,CAAA;SAA9B,CAAA;OADF,CAEE,OAAOa,GAAP,EAAY;QACZ,OAAO;AAAEoC,UAAAA,IAAI,EAAE,OAAR;AAAiBjD,UAAAA,GAAG,EAAEa,GAAAA;SAA7B,CAAA;AACD,OAAA;AACF,KAAA;;IAED,IAAIsC,sBAAsB,GAAG,gBAA7B,CAAA;IACA,IAAIC,sBAAsB,GAAG,gBAA7B,CAAA;IACA,IAAIC,iBAAiB,GAAG,WAAxB,CAAA;AACA,IAAA,IAAIC,iBAAiB,GAAG,WAAxB,CAhEgC;AAmElC;;AACE,IAAA,IAAIC,gBAAgB,GAAG,EAAvB,CApEgC;AAuElC;AACA;AACA;;IACE,SAASd,SAAT,GAAqB,EAAE;;IACvB,SAASe,iBAAT,GAA6B,EAAE;;AAC/B,IAAA,SAASC,0BAAT,GAAsC,EA5EN;AA+ElC;;;IACE,IAAIC,iBAAiB,GAAG,EAAxB,CAAA;AACA5B,IAAAA,MAAM,CAAC4B,iBAAD,EAAoBlC,cAApB,EAAoC,YAAY;AACpD,MAAA,OAAO,IAAP,CAAA;AACD,KAFK,CAAN,CAAA;AAIA,IAAA,IAAImC,QAAQ,GAAGzC,MAAM,CAAC0C,cAAtB,CAAA;AACA,IAAA,IAAIC,uBAAuB,GAAGF,QAAQ,IAAIA,QAAQ,CAACA,QAAQ,CAACG,MAAM,CAAC,EAAD,CAAP,CAAT,CAAlD,CAAA;;AACA,IAAA,IAAID,uBAAuB,IACvBA,uBAAuB,KAAK5C,EAD5B,IAEAG,MAAM,CAAC8B,IAAP,CAAYW,uBAAZ,EAAqCrC,cAArC,CAFJ,EAE0D;AAC5D;AACA;AACIkC,MAAAA,iBAAiB,GAAGG,uBAApB,CAAA;AACD,KAAA;;AAED,IAAA,IAAIE,EAAE,GAAGN,0BAA0B,CAACtC,SAA3B,GACPsB,SAAS,CAACtB,SAAV,GAAsBD,MAAM,CAACyB,MAAP,CAAce,iBAAd,CADxB,CAAA;IAEAF,iBAAiB,CAACrC,SAAlB,GAA8BsC,0BAA9B,CAAA;AACA3B,IAAAA,MAAM,CAACiC,EAAD,EAAK,aAAL,EAAoBN,0BAApB,CAAN,CAAA;AACA3B,IAAAA,MAAM,CAAC2B,0BAAD,EAA6B,aAA7B,EAA4CD,iBAA5C,CAAN,CAAA;AACAA,IAAAA,iBAAiB,CAACQ,WAAlB,GAAgClC,MAAM,CACpC2B,0BADoC,EAEpC7B,iBAFoC,EAGpC,mBAHoC,CAAtC,CApGgC;AA2GlC;;IACE,SAASqC,qBAAT,CAA+B9C,SAA/B,EAA0C;MACxC,CAAC,MAAD,EAAS,OAAT,EAAkB,QAAlB,EAA4B+C,OAA5B,CAAoC,UAASC,MAAT,EAAiB;AACnDrC,QAAAA,MAAM,CAACX,SAAD,EAAYgD,MAAZ,EAAoB,UAASnE,GAAT,EAAc;AACtC,UAAA,OAAO,KAAK8C,OAAL,CAAaqB,MAAb,EAAqBnE,GAArB,CAAP,CAAA;AACD,SAFK,CAAN,CAAA;OADF,CAAA,CAAA;AAKD,KAAA;;AAEDgB,IAAAA,OAAO,CAACoD,mBAAR,GAA8B,UAASC,MAAT,EAAiB;MAC7C,IAAIC,IAAI,GAAG,OAAOD,MAAP,KAAkB,UAAlB,IAAgCA,MAAM,CAACE,WAAlD,CAAA;AACA,MAAA,OAAOD,IAAI,GACPA,IAAI,KAAKd,iBAAT;AAER;MACQ,CAACc,IAAI,CAACN,WAAL,IAAoBM,IAAI,CAACE,IAA1B,MAAoC,mBAJ7B,GAKP,KALJ,CAAA;KAFF,CAAA;;AAUAxD,IAAAA,OAAO,CAACyD,IAAR,GAAe,UAASJ,MAAT,EAAiB;MAC9B,IAAInD,MAAM,CAACwD,cAAX,EAA2B;AACzBxD,QAAAA,MAAM,CAACwD,cAAP,CAAsBL,MAAtB,EAA8BZ,0BAA9B,CAAA,CAAA;AACD,OAFD,MAEO;QACLY,MAAM,CAACM,SAAP,GAAmBlB,0BAAnB,CAAA;AACA3B,QAAAA,MAAM,CAACuC,MAAD,EAASzC,iBAAT,EAA4B,mBAA5B,CAAN,CAAA;AACD,OAAA;;MACDyC,MAAM,CAAClD,SAAP,GAAmBD,MAAM,CAACyB,MAAP,CAAcoB,EAAd,CAAnB,CAAA;AACA,MAAA,OAAOM,MAAP,CAAA;AACD,KATD,CA9HgC;AA0IlC;AACA;AACA;;;AACErD,IAAAA,OAAO,CAAC4D,KAAR,GAAgB,UAAS5E,GAAT,EAAc;MAC5B,OAAO;AAAE6E,QAAAA,OAAO,EAAE7E,GAAAA;OAAlB,CAAA;KADF,CAAA;;AAIA,IAAA,SAAS8E,aAAT,CAAuBpC,SAAvB,EAAkCqC,WAAlC,EAA+C;MAC7C,SAASC,MAAT,CAAgBb,MAAhB,EAAwBnE,GAAxB,EAA6BL,OAA7B,EAAsCC,MAAtC,EAA8C;AAC5C,QAAA,IAAIqF,MAAM,GAAGjC,QAAQ,CAACN,SAAS,CAACyB,MAAD,CAAV,EAAoBzB,SAApB,EAA+B1C,GAA/B,CAArB,CAAA;;AACA,QAAA,IAAIiF,MAAM,CAAChC,IAAP,KAAgB,OAApB,EAA6B;AAC3BrD,UAAAA,MAAM,CAACqF,MAAM,CAACjF,GAAR,CAAN,CAAA;AACD,SAFD,MAEO;AACL,UAAA,IAAIkF,MAAM,GAAGD,MAAM,CAACjF,GAApB,CAAA;AACA,UAAA,IAAIE,KAAK,GAAGgF,MAAM,CAAChF,KAAnB,CAAA;;AACA,UAAA,IAAIA,KAAK,IACL,OAAOA,CAAAA,KAAP,MAAiB,QADjB,IAEAkB,MAAM,CAAC8B,IAAP,CAAYhD,KAAZ,EAAmB,SAAnB,CAFJ,EAEmC;AACjC,YAAA,OAAO6E,WAAW,CAACpF,OAAZ,CAAoBO,KAAK,CAAC2E,OAA1B,CAAA,CAAmCvE,IAAnC,CAAwC,UAASJ,KAAT,EAAgB;cAC7D8E,MAAM,CAAC,MAAD,EAAS9E,KAAT,EAAgBP,OAAhB,EAAyBC,MAAzB,CAAN,CAAA;aADK,EAEJ,UAASiB,GAAT,EAAc;cACfmE,MAAM,CAAC,OAAD,EAAUnE,GAAV,EAAelB,OAAf,EAAwBC,MAAxB,CAAN,CAAA;AACD,aAJM,CAAP,CAAA;AAKD,WAAA;;UAED,OAAOmF,WAAW,CAACpF,OAAZ,CAAoBO,KAApB,EAA2BI,IAA3B,CAAgC,UAAS6E,SAAT,EAAoB;AACnE;AACA;AACA;YACUD,MAAM,CAAChF,KAAP,GAAeiF,SAAf,CAAA;YACAxF,OAAO,CAACuF,MAAD,CAAP,CAAA;WALK,EAMJ,UAAS/E,KAAT,EAAgB;AAC3B;AACA;YACU,OAAO6E,MAAM,CAAC,OAAD,EAAU7E,KAAV,EAAiBR,OAAjB,EAA0BC,MAA1B,CAAb,CAAA;AACD,WAVM,CAAP,CAAA;AAWD,SAAA;AACF,OAAA;;AAED,MAAA,IAAIwF,eAAJ,CAAA;;AAEA,MAAA,SAASC,OAAT,CAAiBlB,MAAjB,EAAyBnE,GAAzB,EAA8B;AAC5B,QAAA,SAASsF,0BAAT,GAAsC;AACpC,UAAA,OAAO,IAAIP,WAAJ,CAAgB,UAASpF,OAAT,EAAkBC,MAAlB,EAA0B;YAC/CoF,MAAM,CAACb,MAAD,EAASnE,GAAT,EAAcL,OAAd,EAAuBC,MAAvB,CAAN,CAAA;AACD,WAFM,CAAP,CAAA;AAGD,SAAA;;AAED,QAAA,OAAOwF,eAAe;AAE5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACQA,QAAAA,eAAe,GAAGA,eAAe,CAAC9E,IAAhB,CAChBgF,0BADgB;AAG1B;QACUA,0BAJgB,CAAH,GAKXA,0BAA0B,EAlBhC,CAAA;AAmBD,OA5D4C;AA+DjD;;;MACI,IAAKxC,CAAAA,OAAL,GAAeuC,OAAf,CAAA;AACD,KAAA;;AAEDpB,IAAAA,qBAAqB,CAACa,aAAa,CAAC3D,SAAf,CAArB,CAAA;AACAW,IAAAA,MAAM,CAACgD,aAAa,CAAC3D,SAAf,EAA0BO,mBAA1B,EAA+C,YAAY;AAC/D,MAAA,OAAO,IAAP,CAAA;AACD,KAFK,CAAN,CAAA;AAGAV,IAAAA,OAAO,CAAC8D,aAAR,GAAwBA,aAAxB,CAxNgC;AA2NlC;AACA;;AACE9D,IAAAA,OAAO,CAACuE,KAAR,GAAgB,UAASlD,OAAT,EAAkBC,OAAlB,EAA2B7B,IAA3B,EAAiC8B,WAAjC,EAA8CwC,WAA9C,EAA2D;AACzE,MAAA,IAAIA,WAAW,KAAK,KAAK,CAAzB,EAA4BA,WAAW,GAAG1E,OAAd,CAAA;AAE5B,MAAA,IAAImF,IAAI,GAAG,IAAIV,aAAJ,CACT1C,IAAI,CAACC,OAAD,EAAUC,OAAV,EAAmB7B,IAAnB,EAAyB8B,WAAzB,CADK,EAETwC,WAFS,CAAX,CAAA;AAKA,MAAA,OAAO/D,OAAO,CAACoD,mBAAR,CAA4B9B,OAA5B,CAAA,GACHkD,IADG;QAEHA,IAAI,CAACC,IAAL,EAAA,CAAYnF,IAAZ,CAAiB,UAAS4E,MAAT,EAAiB;QAChC,OAAOA,MAAM,CAAC9E,IAAP,GAAc8E,MAAM,CAAChF,KAArB,GAA6BsF,IAAI,CAACC,IAAL,EAApC,CAAA;AACD,OAFD,CAFJ,CAAA;KARF,CAAA;;AAeA,IAAA,SAAS1C,gBAAT,CAA0BV,OAA1B,EAAmC5B,IAAnC,EAAyCmC,OAAzC,EAAkD;MAChD,IAAI8C,KAAK,GAAGvC,sBAAZ,CAAA;AAEA,MAAA,OAAO,SAAS6B,MAAT,CAAgBb,MAAhB,EAAwBnE,GAAxB,EAA6B;QAClC,IAAI0F,KAAK,KAAKrC,iBAAd,EAAiC;AAC/B,UAAA,MAAM,IAAIsC,KAAJ,CAAU,8BAAV,CAAN,CAAA;AACD,SAAA;;QAED,IAAID,KAAK,KAAKpC,iBAAd,EAAiC;UAC/B,IAAIa,MAAM,KAAK,OAAf,EAAwB;AACtB,YAAA,MAAMnE,GAAN,CAAA;AACD,WAH8B;AAMvC;;;AACQ,UAAA,OAAO4F,UAAU,EAAjB,CAAA;AACD,SAAA;;QAEDhD,OAAO,CAACuB,MAAR,GAAiBA,MAAjB,CAAA;QACAvB,OAAO,CAAC5C,GAAR,GAAcA,GAAd,CAAA;;AAEA,QAAA,OAAO,IAAP,EAAa;AACX,UAAA,IAAI6F,QAAQ,GAAGjD,OAAO,CAACiD,QAAvB,CAAA;;AACA,UAAA,IAAIA,QAAJ,EAAc;AACZ,YAAA,IAAIC,cAAc,GAAGC,mBAAmB,CAACF,QAAD,EAAWjD,OAAX,CAAxC,CAAA;;AACA,YAAA,IAAIkD,cAAJ,EAAoB;cAClB,IAAIA,cAAc,KAAKvC,gBAAvB,EAAyC,SAAA;AACzC,cAAA,OAAOuC,cAAP,CAAA;AACD,aAAA;AACF,WAAA;;AAED,UAAA,IAAIlD,OAAO,CAACuB,MAAR,KAAmB,MAAvB,EAA+B;AACvC;AACA;YACUvB,OAAO,CAACoD,IAAR,GAAepD,OAAO,CAACqD,KAAR,GAAgBrD,OAAO,CAAC5C,GAAvC,CAAA;AAED,WALD,MAKO,IAAI4C,OAAO,CAACuB,MAAR,KAAmB,OAAvB,EAAgC;YACrC,IAAIuB,KAAK,KAAKvC,sBAAd,EAAsC;AACpCuC,cAAAA,KAAK,GAAGpC,iBAAR,CAAA;cACA,MAAMV,OAAO,CAAC5C,GAAd,CAAA;AACD,aAAA;;AAED4C,YAAAA,OAAO,CAACsD,iBAAR,CAA0BtD,OAAO,CAAC5C,GAAlC,CAAA,CAAA;AAED,WARM,MAQA,IAAI4C,OAAO,CAACuB,MAAR,KAAmB,QAAvB,EAAiC;AACtCvB,YAAAA,OAAO,CAACuD,MAAR,CAAe,QAAf,EAAyBvD,OAAO,CAAC5C,GAAjC,CAAA,CAAA;AACD,WAAA;;AAED0F,UAAAA,KAAK,GAAGrC,iBAAR,CAAA;UAEA,IAAI4B,MAAM,GAAGjC,QAAQ,CAACX,OAAD,EAAU5B,IAAV,EAAgBmC,OAAhB,CAArB,CAAA;;AACA,UAAA,IAAIqC,MAAM,CAAChC,IAAP,KAAgB,QAApB,EAA8B;AACtC;AACA;AACUyC,YAAAA,KAAK,GAAG9C,OAAO,CAACxC,IAAR,GACJkD,iBADI,GAEJF,sBAFJ,CAAA;;AAIA,YAAA,IAAI6B,MAAM,CAACjF,GAAP,KAAeuD,gBAAnB,EAAqC;AACnC,cAAA,SAAA;AACD,aAAA;;YAED,OAAO;cACLrD,KAAK,EAAE+E,MAAM,CAACjF,GADT;cAELI,IAAI,EAAEwC,OAAO,CAACxC,IAAAA;aAFhB,CAAA;AAKD,WAhBD,MAgBO,IAAI6E,MAAM,CAAChC,IAAP,KAAgB,OAApB,EAA6B;YAClCyC,KAAK,GAAGpC,iBAAR,CADkC;AAG5C;;YACUV,OAAO,CAACuB,MAAR,GAAiB,OAAjB,CAAA;AACAvB,YAAAA,OAAO,CAAC5C,GAAR,GAAciF,MAAM,CAACjF,GAArB,CAAA;AACD,WAAA;AACF,SAAA;OAvEH,CAAA;AAyED,KAxT+B;AA2TlC;AACA;AACA;;;AACE,IAAA,SAAS+F,mBAAT,CAA6BF,QAA7B,EAAuCjD,OAAvC,EAAgD;MAC9C,IAAIuB,MAAM,GAAG0B,QAAQ,CAACpE,QAAT,CAAkBmB,OAAO,CAACuB,MAA1B,CAAb,CAAA;;MACA,IAAIA,MAAM,KAAKrD,WAAf,EAA0B;AAC9B;AACA;QACM8B,OAAO,CAACiD,QAAR,GAAmB,IAAnB,CAAA;;AAEA,QAAA,IAAIjD,OAAO,CAACuB,MAAR,KAAmB,OAAvB,EAAgC;AACtC;AACQ,UAAA,IAAI0B,QAAQ,CAACpE,QAAT,CAAkB,QAAlB,CAAJ,EAAiC;AACzC;AACA;YACUmB,OAAO,CAACuB,MAAR,GAAiB,QAAjB,CAAA;YACAvB,OAAO,CAAC5C,GAAR,GAAcc,WAAd,CAAA;AACAiF,YAAAA,mBAAmB,CAACF,QAAD,EAAWjD,OAAX,CAAnB,CAAA;;AAEA,YAAA,IAAIA,OAAO,CAACuB,MAAR,KAAmB,OAAvB,EAAgC;AAC1C;AACA;AACY,cAAA,OAAOZ,gBAAP,CAAA;AACD,aAAA;AACF,WAAA;;UAEDX,OAAO,CAACuB,MAAR,GAAiB,OAAjB,CAAA;AACAvB,UAAAA,OAAO,CAAC5C,GAAR,GAAc,IAAIoG,SAAJ,CACZ,gDADY,CAAd,CAAA;AAED,SAAA;;AAED,QAAA,OAAO7C,gBAAP,CAAA;AACD,OAAA;;AAED,MAAA,IAAI0B,MAAM,GAAGjC,QAAQ,CAACmB,MAAD,EAAS0B,QAAQ,CAACpE,QAAlB,EAA4BmB,OAAO,CAAC5C,GAApC,CAArB,CAAA;;AAEA,MAAA,IAAIiF,MAAM,CAAChC,IAAP,KAAgB,OAApB,EAA6B;QAC3BL,OAAO,CAACuB,MAAR,GAAiB,OAAjB,CAAA;AACAvB,QAAAA,OAAO,CAAC5C,GAAR,GAAciF,MAAM,CAACjF,GAArB,CAAA;QACA4C,OAAO,CAACiD,QAAR,GAAmB,IAAnB,CAAA;AACA,QAAA,OAAOtC,gBAAP,CAAA;AACD,OAAA;;AAED,MAAA,IAAItD,IAAI,GAAGgF,MAAM,CAACjF,GAAlB,CAAA;;MAEA,IAAI,CAAEC,IAAN,EAAY;QACV2C,OAAO,CAACuB,MAAR,GAAiB,OAAjB,CAAA;AACAvB,QAAAA,OAAO,CAAC5C,GAAR,GAAc,IAAIoG,SAAJ,CAAc,kCAAd,CAAd,CAAA;QACAxD,OAAO,CAACiD,QAAR,GAAmB,IAAnB,CAAA;AACA,QAAA,OAAOtC,gBAAP,CAAA;AACD,OAAA;;MAED,IAAItD,IAAI,CAACG,IAAT,EAAe;AACnB;AACA;QACMwC,OAAO,CAACiD,QAAQ,CAACQ,UAAV,CAAP,GAA+BpG,IAAI,CAACC,KAApC,CAHa;;AAMb0C,QAAAA,OAAO,CAAC6C,IAAR,GAAeI,QAAQ,CAACS,OAAxB,CANa;AASnB;AACA;AACA;AACA;AACA;;AACM,QAAA,IAAI1D,OAAO,CAACuB,MAAR,KAAmB,QAAvB,EAAiC;UAC/BvB,OAAO,CAACuB,MAAR,GAAiB,MAAjB,CAAA;UACAvB,OAAO,CAAC5C,GAAR,GAAcc,WAAd,CAAA;AACD,SAAA;AAEF,OAnBD,MAmBO;AACX;AACM,QAAA,OAAOb,IAAP,CAAA;AACD,OAvE6C;AA0ElD;;;MACI2C,OAAO,CAACiD,QAAR,GAAmB,IAAnB,CAAA;AACA,MAAA,OAAOtC,gBAAP,CAAA;AACD,KA3Y+B;AA8YlC;;;IACEU,qBAAqB,CAACF,EAAD,CAArB,CAAA;IAEAjC,MAAM,CAACiC,EAAD,EAAKnC,iBAAL,EAAwB,WAAxB,CAAN,CAjZgC;AAoZlC;AACA;AACA;AACA;;AACEE,IAAAA,MAAM,CAACiC,EAAD,EAAKvC,cAAL,EAAqB,YAAW;AACpC,MAAA,OAAO,IAAP,CAAA;AACD,KAFK,CAAN,CAAA;AAIAM,IAAAA,MAAM,CAACiC,EAAD,EAAK,UAAL,EAAiB,YAAW;AAChC,MAAA,OAAO,oBAAP,CAAA;AACD,KAFK,CAAN,CAAA;;IAIA,SAASwC,YAAT,CAAsBC,IAAtB,EAA4B;AAC1B,MAAA,IAAIC,KAAK,GAAG;QAAEC,MAAM,EAAEF,IAAI,CAAC,CAAD,CAAA;OAA1B,CAAA;;MAEA,IAAI,CAAA,IAAKA,IAAT,EAAe;AACbC,QAAAA,KAAK,CAACE,QAAN,GAAiBH,IAAI,CAAC,CAAD,CAArB,CAAA;AACD,OAAA;;MAED,IAAI,CAAA,IAAKA,IAAT,EAAe;AACbC,QAAAA,KAAK,CAACG,UAAN,GAAmBJ,IAAI,CAAC,CAAD,CAAvB,CAAA;AACAC,QAAAA,KAAK,CAACI,QAAN,GAAiBL,IAAI,CAAC,CAAD,CAArB,CAAA;AACD,OAAA;;AAED,MAAA,IAAA,CAAKM,UAAL,CAAgBC,IAAhB,CAAqBN,KAArB,CAAA,CAAA;AACD,KAAA;;IAED,SAASO,aAAT,CAAuBP,KAAvB,EAA8B;AAC5B,MAAA,IAAIxB,MAAM,GAAGwB,KAAK,CAACQ,UAAN,IAAoB,EAAjC,CAAA;MACAhC,MAAM,CAAChC,IAAP,GAAc,QAAd,CAAA;MACA,OAAOgC,MAAM,CAACjF,GAAd,CAAA;MACAyG,KAAK,CAACQ,UAAN,GAAmBhC,MAAnB,CAAA;AACD,KAAA;;IAED,SAASpC,OAAT,CAAiBN,WAAjB,EAA8B;AAChC;AACA;AACA;MACI,IAAKuE,CAAAA,UAAL,GAAkB,CAAC;AAAEJ,QAAAA,MAAM,EAAE,MAAA;AAAV,OAAD,CAAlB,CAAA;AACAnE,MAAAA,WAAW,CAAC2B,OAAZ,CAAoBqC,YAApB,EAAkC,IAAlC,CAAA,CAAA;MACA,IAAKW,CAAAA,KAAL,CAAW,IAAX,CAAA,CAAA;AACD,KAAA;;AAEDlG,IAAAA,OAAO,CAACmG,IAAR,GAAe,UAASC,MAAT,EAAiB;MAC9B,IAAID,IAAI,GAAG,EAAX,CAAA;;AACA,MAAA,KAAK,IAAIpH,GAAT,IAAgBqH,MAAhB,EAAwB;QACtBD,IAAI,CAACJ,IAAL,CAAUhH,GAAV,CAAA,CAAA;AACD,OAAA;;MACDoH,IAAI,CAACE,OAAL,EAAA,CAL8B;AAQlC;;MACI,OAAO,SAAS5B,IAAT,GAAgB;QACrB,OAAO0B,IAAI,CAACG,MAAZ,EAAoB;AAClB,UAAA,IAAIvH,GAAG,GAAGoH,IAAI,CAACI,GAAL,EAAV,CAAA;;UACA,IAAIxH,GAAG,IAAIqH,MAAX,EAAmB;YACjB3B,IAAI,CAACvF,KAAL,GAAaH,GAAb,CAAA;YACA0F,IAAI,CAACrF,IAAL,GAAY,KAAZ,CAAA;AACA,YAAA,OAAOqF,IAAP,CAAA;AACD,WAAA;AACF,SARoB;AAW3B;AACA;;;QACMA,IAAI,CAACrF,IAAL,GAAY,IAAZ,CAAA;AACA,QAAA,OAAOqF,IAAP,CAAA;OAdF,CAAA;KATF,CAAA;;IA2BA,SAAS3B,MAAT,CAAgB0D,QAAhB,EAA0B;AACxB,MAAA,IAAIA,QAAJ,EAAc;AACZ,QAAA,IAAIC,cAAc,GAAGD,QAAQ,CAAChG,cAAD,CAA7B,CAAA;;AACA,QAAA,IAAIiG,cAAJ,EAAoB;AAClB,UAAA,OAAOA,cAAc,CAACvE,IAAf,CAAoBsE,QAApB,CAAP,CAAA;AACD,SAAA;;AAED,QAAA,IAAI,OAAOA,QAAQ,CAAC/B,IAAhB,KAAyB,UAA7B,EAAyC;AACvC,UAAA,OAAO+B,QAAP,CAAA;AACD,SAAA;;AAED,QAAA,IAAI,CAACE,KAAK,CAACF,QAAQ,CAACF,MAAV,CAAV,EAA6B;UAC3B,IAAIK,CAAC,GAAG,CAAC,CAAT;AAAA,cAAYlC,IAAI,GAAG,SAASA,IAAT,GAAgB;AACjC,YAAA,OAAO,EAAEkC,CAAF,GAAMH,QAAQ,CAACF,MAAtB,EAA8B;cAC5B,IAAIlG,MAAM,CAAC8B,IAAP,CAAYsE,QAAZ,EAAsBG,CAAtB,CAAJ,EAA8B;AAC5BlC,gBAAAA,IAAI,CAACvF,KAAL,GAAasH,QAAQ,CAACG,CAAD,CAArB,CAAA;gBACAlC,IAAI,CAACrF,IAAL,GAAY,KAAZ,CAAA;AACA,gBAAA,OAAOqF,IAAP,CAAA;AACD,eAAA;AACF,aAAA;;YAEDA,IAAI,CAACvF,KAAL,GAAaY,WAAb,CAAA;YACA2E,IAAI,CAACrF,IAAL,GAAY,IAAZ,CAAA;AAEA,YAAA,OAAOqF,IAAP,CAAA;WAZF,CAAA;;AAeA,UAAA,OAAOA,IAAI,CAACA,IAAL,GAAYA,IAAnB,CAAA;AACD,SAAA;AACF,OA7BuB;;;MAgCxB,OAAO;AAAEA,QAAAA,IAAI,EAAEG,UAAAA;OAAf,CAAA;AACD,KAAA;;IACD5E,OAAO,CAAC8C,MAAR,GAAiBA,MAAjB,CAAA;;AAEA,IAAA,SAAS8B,UAAT,GAAsB;MACpB,OAAO;AAAE1F,QAAAA,KAAK,EAAEY,WAAT;AAAoBV,QAAAA,IAAI,EAAE,IAAA;OAAjC,CAAA;AACD,KAAA;;IAEDyC,OAAO,CAAC1B,SAAR,GAAoB;AAClBoD,MAAAA,WAAW,EAAE1B,OADK;MAGlBqE,KAAK,EAAE,SAASU,KAAAA,CAAAA,aAAT,EAAwB;QAC7B,IAAKC,CAAAA,IAAL,GAAY,CAAZ,CAAA;AACA,QAAA,IAAA,CAAKpC,IAAL,GAAY,CAAZ,CAF6B;AAInC;;AACM,QAAA,IAAA,CAAKO,IAAL,GAAY,IAAKC,CAAAA,KAAL,GAAanF,WAAzB,CAAA;QACA,IAAKV,CAAAA,IAAL,GAAY,KAAZ,CAAA;QACA,IAAKyF,CAAAA,QAAL,GAAgB,IAAhB,CAAA;QAEA,IAAK1B,CAAAA,MAAL,GAAc,MAAd,CAAA;QACA,IAAKnE,CAAAA,GAAL,GAAWc,WAAX,CAAA;AAEA,QAAA,IAAA,CAAKgG,UAAL,CAAgB5C,OAAhB,CAAwB8C,aAAxB,CAAA,CAAA;;QAEA,IAAI,CAACY,aAAL,EAAoB;AAClB,UAAA,KAAK,IAAIpD,IAAT,IAAiB,IAAjB,EAAuB;AAC/B;AACU,YAAA,IAAIA,IAAI,CAACsD,MAAL,CAAY,CAAZ,CAAA,KAAmB,GAAnB,IACA1G,MAAM,CAAC8B,IAAP,CAAY,IAAZ,EAAkBsB,IAAlB,CADA,IAEA,CAACkD,KAAK,CAAC,CAAClD,IAAI,CAACuD,KAAL,CAAW,CAAX,CAAF,CAFV,EAE4B;cAC1B,IAAKvD,CAAAA,IAAL,IAAa1D,WAAb,CAAA;AACD,aAAA;AACF,WAAA;AACF,SAAA;OA1Be;AA6BlBkH,MAAAA,IAAI,EAAE,SAAW,IAAA,GAAA;QACf,IAAK5H,CAAAA,IAAL,GAAY,IAAZ,CAAA;AAEA,QAAA,IAAI6H,SAAS,GAAG,IAAA,CAAKnB,UAAL,CAAgB,CAAhB,CAAhB,CAAA;AACA,QAAA,IAAIoB,UAAU,GAAGD,SAAS,CAAChB,UAA3B,CAAA;;AACA,QAAA,IAAIiB,UAAU,CAACjF,IAAX,KAAoB,OAAxB,EAAiC;UAC/B,MAAMiF,UAAU,CAAClI,GAAjB,CAAA;AACD,SAAA;;AAED,QAAA,OAAO,KAAKmI,IAAZ,CAAA;OAtCgB;MAyClBjC,iBAAiB,EAAE,SAASkC,iBAAAA,CAAAA,SAAT,EAAoB;QACrC,IAAI,IAAA,CAAKhI,IAAT,EAAe;AACb,UAAA,MAAMgI,SAAN,CAAA;AACD,SAAA;;QAED,IAAIxF,OAAO,GAAG,IAAd,CAAA;;AACA,QAAA,SAASyF,MAAT,CAAgBC,GAAhB,EAAqBC,MAArB,EAA6B;UAC3BtD,MAAM,CAAChC,IAAP,GAAc,OAAd,CAAA;UACAgC,MAAM,CAACjF,GAAP,GAAaoI,SAAb,CAAA;UACAxF,OAAO,CAAC6C,IAAR,GAAe6C,GAAf,CAAA;;AAEA,UAAA,IAAIC,MAAJ,EAAY;AACpB;AACA;YACU3F,OAAO,CAACuB,MAAR,GAAiB,MAAjB,CAAA;YACAvB,OAAO,CAAC5C,GAAR,GAAcc,WAAd,CAAA;AACD,WAAA;;UAED,OAAO,CAAC,CAAEyH,MAAV,CAAA;AACD,SAAA;;AAED,QAAA,KAAK,IAAIZ,CAAC,GAAG,IAAKb,CAAAA,UAAL,CAAgBQ,MAAhB,GAAyB,CAAtC,EAAyCK,CAAC,IAAI,CAA9C,EAAiD,EAAEA,CAAnD,EAAsD;AACpD,UAAA,IAAIlB,KAAK,GAAG,IAAA,CAAKK,UAAL,CAAgBa,CAAhB,CAAZ,CAAA;AACA,UAAA,IAAI1C,MAAM,GAAGwB,KAAK,CAACQ,UAAnB,CAAA;;AAEA,UAAA,IAAIR,KAAK,CAACC,MAAN,KAAiB,MAArB,EAA6B;AACrC;AACA;AACA;YACU,OAAO2B,MAAM,CAAC,KAAD,CAAb,CAAA;AACD,WAAA;;AAED,UAAA,IAAI5B,KAAK,CAACC,MAAN,IAAgB,IAAA,CAAKmB,IAAzB,EAA+B;YAC7B,IAAIW,QAAQ,GAAGpH,MAAM,CAAC8B,IAAP,CAAYuD,KAAZ,EAAmB,UAAnB,CAAf,CAAA;YACA,IAAIgC,UAAU,GAAGrH,MAAM,CAAC8B,IAAP,CAAYuD,KAAZ,EAAmB,YAAnB,CAAjB,CAAA;;YAEA,IAAI+B,QAAQ,IAAIC,UAAhB,EAA4B;AAC1B,cAAA,IAAI,KAAKZ,IAAL,GAAYpB,KAAK,CAACE,QAAtB,EAAgC;AAC9B,gBAAA,OAAO0B,MAAM,CAAC5B,KAAK,CAACE,QAAP,EAAiB,IAAjB,CAAb,CAAA;eADF,MAEO,IAAI,IAAKkB,CAAAA,IAAL,GAAYpB,KAAK,CAACG,UAAtB,EAAkC;AACvC,gBAAA,OAAOyB,MAAM,CAAC5B,KAAK,CAACG,UAAP,CAAb,CAAA;AACD,eAAA;aALH,MAOO,IAAI4B,QAAJ,EAAc;AACnB,cAAA,IAAI,KAAKX,IAAL,GAAYpB,KAAK,CAACE,QAAtB,EAAgC;AAC9B,gBAAA,OAAO0B,MAAM,CAAC5B,KAAK,CAACE,QAAP,EAAiB,IAAjB,CAAb,CAAA;AACD,eAAA;aAHI,MAKA,IAAI8B,UAAJ,EAAgB;AACrB,cAAA,IAAI,KAAKZ,IAAL,GAAYpB,KAAK,CAACG,UAAtB,EAAkC;AAChC,gBAAA,OAAOyB,MAAM,CAAC5B,KAAK,CAACG,UAAP,CAAb,CAAA;AACD,eAAA;AAEF,aALM,MAKA;AACL,cAAA,MAAM,IAAIjB,KAAJ,CAAU,wCAAV,CAAN,CAAA;AACD,aAAA;AACF,WAAA;AACF,SAAA;OAlGe;AAqGlBQ,MAAAA,MAAM,EAAE,SAAA,MAAA,CAASlD,IAAT,EAAejD,GAAf,EAAoB;AAC1B,QAAA,KAAK,IAAI2H,CAAC,GAAG,IAAKb,CAAAA,UAAL,CAAgBQ,MAAhB,GAAyB,CAAtC,EAAyCK,CAAC,IAAI,CAA9C,EAAiD,EAAEA,CAAnD,EAAsD;AACpD,UAAA,IAAIlB,KAAK,GAAG,IAAA,CAAKK,UAAL,CAAgBa,CAAhB,CAAZ,CAAA;;UACA,IAAIlB,KAAK,CAACC,MAAN,IAAgB,KAAKmB,IAArB,IACAzG,MAAM,CAAC8B,IAAP,CAAYuD,KAAZ,EAAmB,YAAnB,CADA,IAEA,IAAA,CAAKoB,IAAL,GAAYpB,KAAK,CAACG,UAFtB,EAEkC;YAChC,IAAI8B,YAAY,GAAGjC,KAAnB,CAAA;AACA,YAAA,MAAA;AACD,WAAA;AACF,SAAA;;QAED,IAAIiC,YAAY,KACXzF,IAAI,KAAK,OAAT,IACAA,IAAI,KAAK,UAFE,CAAZ,IAGAyF,YAAY,CAAChC,MAAb,IAAuB1G,GAHvB,IAIAA,GAAG,IAAI0I,YAAY,CAAC9B,UAJxB,EAIoC;AAC1C;AACA;AACQ8B,UAAAA,YAAY,GAAG,IAAf,CAAA;AACD,SAAA;;QAED,IAAIzD,MAAM,GAAGyD,YAAY,GAAGA,YAAY,CAACzB,UAAhB,GAA6B,EAAtD,CAAA;QACAhC,MAAM,CAAChC,IAAP,GAAcA,IAAd,CAAA;QACAgC,MAAM,CAACjF,GAAP,GAAaA,GAAb,CAAA;;AAEA,QAAA,IAAI0I,YAAJ,EAAkB;UAChB,IAAKvE,CAAAA,MAAL,GAAc,MAAd,CAAA;AACA,UAAA,IAAA,CAAKsB,IAAL,GAAYiD,YAAY,CAAC9B,UAAzB,CAAA;AACA,UAAA,OAAOrD,gBAAP,CAAA;AACD,SAAA;;AAED,QAAA,OAAO,IAAKoF,CAAAA,QAAL,CAAc1D,MAAd,CAAP,CAAA;OApIgB;AAuIlB0D,MAAAA,QAAQ,EAAE,SAAA,QAAA,CAAS1D,MAAT,EAAiB4B,QAAjB,EAA2B;AACnC,QAAA,IAAI5B,MAAM,CAAChC,IAAP,KAAgB,OAApB,EAA6B;UAC3B,MAAMgC,MAAM,CAACjF,GAAb,CAAA;AACD,SAAA;;QAED,IAAIiF,MAAM,CAAChC,IAAP,KAAgB,OAAhB,IACAgC,MAAM,CAAChC,IAAP,KAAgB,UADpB,EACgC;AAC9B,UAAA,IAAA,CAAKwC,IAAL,GAAYR,MAAM,CAACjF,GAAnB,CAAA;AACD,SAHD,MAGO,IAAIiF,MAAM,CAAChC,IAAP,KAAgB,QAApB,EAA8B;AACnC,UAAA,IAAA,CAAKkF,IAAL,GAAY,IAAA,CAAKnI,GAAL,GAAWiF,MAAM,CAACjF,GAA9B,CAAA;UACA,IAAKmE,CAAAA,MAAL,GAAc,QAAd,CAAA;UACA,IAAKsB,CAAAA,IAAL,GAAY,KAAZ,CAAA;SAHK,MAIA,IAAIR,MAAM,CAAChC,IAAP,KAAgB,QAAhB,IAA4B4D,QAAhC,EAA0C;UAC/C,IAAKpB,CAAAA,IAAL,GAAYoB,QAAZ,CAAA;AACD,SAAA;;AAED,QAAA,OAAOtD,gBAAP,CAAA;OAvJgB;MA0JlBqF,MAAM,EAAE,SAAShC,MAAAA,CAAAA,UAAT,EAAqB;AAC3B,QAAA,KAAK,IAAIe,CAAC,GAAG,IAAKb,CAAAA,UAAL,CAAgBQ,MAAhB,GAAyB,CAAtC,EAAyCK,CAAC,IAAI,CAA9C,EAAiD,EAAEA,CAAnD,EAAsD;AACpD,UAAA,IAAIlB,KAAK,GAAG,IAAA,CAAKK,UAAL,CAAgBa,CAAhB,CAAZ,CAAA;;AACA,UAAA,IAAIlB,KAAK,CAACG,UAAN,KAAqBA,UAAzB,EAAqC;YACnC,IAAK+B,CAAAA,QAAL,CAAclC,KAAK,CAACQ,UAApB,EAAgCR,KAAK,CAACI,QAAtC,CAAA,CAAA;YACAG,aAAa,CAACP,KAAD,CAAb,CAAA;AACA,YAAA,OAAOlD,gBAAP,CAAA;AACD,WAAA;AACF,SAAA;OAlKe;MAqKlB,OAAS,EAAA,SAAA,MAAA,CAASmD,MAAT,EAAiB;AACxB,QAAA,KAAK,IAAIiB,CAAC,GAAG,IAAKb,CAAAA,UAAL,CAAgBQ,MAAhB,GAAyB,CAAtC,EAAyCK,CAAC,IAAI,CAA9C,EAAiD,EAAEA,CAAnD,EAAsD;AACpD,UAAA,IAAIlB,KAAK,GAAG,IAAA,CAAKK,UAAL,CAAgBa,CAAhB,CAAZ,CAAA;;AACA,UAAA,IAAIlB,KAAK,CAACC,MAAN,KAAiBA,MAArB,EAA6B;AAC3B,YAAA,IAAIzB,MAAM,GAAGwB,KAAK,CAACQ,UAAnB,CAAA;;AACA,YAAA,IAAIhC,MAAM,CAAChC,IAAP,KAAgB,OAApB,EAA6B;AAC3B,cAAA,IAAI4F,MAAM,GAAG5D,MAAM,CAACjF,GAApB,CAAA;cACAgH,aAAa,CAACP,KAAD,CAAb,CAAA;AACD,aAAA;;AACD,YAAA,OAAOoC,MAAP,CAAA;AACD,WAAA;AACF,SAXuB;AAc9B;;;AACM,QAAA,MAAM,IAAIlD,KAAJ,CAAU,uBAAV,CAAN,CAAA;OApLgB;AAuLlBmD,MAAAA,aAAa,EAAE,SAAStB,aAAAA,CAAAA,QAAT,EAAmBnB,UAAnB,EAA+BC,OAA/B,EAAwC;AACrD,QAAA,IAAA,CAAKT,QAAL,GAAgB;AACdpE,UAAAA,QAAQ,EAAEqC,MAAM,CAAC0D,QAAD,CADF;AAEdnB,UAAAA,UAAU,EAAEA,UAFE;AAGdC,UAAAA,OAAO,EAAEA,OAAAA;SAHX,CAAA;;AAMA,QAAA,IAAI,IAAKnC,CAAAA,MAAL,KAAgB,MAApB,EAA4B;AAClC;AACA;UACQ,IAAKnE,CAAAA,GAAL,GAAWc,WAAX,CAAA;AACD,SAAA;;AAED,QAAA,OAAOyC,gBAAP,CAAA;AACD,OAAA;AArMiB,KAApB,CAlgBgC;AA2sBlC;AACA;AACA;;AACE,IAAA,OAAOvC,OAAP,CAAA;AAED,GAhtBc;AAktBf;AACA;AACA;AACE,EAAA,QAAA,KAAkB,QAAlB,GAA6B+H,MAAM,CAAC/H,OAApC,GAA8C,EArtBjC,CAAf,CAAA;;EAwtBA,IAAI;AACFgI,IAAAA,kBAAkB,GAAGjI,OAArB,CAAA;GADF,CAEE,OAAOkI,oBAAP,EAA6B;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACE,IAAA,IAAI,QAAOC,UAAP,KAAA,WAAA,GAAA,WAAA,GAAA,OAAA,CAAOA,UAAP,CAAA,MAAsB,QAA1B,EAAoC;MAClCA,UAAU,CAACF,kBAAX,GAAgCjI,OAAhC,CAAA;AACD,KAFD,MAEO;AACLoI,MAAAA,QAAQ,CAAC,GAAD,EAAM,wBAAN,CAAR,CAAwCpI,OAAxC,CAAA,CAAA;AACD,KAAA;AACH,GAAA;;;;;ACjvBAqI,IAAAA,WAAc,GAAGC;;;;"}

package/esm/_chunks/dep-2d800f07.js

@@ -0,0 +1,113 @@
+/**
+ * tdesign v0.33.2
+ * (c) 2022 tdesign
+ * @license MIT
+ */
+
+import './dep-c0617d36.js';
+import { b as _baseFindIndex } from './dep-494d534b.js';
+
+/**
+ * The base implementation of `_.isNaN` without support for number objects.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.
+ */
+
+function baseIsNaN$1(value) {
+  return value !== value;
+}
+
+var _baseIsNaN = baseIsNaN$1;
+
+/**
+ * A specialized version of `_.indexOf` which performs strict equality
+ * comparisons of values, i.e. `===`.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {*} value The value to search for.
+ * @param {number} fromIndex The index to search from.
+ * @returns {number} Returns the index of the matched value, else `-1`.
+ */
+
+function strictIndexOf$1(array, value, fromIndex) {
+  var index = fromIndex - 1,
+      length = array.length;
+
+  while (++index < length) {
+    if (array[index] === value) {
+      return index;
+    }
+  }
+
+  return -1;
+}
+
+var _strictIndexOf = strictIndexOf$1;
+
+var baseFindIndex = _baseFindIndex,
+    baseIsNaN = _baseIsNaN,
+    strictIndexOf = _strictIndexOf;
+/**
+ * The base implementation of `_.indexOf` without `fromIndex` bounds checks.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {*} value The value to search for.
+ * @param {number} fromIndex The index to search from.
+ * @returns {number} Returns the index of the matched value, else `-1`.
+ */
+
+function baseIndexOf$1(array, value, fromIndex) {
+  return value === value ? strictIndexOf(array, value, fromIndex) : baseFindIndex(array, baseIsNaN, fromIndex);
+}
+
+var _baseIndexOf = baseIndexOf$1;
+
+var baseIndexOf = _baseIndexOf;
+/**
+ * A specialized version of `_.includes` for arrays without support for
+ * specifying an index to search from.
+ *
+ * @private
+ * @param {Array} [array] The array to inspect.
+ * @param {*} target The value to search for.
+ * @returns {boolean} Returns `true` if `target` is found, else `false`.
+ */
+
+function arrayIncludes(array, value) {
+  var length = array == null ? 0 : array.length;
+  return !!length && baseIndexOf(array, value, 0) > -1;
+}
+
+var _arrayIncludes = arrayIncludes;
+
+/**
+ * This function is like `arrayIncludes` except that it accepts a comparator.
+ *
+ * @private
+ * @param {Array} [array] The array to inspect.
+ * @param {*} target The value to search for.
+ * @param {Function} comparator The comparator invoked per element.
+ * @returns {boolean} Returns `true` if `target` is found, else `false`.
+ */
+
+function arrayIncludesWith(array, value, comparator) {
+  var index = -1,
+      length = array == null ? 0 : array.length;
+
+  while (++index < length) {
+    if (comparator(value, array[index])) {
+      return true;
+    }
+  }
+
+  return false;
+}
+
+var _arrayIncludesWith = arrayIncludesWith;
+
+export { _arrayIncludes as _, _arrayIncludesWith as a };
+//# sourceMappingURL=dep-2d800f07.js.map

package/esm/_chunks/dep-2d800f07.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-2d800f07.js","sources":["../../node_modules/lodash/_baseIsNaN.js","../../node_modules/lodash/_strictIndexOf.js","../../node_modules/lodash/_baseIndexOf.js","../../node_modules/lodash/_arrayIncludes.js","../../node_modules/lodash/_arrayIncludesWith.js"],"sourcesContent":["/**\n * The base implementation of `_.isNaN` without support for number objects.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n */\nfunction baseIsNaN(value) {\n  return value !== value;\n}\n\nmodule.exports = baseIsNaN;\n","/**\n * A specialized version of `_.indexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction strictIndexOf(array, value, fromIndex) {\n  var index = fromIndex - 1,\n      length = array.length;\n\n  while (++index < length) {\n    if (array[index] === value) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = strictIndexOf;\n","var baseFindIndex = require('./_baseFindIndex'),\n    baseIsNaN = require('./_baseIsNaN'),\n    strictIndexOf = require('./_strictIndexOf');\n\n/**\n * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseIndexOf(array, value, fromIndex) {\n  return value === value\n    ? strictIndexOf(array, value, fromIndex)\n    : baseFindIndex(array, baseIsNaN, fromIndex);\n}\n\nmodule.exports = baseIndexOf;\n","var baseIndexOf = require('./_baseIndexOf');\n\n/**\n * A specialized version of `_.includes` for arrays without support for\n * specifying an index to search from.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludes(array, value) {\n  var length = array == null ? 0 : array.length;\n  return !!length && baseIndexOf(array, value, 0) > -1;\n}\n\nmodule.exports = arrayIncludes;\n","/**\n * This function is like `arrayIncludes` except that it accepts a comparator.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludesWith(array, value, comparator) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (comparator(value, array[index])) {\n      return true;\n    }\n  }\n  return false;\n}\n\nmodule.exports = arrayIncludesWith;\n"],"names":["baseIsNaN","value","_baseIsNaN","strictIndexOf","array","fromIndex","index","length","_strictIndexOf","baseFindIndex","require$$0","require$$1","require$$2","baseIndexOf","_baseIndexOf","arrayIncludes","_arrayIncludes","arrayIncludesWith","comparator","_arrayIncludesWith"],"mappings":";;;;;;;;;;;;;;;;;AAOA,SAASA,WAAT,CAAmBC,KAAnB,EAA0B;EACxB,OAAOA,KAAK,KAAKA,KAAjB,CAAA;AACD,CAAA;;AAED,IAAAC,UAAc,GAAGF,WAAjB;;;;;;;;;;;;;ACDA,SAASG,eAAT,CAAuBC,KAAvB,EAA8BH,KAA9B,EAAqCI,SAArC,EAAgD;AAC9C,EAAA,IAAIC,KAAK,GAAGD,SAAS,GAAG,CAAxB;AAAA,MACIE,MAAM,GAAGH,KAAK,CAACG,MADnB,CAAA;;AAGA,EAAA,OAAO,EAAED,KAAF,GAAUC,MAAjB,EAAyB;AACvB,IAAA,IAAIH,KAAK,CAACE,KAAD,CAAL,KAAiBL,KAArB,EAA4B;AAC1B,MAAA,OAAOK,KAAP,CAAA;AACD,KAAA;AACF,GAAA;;AACD,EAAA,OAAO,CAAC,CAAR,CAAA;AACD,CAAA;;AAED,IAAAE,cAAc,GAAGL,eAAjB;;ACtBA,IAAIM,aAAa,GAAGC,cAApB;AAAA,IACIV,SAAS,GAAGW,UADhB;AAAA,IAEIR,aAAa,GAAGS,cAFpB,CAAA;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,aAAT,CAAqBT,KAArB,EAA4BH,KAA5B,EAAmCI,SAAnC,EAA8C;EAC5C,OAAOJ,KAAK,KAAKA,KAAV,GACHE,aAAa,CAACC,KAAD,EAAQH,KAAR,EAAeI,SAAf,CADV,GAEHI,aAAa,CAACL,KAAD,EAAQJ,SAAR,EAAmBK,SAAnB,CAFjB,CAAA;AAGD,CAAA;;AAED,IAAAS,YAAc,GAAGD,aAAjB;;ACnBA,IAAIA,WAAW,GAAGH,YAAlB,CAAA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASK,aAAT,CAAuBX,KAAvB,EAA8BH,KAA9B,EAAqC;EACnC,IAAIM,MAAM,GAAGH,KAAK,IAAI,IAAT,GAAgB,CAAhB,GAAoBA,KAAK,CAACG,MAAvC,CAAA;AACA,EAAA,OAAO,CAAC,CAACA,MAAF,IAAYM,WAAW,CAACT,KAAD,EAAQH,KAAR,EAAe,CAAf,CAAX,GAA+B,CAAC,CAAnD,CAAA;AACD,CAAA;;AAEDe,IAAAA,cAAc,GAAGD;;;;;;;;;;;;ACPjB,SAASE,iBAAT,CAA2Bb,KAA3B,EAAkCH,KAAlC,EAAyCiB,UAAzC,EAAqD;EACnD,IAAIZ,KAAK,GAAG,CAAC,CAAb;MACIC,MAAM,GAAGH,KAAK,IAAI,IAAT,GAAgB,CAAhB,GAAoBA,KAAK,CAACG,MADvC,CAAA;;AAGA,EAAA,OAAO,EAAED,KAAF,GAAUC,MAAjB,EAAyB;IACvB,IAAIW,UAAU,CAACjB,KAAD,EAAQG,KAAK,CAACE,KAAD,CAAb,CAAd,EAAqC;AACnC,MAAA,OAAO,IAAP,CAAA;AACD,KAAA;AACF,GAAA;;AACD,EAAA,OAAO,KAAP,CAAA;AACD,CAAA;;AAEDa,IAAAA,kBAAc,GAAGF;;;;"}

package/esm/_chunks/dep-3098467e.js

@@ -0,0 +1,93 @@
+/**
+ * tdesign v0.33.2
+ * (c) 2022 tdesign
+ * @license MIT
+ */
+
+import './dep-c0617d36.js';
+import { t as toNumber_1 } from './dep-d494e939.js';
+
+var toNumber = toNumber_1;
+/** Used as references for various `Number` constants. */
+
+var INFINITY = 1 / 0,
+    MAX_INTEGER = 1.7976931348623157e+308;
+/**
+ * Converts `value` to a finite number.
+ *
+ * @static
+ * @memberOf _
+ * @since 4.12.0
+ * @category Lang
+ * @param {*} value The value to convert.
+ * @returns {number} Returns the converted number.
+ * @example
+ *
+ * _.toFinite(3.2);
+ * // => 3.2
+ *
+ * _.toFinite(Number.MIN_VALUE);
+ * // => 5e-324
+ *
+ * _.toFinite(Infinity);
+ * // => 1.7976931348623157e+308
+ *
+ * _.toFinite('3.2');
+ * // => 3.2
+ */
+
+function toFinite$1(value) {
+  if (!value) {
+    return value === 0 ? value : 0;
+  }
+
+  value = toNumber(value);
+
+  if (value === INFINITY || value === -INFINITY) {
+    var sign = value < 0 ? -1 : 1;
+    return sign * MAX_INTEGER;
+  }
+
+  return value === value ? value : 0;
+}
+
+var toFinite_1 = toFinite$1;
+
+var toFinite = toFinite_1;
+/**
+ * Converts `value` to an integer.
+ *
+ * **Note:** This method is loosely based on
+ * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).
+ *
+ * @static
+ * @memberOf _
+ * @since 4.0.0
+ * @category Lang
+ * @param {*} value The value to convert.
+ * @returns {number} Returns the converted integer.
+ * @example
+ *
+ * _.toInteger(3.2);
+ * // => 3
+ *
+ * _.toInteger(Number.MIN_VALUE);
+ * // => 0
+ *
+ * _.toInteger(Infinity);
+ * // => 1.7976931348623157e+308
+ *
+ * _.toInteger('3.2');
+ * // => 3
+ */
+
+function toInteger(value) {
+  var result = toFinite(value),
+      remainder = result % 1;
+  return result === result ? remainder ? result - remainder : result : 0;
+}
+
+var toInteger_1 = toInteger;
+
+export { toFinite_1 as a, toInteger_1 as t };
+//# sourceMappingURL=dep-3098467e.js.map

package/esm/_chunks/dep-3098467e.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-3098467e.js","sources":["../../node_modules/lodash/toFinite.js","../../node_modules/lodash/toInteger.js"],"sourcesContent":["var toNumber = require('./toNumber');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0,\n    MAX_INTEGER = 1.7976931348623157e+308;\n\n/**\n * Converts `value` to a finite number.\n *\n * @static\n * @memberOf _\n * @since 4.12.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted number.\n * @example\n *\n * _.toFinite(3.2);\n * // => 3.2\n *\n * _.toFinite(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toFinite(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toFinite('3.2');\n * // => 3.2\n */\nfunction toFinite(value) {\n  if (!value) {\n    return value === 0 ? value : 0;\n  }\n  value = toNumber(value);\n  if (value === INFINITY || value === -INFINITY) {\n    var sign = (value < 0 ? -1 : 1);\n    return sign * MAX_INTEGER;\n  }\n  return value === value ? value : 0;\n}\n\nmodule.exports = toFinite;\n","var toFinite = require('./toFinite');\n\n/**\n * Converts `value` to an integer.\n *\n * **Note:** This method is loosely based on\n * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toInteger(3.2);\n * // => 3\n *\n * _.toInteger(Number.MIN_VALUE);\n * // => 0\n *\n * _.toInteger(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toInteger('3.2');\n * // => 3\n */\nfunction toInteger(value) {\n  var result = toFinite(value),\n      remainder = result % 1;\n\n  return result === result ? (remainder ? result - remainder : result) : 0;\n}\n\nmodule.exports = toInteger;\n"],"names":["toNumber","require$$0","INFINITY","MAX_INTEGER","toFinite","value","sign","toFinite_1","toInteger","result","remainder","toInteger_1"],"mappings":";;;;;;;;;AAAA,IAAIA,QAAQ,GAAGC,UAAf,CAAA;AAEA;;AACA,IAAIC,QAAQ,GAAG,CAAA,GAAI,CAAnB;AAAA,IACIC,WAAW,GAAG,uBADlB,CAAA;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,UAAT,CAAkBC,KAAlB,EAAyB;EACvB,IAAI,CAACA,KAAL,EAAY;AACV,IAAA,OAAOA,KAAK,KAAK,CAAV,GAAcA,KAAd,GAAsB,CAA7B,CAAA;AACD,GAAA;;AACDA,EAAAA,KAAK,GAAGL,QAAQ,CAACK,KAAD,CAAhB,CAAA;;EACA,IAAIA,KAAK,KAAKH,QAAV,IAAsBG,KAAK,KAAK,CAACH,QAArC,EAA+C;IAC7C,IAAII,IAAI,GAAID,KAAK,GAAG,CAAR,GAAY,CAAC,CAAb,GAAiB,CAA7B,CAAA;IACA,OAAOC,IAAI,GAAGH,WAAd,CAAA;AACD,GAAA;;AACD,EAAA,OAAOE,KAAK,KAAKA,KAAV,GAAkBA,KAAlB,GAA0B,CAAjC,CAAA;AACD,CAAA;;AAEDE,IAAAA,UAAc,GAAGH;;ACzCjB,IAAIA,QAAQ,GAAGH,UAAf,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;AACA;AACA;;AACA,SAASO,SAAT,CAAmBH,KAAnB,EAA0B;AACxB,EAAA,IAAII,MAAM,GAAGL,QAAQ,CAACC,KAAD,CAArB;AAAA,MACIK,SAAS,GAAGD,MAAM,GAAG,CADzB,CAAA;AAGA,EAAA,OAAOA,MAAM,KAAKA,MAAX,GAAqBC,SAAS,GAAGD,MAAM,GAAGC,SAAZ,GAAwBD,MAAtD,GAAgE,CAAvE,CAAA;AACD,CAAA;;AAEDE,IAAAA,WAAc,GAAGH;;;;"}

package/esm/_chunks/dep-342c702e.js

@@ -0,0 +1,86 @@
+/**
+ * tdesign v0.33.2
+ * (c) 2022 tdesign
+ * @license MIT
+ */
+
+import './dep-c0617d36.js';
+import { _ as _baseSlice } from './dep-59484d72.js';
+import { _ as _isIterateeCall } from './dep-0b2e283f.js';
+import { t as toInteger_1 } from './dep-3098467e.js';
+
+function _extends() {
+  _extends = Object.assign || function (target) {
+    for (var i = 1; i < arguments.length; i++) {
+      var source = arguments[i];
+
+      for (var key in source) {
+        if (Object.prototype.hasOwnProperty.call(source, key)) {
+          target[key] = source[key];
+        }
+      }
+    }
+
+    return target;
+  };
+
+  return _extends.apply(this, arguments);
+}
+
+var baseSlice = _baseSlice,
+    isIterateeCall = _isIterateeCall,
+    toInteger = toInteger_1;
+/* Built-in method references for those with the same name as other `lodash` methods. */
+
+var nativeCeil = Math.ceil,
+    nativeMax = Math.max;
+/**
+ * Creates an array of elements split into groups the length of `size`.
+ * If `array` can't be split evenly, the final chunk will be the remaining
+ * elements.
+ *
+ * @static
+ * @memberOf _
+ * @since 3.0.0
+ * @category Array
+ * @param {Array} array The array to process.
+ * @param {number} [size=1] The length of each chunk
+ * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
+ * @returns {Array} Returns the new array of chunks.
+ * @example
+ *
+ * _.chunk(['a', 'b', 'c', 'd'], 2);
+ * // => [['a', 'b'], ['c', 'd']]
+ *
+ * _.chunk(['a', 'b', 'c', 'd'], 3);
+ * // => [['a', 'b', 'c'], ['d']]
+ */
+
+function chunk(array, size, guard) {
+  if (guard ? isIterateeCall(array, size, guard) : size === undefined) {
+    size = 1;
+  } else {
+    size = nativeMax(toInteger(size), 0);
+  }
+
+  var length = array == null ? 0 : array.length;
+
+  if (!length || size < 1) {
+    return [];
+  }
+
+  var index = 0,
+      resIndex = 0,
+      result = Array(nativeCeil(length / size));
+
+  while (index < length) {
+    result[resIndex++] = baseSlice(array, index, index += size);
+  }
+
+  return result;
+}
+
+var chunk_1 = chunk;
+
+export { _extends as _, chunk_1 as c };
+//# sourceMappingURL=dep-342c702e.js.map

package/esm/_chunks/dep-342c702e.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-342c702e.js","sources":["../../node_modules/@babel/runtime/helpers/esm/extends.js","../../node_modules/lodash/chunk.js"],"sourcesContent":["export default function _extends() {\n  _extends = Object.assign || function (target) {\n    for (var i = 1; i < arguments.length; i++) {\n      var source = arguments[i];\n\n      for (var key in source) {\n        if (Object.prototype.hasOwnProperty.call(source, key)) {\n          target[key] = source[key];\n        }\n      }\n    }\n\n    return target;\n  };\n\n  return _extends.apply(this, arguments);\n}","var baseSlice = require('./_baseSlice'),\n    isIterateeCall = require('./_isIterateeCall'),\n    toInteger = require('./toInteger');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeCeil = Math.ceil,\n    nativeMax = Math.max;\n\n/**\n * Creates an array of elements split into groups the length of `size`.\n * If `array` can't be split evenly, the final chunk will be the remaining\n * elements.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to process.\n * @param {number} [size=1] The length of each chunk\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the new array of chunks.\n * @example\n *\n * _.chunk(['a', 'b', 'c', 'd'], 2);\n * // => [['a', 'b'], ['c', 'd']]\n *\n * _.chunk(['a', 'b', 'c', 'd'], 3);\n * // => [['a', 'b', 'c'], ['d']]\n */\nfunction chunk(array, size, guard) {\n  if ((guard ? isIterateeCall(array, size, guard) : size === undefined)) {\n    size = 1;\n  } else {\n    size = nativeMax(toInteger(size), 0);\n  }\n  var length = array == null ? 0 : array.length;\n  if (!length || size < 1) {\n    return [];\n  }\n  var index = 0,\n      resIndex = 0,\n      result = Array(nativeCeil(length / size));\n\n  while (index < length) {\n    result[resIndex++] = baseSlice(array, index, (index += size));\n  }\n  return result;\n}\n\nmodule.exports = chunk;\n"],"names":["_extends","Object","assign","target","i","arguments","length","source","key","prototype","hasOwnProperty","call","apply","baseSlice","require$$0","isIterateeCall","require$$1","toInteger","require$$2","nativeCeil","Math","ceil","nativeMax","max","chunk","array","size","guard","undefined","index","resIndex","result","Array","chunk_1"],"mappings":";;;;;;;;;;;AAAe,SAASA,QAAT,GAAoB;AACjCA,EAAAA,QAAQ,GAAGC,MAAM,CAACC,MAAP,IAAiB,UAAUC,MAAV,EAAkB;AAC5C,IAAA,KAAK,IAAIC,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGC,SAAS,CAACC,MAA9B,EAAsCF,CAAC,EAAvC,EAA2C;AACzC,MAAA,IAAIG,MAAM,GAAGF,SAAS,CAACD,CAAD,CAAtB,CAAA;;AAEA,MAAA,KAAK,IAAII,GAAT,IAAgBD,MAAhB,EAAwB;AACtB,QAAA,IAAIN,MAAM,CAACQ,SAAP,CAAiBC,cAAjB,CAAgCC,IAAhC,CAAqCJ,MAArC,EAA6CC,GAA7C,CAAJ,EAAuD;AACrDL,UAAAA,MAAM,CAACK,GAAD,CAAN,GAAcD,MAAM,CAACC,GAAD,CAApB,CAAA;AACD,SAAA;AACF,OAAA;AACF,KAAA;;AAED,IAAA,OAAOL,MAAP,CAAA;GAXF,CAAA;;AAcA,EAAA,OAAOH,QAAQ,CAACY,KAAT,CAAe,IAAf,EAAqBP,SAArB,CAAP,CAAA;AACD;;AChBD,IAAIQ,SAAS,GAAGC,UAAhB;AAAA,IACIC,cAAc,GAAGC,eADrB;AAAA,IAEIC,SAAS,GAAGC,WAFhB,CAAA;AAIA;;AACA,IAAIC,UAAU,GAAGC,IAAI,CAACC,IAAtB;AAAA,IACIC,SAAS,GAAGF,IAAI,CAACG,GADrB,CAAA;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,KAAT,CAAeC,KAAf,EAAsBC,IAAtB,EAA4BC,KAA5B,EAAmC;AACjC,EAAA,IAAKA,KAAK,GAAGZ,cAAc,CAACU,KAAD,EAAQC,IAAR,EAAcC,KAAd,CAAjB,GAAwCD,IAAI,KAAKE,SAA3D,EAAuE;AACrEF,IAAAA,IAAI,GAAG,CAAP,CAAA;AACD,GAFD,MAEO;IACLA,IAAI,GAAGJ,SAAS,CAACL,SAAS,CAACS,IAAD,CAAV,EAAkB,CAAlB,CAAhB,CAAA;AACD,GAAA;;EACD,IAAIpB,MAAM,GAAGmB,KAAK,IAAI,IAAT,GAAgB,CAAhB,GAAoBA,KAAK,CAACnB,MAAvC,CAAA;;AACA,EAAA,IAAI,CAACA,MAAD,IAAWoB,IAAI,GAAG,CAAtB,EAAyB;AACvB,IAAA,OAAO,EAAP,CAAA;AACD,GAAA;;EACD,IAAIG,KAAK,GAAG,CAAZ;MACIC,QAAQ,GAAG,CADf;MAEIC,MAAM,GAAGC,KAAK,CAACb,UAAU,CAACb,MAAM,GAAGoB,IAAV,CAAX,CAFlB,CAAA;;EAIA,OAAOG,KAAK,GAAGvB,MAAf,EAAuB;AACrByB,IAAAA,MAAM,CAACD,QAAQ,EAAT,CAAN,GAAqBjB,SAAS,CAACY,KAAD,EAAQI,KAAR,EAAgBA,KAAK,IAAIH,IAAzB,CAA9B,CAAA;AACD,GAAA;;AACD,EAAA,OAAOK,MAAP,CAAA;AACD,CAAA;;AAEDE,IAAAA,OAAc,GAAGT;;;;"}

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

@@ -0,0 +1,52 @@
+/**
+ * tdesign v0.33.2
+ * (c) 2022 tdesign
+ * @license MIT
+ */
+
+import { _ as _unsupportedIterableToArray } from './dep-59e5dea8.js';
+
+function _arrayWithHoles(arr) {
+  if (Array.isArray(arr)) return arr;
+}
+
+function _iterableToArrayLimit(arr, i) {
+  var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
+
+  if (_i == null) return;
+  var _arr = [];
+  var _n = true;
+  var _d = false;
+
+  var _s, _e;
+
+  try {
+    for (_i = _i.call(arr); !(_n = (_s = _i.next()).done); _n = true) {
+      _arr.push(_s.value);
+
+      if (i && _arr.length === i) break;
+    }
+  } catch (err) {
+    _d = true;
+    _e = err;
+  } finally {
+    try {
+      if (!_n && _i["return"] != null) _i["return"]();
+    } finally {
+      if (_d) throw _e;
+    }
+  }
+
+  return _arr;
+}
+
+function _nonIterableRest() {
+  throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+}
+
+function _slicedToArray(arr, i) {
+  return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest();
+}
+
+export { _slicedToArray as _ };
+//# sourceMappingURL=dep-3f6e6a10.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"dep-3f6e6a10.js","sources":["../../node_modules/@babel/runtime/helpers/esm/arrayWithHoles.js","../../node_modules/@babel/runtime/helpers/esm/iterableToArrayLimit.js","../../node_modules/@babel/runtime/helpers/esm/nonIterableRest.js","../../node_modules/@babel/runtime/helpers/esm/slicedToArray.js"],"sourcesContent":["export default function _arrayWithHoles(arr) {\n  if (Array.isArray(arr)) return arr;\n}","export default function _iterableToArrayLimit(arr, i) {\n  var _i = arr == null ? null : typeof Symbol !== \"undefined\" && arr[Symbol.iterator] || arr[\"@@iterator\"];\n\n  if (_i == null) return;\n  var _arr = [];\n  var _n = true;\n  var _d = false;\n\n  var _s, _e;\n\n  try {\n    for (_i = _i.call(arr); !(_n = (_s = _i.next()).done); _n = true) {\n      _arr.push(_s.value);\n\n      if (i && _arr.length === i) break;\n    }\n  } catch (err) {\n    _d = true;\n    _e = err;\n  } finally {\n    try {\n      if (!_n && _i[\"return\"] != null) _i[\"return\"]();\n    } finally {\n      if (_d) throw _e;\n    }\n  }\n\n  return _arr;\n}","export default function _nonIterableRest() {\n  throw new TypeError(\"Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\");\n}","import arrayWithHoles from \"./arrayWithHoles.js\";\nimport iterableToArrayLimit from \"./iterableToArrayLimit.js\";\nimport unsupportedIterableToArray from \"./unsupportedIterableToArray.js\";\nimport nonIterableRest from \"./nonIterableRest.js\";\nexport default function _slicedToArray(arr, i) {\n  return arrayWithHoles(arr) || iterableToArrayLimit(arr, i) || unsupportedIterableToArray(arr, i) || nonIterableRest();\n}"],"names":["_arrayWithHoles","arr","Array","isArray","_iterableToArrayLimit","i","_i","Symbol","iterator","_arr","_n","_d","_s","_e","call","next","done","push","value","length","err","_nonIterableRest","TypeError","_slicedToArray","arrayWithHoles","iterableToArrayLimit","unsupportedIterableToArray","nonIterableRest"],"mappings":";;;;;;;;AAAe,SAASA,eAAT,CAAyBC,GAAzB,EAA8B;EAC3C,IAAIC,KAAK,CAACC,OAAN,CAAcF,GAAd,CAAJ,EAAwB,OAAOA,GAAP,CAAA;AACzB;;ACFc,SAASG,qBAAT,CAA+BH,GAA/B,EAAoCI,CAApC,EAAuC;EACpD,IAAIC,EAAE,GAAGL,GAAG,IAAI,IAAP,GAAc,IAAd,GAAqB,OAAOM,MAAP,KAAkB,WAAlB,IAAiCN,GAAG,CAACM,MAAM,CAACC,QAAR,CAApC,IAAyDP,GAAG,CAAC,YAAD,CAA1F,CAAA;;EAEA,IAAIK,EAAE,IAAI,IAAV,EAAgB,OAAA;EAChB,IAAIG,IAAI,GAAG,EAAX,CAAA;EACA,IAAIC,EAAE,GAAG,IAAT,CAAA;EACA,IAAIC,EAAE,GAAG,KAAT,CAAA;;EAEA,IAAIC,EAAJ,EAAQC,EAAR,CAAA;;EAEA,IAAI;IACF,KAAKP,EAAE,GAAGA,EAAE,CAACQ,IAAH,CAAQb,GAAR,CAAV,EAAwB,EAAES,EAAE,GAAG,CAACE,EAAE,GAAGN,EAAE,CAACS,IAAH,EAAN,EAAiBC,IAAxB,CAAxB,EAAuDN,EAAE,GAAG,IAA5D,EAAkE;AAChED,MAAAA,IAAI,CAACQ,IAAL,CAAUL,EAAE,CAACM,KAAb,CAAA,CAAA;;AAEA,MAAA,IAAIb,CAAC,IAAII,IAAI,CAACU,MAAL,KAAgBd,CAAzB,EAA4B,MAAA;AAC7B,KAAA;GALH,CAME,OAAOe,GAAP,EAAY;AACZT,IAAAA,EAAE,GAAG,IAAL,CAAA;AACAE,IAAAA,EAAE,GAAGO,GAAL,CAAA;AACD,GATD,SASU;IACR,IAAI;AACF,MAAA,IAAI,CAACV,EAAD,IAAOJ,EAAE,CAAC,QAAD,CAAF,IAAgB,IAA3B,EAAiCA,EAAE,CAAC,QAAD,CAAF,EAAA,CAAA;AAClC,KAFD,SAEU;MACR,IAAIK,EAAJ,EAAQ,MAAME,EAAN,CAAA;AACT,KAAA;AACF,GAAA;;AAED,EAAA,OAAOJ,IAAP,CAAA;AACD;;AC5Bc,SAASY,gBAAT,GAA4B;AACzC,EAAA,MAAM,IAAIC,SAAJ,CAAc,2IAAd,CAAN,CAAA;AACD;;ACEc,SAASC,cAAT,CAAwBtB,GAAxB,EAA6BI,CAA7B,EAAgC;EAC7C,OAAOmB,eAAc,CAACvB,GAAD,CAAd,IAAuBwB,qBAAoB,CAACxB,GAAD,EAAMI,CAAN,CAA3C,IAAuDqB,2BAA0B,CAACzB,GAAD,EAAMI,CAAN,CAAjF,IAA6FsB,gBAAe,EAAnH,CAAA;AACD;;;;"}