tdesign-react 0.19.1 → 0.21.0

package/es/_chunks/dep-54eb1aab.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dep-54eb1aab.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;AACzE,MAAI;AACF,QAAIC,IAAI,GAAGP,GAAG,CAACK,GAAD,CAAH,CAASC,GAAT,CAAX;AACA,QAAIE,KAAK,GAAGD,IAAI,CAACC,KAAjB;AACD,GAHD,CAGE,OAAOC,KAAP,EAAc;AACdP,IAAAA,MAAM,CAACO,KAAD,CAAN;AACA;AACD;;AAED,MAAIF,IAAI,CAACG,IAAT,EAAe;AACbT,IAAAA,OAAO,CAACO,KAAD,CAAP;AACD,GAFD,MAEO;AACLG,IAAAA,OAAO,CAACV,OAAR,CAAgBO,KAAhB,EAAuBI,IAAvB,CAA4BT,KAA5B,EAAmCC,MAAnC;AACD;AACF;;AAEc,SAASS,iBAAT,CAA2BC,EAA3B,EAA+B;AAC5C,SAAO,YAAY;AACjB,QAAIC,IAAI,GAAG,IAAX;AAAA,QACIC,IAAI,GAAGC,SADX;AAEA,WAAO,IAAIN,OAAJ,CAAY,UAAUV,OAAV,EAAmBC,MAAnB,EAA2B;AAC5C,UAAIF,GAAG,GAAGc,EAAE,CAACI,KAAH,CAASH,IAAT,EAAeC,IAAf,CAAV;;AAEA,eAASb,KAAT,CAAeK,KAAf,EAAsB;AACpBT,QAAAA,kBAAkB,CAACC,GAAD,EAAMC,OAAN,EAAeC,MAAf,EAAuBC,KAAvB,EAA8BC,MAA9B,EAAsC,MAAtC,EAA8CI,KAA9C,CAAlB;AACD;;AAED,eAASJ,MAAT,CAAgBe,GAAhB,EAAqB;AACnBpB,QAAAA,kBAAkB,CAACC,GAAD,EAAMC,OAAN,EAAeC,MAAf,EAAuBC,KAAvB,EAA8BC,MAA9B,EAAsC,OAAtC,EAA+Ce,GAA/C,CAAlB;AACD;;AAEDhB,MAAAA,KAAK,CAACiB,SAAD,CAAL;AACD,KAZM,CAAP;AAaD,GAhBD;AAiBD;;;;;AC3BD,MAAIC,OAAO,GAAI,UAAUC,OAAV,EAAmB;AAChC;;AAEA,QAAIC,EAAE,GAAGC,MAAM,CAACC,SAAhB;AACA,QAAIC,MAAM,GAAGH,EAAE,CAACI,cAAhB;AACA,QAAIP,WAAJ,CALgC;;AAMhC,QAAIQ,OAAO,GAAG,OAAOC,MAAP,KAAkB,UAAlB,GAA+BA,MAA/B,GAAwC,EAAtD;AACA,QAAIC,cAAc,GAAGF,OAAO,CAACG,QAAR,IAAoB,YAAzC;AACA,QAAIC,mBAAmB,GAAGJ,OAAO,CAACK,aAAR,IAAyB,iBAAnD;AACA,QAAIC,iBAAiB,GAAGN,OAAO,CAACO,WAAR,IAAuB,eAA/C;;AAEA,aAASC,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;AAJoB,OAAhC;AAMA,aAAOJ,GAAG,CAAChC,GAAD,CAAV;AACD;;AACD,QAAI;;AAEF+B,MAAAA,MAAM,CAAC,EAAD,EAAK,EAAL,CAAN;AACD,KAHD,CAGE,OAAOjB,GAAP,EAAY;AACZiB,MAAAA,MAAM,GAAG,gBAASC,GAAT,EAAchC,GAAd,EAAmBG,KAAnB,EAA0B;AACjC,eAAO6B,GAAG,CAAChC,GAAD,CAAH,GAAWG,KAAlB;AACD,OAFD;AAGD;;AAED,aAASkC,IAAT,CAAcC,OAAd,EAAuBC,OAAvB,EAAgC7B,IAAhC,EAAsC8B,WAAtC,EAAmD;;AAEjD,UAAIC,cAAc,GAAGF,OAAO,IAAIA,OAAO,CAACnB,SAAR,YAA6BsB,SAAxC,GAAoDH,OAApD,GAA8DG,SAAnF;AACA,UAAIC,SAAS,GAAGxB,MAAM,CAACyB,MAAP,CAAcH,cAAc,CAACrB,SAA7B,CAAhB;AACA,UAAIyB,OAAO,GAAG,IAAIC,OAAJ,CAAYN,WAAW,IAAI,EAA3B,CAAd,CAJiD;;;AAQjDG,MAAAA,SAAS,CAACI,OAAV,GAAoBC,gBAAgB,CAACV,OAAD,EAAU5B,IAAV,EAAgBmC,OAAhB,CAApC;AAEA,aAAOF,SAAP;AACD;;AACD1B,IAAAA,OAAO,CAACoB,IAAR,GAAeA,IAAf,CAzCgC;;;;;;;;;;;AAqDhC,aAASY,QAAT,CAAkBxC,EAAlB,EAAsBuB,GAAtB,EAA2B/B,GAA3B,EAAgC;AAC9B,UAAI;AACF,eAAO;AAAEiD,UAAAA,IAAI,EAAE,QAAR;AAAkBjD,UAAAA,GAAG,EAAEQ,EAAE,CAAC0C,IAAH,CAAQnB,GAAR,EAAa/B,GAAb;AAAvB,SAAP;AACD,OAFD,CAEE,OAAOa,GAAP,EAAY;AACZ,eAAO;AAAEoC,UAAAA,IAAI,EAAE,OAAR;AAAiBjD,UAAAA,GAAG,EAAEa;AAAtB,SAAP;AACD;AACF;;AAED,QAAIsC,sBAAsB,GAAG,gBAA7B;AACA,QAAIC,sBAAsB,GAAG,gBAA7B;AACA,QAAIC,iBAAiB,GAAG,WAAxB;AACA,QAAIC,iBAAiB,GAAG,WAAxB,CAhEgC;;;AAoEhC,QAAIC,gBAAgB,GAAG,EAAvB,CApEgC;;;;;AA0EhC,aAASd,SAAT,GAAqB;;AACrB,aAASe,iBAAT,GAA6B;;AAC7B,aAASC,0BAAT,GAAsC,EA5EN;;;;AAgFhC,QAAIC,iBAAiB,GAAG,EAAxB;AACA5B,IAAAA,MAAM,CAAC4B,iBAAD,EAAoBlC,cAApB,EAAoC,YAAY;AACpD,aAAO,IAAP;AACD,KAFK,CAAN;AAIA,QAAImC,QAAQ,GAAGzC,MAAM,CAAC0C,cAAtB;AACA,QAAIC,uBAAuB,GAAGF,QAAQ,IAAIA,QAAQ,CAACA,QAAQ,CAACG,MAAM,CAAC,EAAD,CAAP,CAAT,CAAlD;;AACA,QAAID,uBAAuB,IACvBA,uBAAuB,KAAK5C,EAD5B,IAEAG,MAAM,CAAC8B,IAAP,CAAYW,uBAAZ,EAAqCrC,cAArC,CAFJ,EAE0D;;;AAGxDkC,MAAAA,iBAAiB,GAAGG,uBAApB;AACD;;AAED,QAAIE,EAAE,GAAGN,0BAA0B,CAACtC,SAA3B,GACPsB,SAAS,CAACtB,SAAV,GAAsBD,MAAM,CAACyB,MAAP,CAAce,iBAAd,CADxB;AAEAF,IAAAA,iBAAiB,CAACrC,SAAlB,GAA8BsC,0BAA9B;AACA3B,IAAAA,MAAM,CAACiC,EAAD,EAAK,aAAL,EAAoBN,0BAApB,CAAN;AACA3B,IAAAA,MAAM,CAAC2B,0BAAD,EAA6B,aAA7B,EAA4CD,iBAA5C,CAAN;AACAA,IAAAA,iBAAiB,CAACQ,WAAlB,GAAgClC,MAAM,CACpC2B,0BADoC,EAEpC7B,iBAFoC,EAGpC,mBAHoC,CAAtC,CApGgC;;;AA4GhC,aAASqC,qBAAT,CAA+B9C,SAA/B,EAA0C;AACxC,OAAC,MAAD,EAAS,OAAT,EAAkB,QAAlB,EAA4B+C,OAA5B,CAAoC,UAASC,MAAT,EAAiB;AACnDrC,QAAAA,MAAM,CAACX,SAAD,EAAYgD,MAAZ,EAAoB,UAASnE,GAAT,EAAc;AACtC,iBAAO,KAAK8C,OAAL,CAAaqB,MAAb,EAAqBnE,GAArB,CAAP;AACD,SAFK,CAAN;AAGD,OAJD;AAKD;;AAEDgB,IAAAA,OAAO,CAACoD,mBAAR,GAA8B,UAASC,MAAT,EAAiB;AAC7C,UAAIC,IAAI,GAAG,OAAOD,MAAP,KAAkB,UAAlB,IAAgCA,MAAM,CAACE,WAAlD;AACA,aAAOD,IAAI,GACPA,IAAI,KAAKd,iBAAT;;AAGA,OAACc,IAAI,CAACN,WAAL,IAAoBM,IAAI,CAACE,IAA1B,MAAoC,mBAJ7B,GAKP,KALJ;AAMD,KARD;;AAUAxD,IAAAA,OAAO,CAACyD,IAAR,GAAe,UAASJ,MAAT,EAAiB;AAC9B,UAAInD,MAAM,CAACwD,cAAX,EAA2B;AACzBxD,QAAAA,MAAM,CAACwD,cAAP,CAAsBL,MAAtB,EAA8BZ,0BAA9B;AACD,OAFD,MAEO;AACLY,QAAAA,MAAM,CAACM,SAAP,GAAmBlB,0BAAnB;AACA3B,QAAAA,MAAM,CAACuC,MAAD,EAASzC,iBAAT,EAA4B,mBAA5B,CAAN;AACD;;AACDyC,MAAAA,MAAM,CAAClD,SAAP,GAAmBD,MAAM,CAACyB,MAAP,CAAcoB,EAAd,CAAnB;AACA,aAAOM,MAAP;AACD,KATD,CA9HgC;;;;;;AA6IhCrD,IAAAA,OAAO,CAAC4D,KAAR,GAAgB,UAAS5E,GAAT,EAAc;AAC5B,aAAO;AAAE6E,QAAAA,OAAO,EAAE7E;AAAX,OAAP;AACD,KAFD;;AAIA,aAAS8E,aAAT,CAAuBpC,SAAvB,EAAkCqC,WAAlC,EAA+C;AAC7C,eAASC,MAAT,CAAgBb,MAAhB,EAAwBnE,GAAxB,EAA6BL,OAA7B,EAAsCC,MAAtC,EAA8C;AAC5C,YAAIqF,MAAM,GAAGjC,QAAQ,CAACN,SAAS,CAACyB,MAAD,CAAV,EAAoBzB,SAApB,EAA+B1C,GAA/B,CAArB;;AACA,YAAIiF,MAAM,CAAChC,IAAP,KAAgB,OAApB,EAA6B;AAC3BrD,UAAAA,MAAM,CAACqF,MAAM,CAACjF,GAAR,CAAN;AACD,SAFD,MAEO;AACL,cAAIkF,MAAM,GAAGD,MAAM,CAACjF,GAApB;AACA,cAAIE,KAAK,GAAGgF,MAAM,CAAChF,KAAnB;;AACA,cAAIA,KAAK,IACL,QAAOA,KAAP,MAAiB,QADjB,IAEAkB,MAAM,CAAC8B,IAAP,CAAYhD,KAAZ,EAAmB,SAAnB,CAFJ,EAEmC;AACjC,mBAAO6E,WAAW,CAACpF,OAAZ,CAAoBO,KAAK,CAAC2E,OAA1B,EAAmCvE,IAAnC,CAAwC,UAASJ,KAAT,EAAgB;AAC7D8E,cAAAA,MAAM,CAAC,MAAD,EAAS9E,KAAT,EAAgBP,OAAhB,EAAyBC,MAAzB,CAAN;AACD,aAFM,EAEJ,UAASiB,GAAT,EAAc;AACfmE,cAAAA,MAAM,CAAC,OAAD,EAAUnE,GAAV,EAAelB,OAAf,EAAwBC,MAAxB,CAAN;AACD,aAJM,CAAP;AAKD;;AAED,iBAAOmF,WAAW,CAACpF,OAAZ,CAAoBO,KAApB,EAA2BI,IAA3B,CAAgC,UAAS6E,SAAT,EAAoB;;;;AAIzDD,YAAAA,MAAM,CAAChF,KAAP,GAAeiF,SAAf;AACAxF,YAAAA,OAAO,CAACuF,MAAD,CAAP;AACD,WANM,EAMJ,UAAS/E,KAAT,EAAgB;;;AAGjB,mBAAO6E,MAAM,CAAC,OAAD,EAAU7E,KAAV,EAAiBR,OAAjB,EAA0BC,MAA1B,CAAb;AACD,WAVM,CAAP;AAWD;AACF;;AAED,UAAIwF,eAAJ;;AAEA,eAASC,OAAT,CAAiBlB,MAAjB,EAAyBnE,GAAzB,EAA8B;AAC5B,iBAASsF,0BAAT,GAAsC;AACpC,iBAAO,IAAIP,WAAJ,CAAgB,UAASpF,OAAT,EAAkBC,MAAlB,EAA0B;AAC/CoF,YAAAA,MAAM,CAACb,MAAD,EAASnE,GAAT,EAAcL,OAAd,EAAuBC,MAAvB,CAAN;AACD,WAFM,CAAP;AAGD;;AAED,eAAOwF,eAAe;;;;;;;;;;;;AAapBA,QAAAA,eAAe,GAAGA,eAAe,CAAC9E,IAAhB,CAChBgF,0BADgB;;AAIhBA,QAAAA,0BAJgB,CAAH,GAKXA,0BAA0B,EAlBhC;AAmBD,OA5D4C;;;;AAgE7C,WAAKxC,OAAL,GAAeuC,OAAf;AACD;;AAEDpB,IAAAA,qBAAqB,CAACa,aAAa,CAAC3D,SAAf,CAArB;AACAW,IAAAA,MAAM,CAACgD,aAAa,CAAC3D,SAAf,EAA0BO,mBAA1B,EAA+C,YAAY;AAC/D,aAAO,IAAP;AACD,KAFK,CAAN;AAGAV,IAAAA,OAAO,CAAC8D,aAAR,GAAwBA,aAAxB,CAxNgC;;;;AA6NhC9D,IAAAA,OAAO,CAACuE,KAAR,GAAgB,UAASlD,OAAT,EAAkBC,OAAlB,EAA2B7B,IAA3B,EAAiC8B,WAAjC,EAA8CwC,WAA9C,EAA2D;AACzE,UAAIA,WAAW,KAAK,KAAK,CAAzB,EAA4BA,WAAW,GAAG1E,OAAd;AAE5B,UAAImF,IAAI,GAAG,IAAIV,aAAJ,CACT1C,IAAI,CAACC,OAAD,EAAUC,OAAV,EAAmB7B,IAAnB,EAAyB8B,WAAzB,CADK,EAETwC,WAFS,CAAX;AAKA,aAAO/D,OAAO,CAACoD,mBAAR,CAA4B9B,OAA5B,IACHkD,IADG;AAAA,QAEHA,IAAI,CAACC,IAAL,GAAYnF,IAAZ,CAAiB,UAAS4E,MAAT,EAAiB;AAChC,eAAOA,MAAM,CAAC9E,IAAP,GAAc8E,MAAM,CAAChF,KAArB,GAA6BsF,IAAI,CAACC,IAAL,EAApC;AACD,OAFD,CAFJ;AAKD,KAbD;;AAeA,aAAS1C,gBAAT,CAA0BV,OAA1B,EAAmC5B,IAAnC,EAAyCmC,OAAzC,EAAkD;AAChD,UAAI8C,KAAK,GAAGvC,sBAAZ;AAEA,aAAO,SAAS6B,MAAT,CAAgBb,MAAhB,EAAwBnE,GAAxB,EAA6B;AAClC,YAAI0F,KAAK,KAAKrC,iBAAd,EAAiC;AAC/B,gBAAM,IAAIsC,KAAJ,CAAU,8BAAV,CAAN;AACD;;AAED,YAAID,KAAK,KAAKpC,iBAAd,EAAiC;AAC/B,cAAIa,MAAM,KAAK,OAAf,EAAwB;AACtB,kBAAMnE,GAAN;AACD,WAH8B;;;;AAO/B,iBAAO4F,UAAU,EAAjB;AACD;;AAEDhD,QAAAA,OAAO,CAACuB,MAAR,GAAiBA,MAAjB;AACAvB,QAAAA,OAAO,CAAC5C,GAAR,GAAcA,GAAd;;AAEA,eAAO,IAAP,EAAa;AACX,cAAI6F,QAAQ,GAAGjD,OAAO,CAACiD,QAAvB;;AACA,cAAIA,QAAJ,EAAc;AACZ,gBAAIC,cAAc,GAAGC,mBAAmB,CAACF,QAAD,EAAWjD,OAAX,CAAxC;;AACA,gBAAIkD,cAAJ,EAAoB;AAClB,kBAAIA,cAAc,KAAKvC,gBAAvB,EAAyC;AACzC,qBAAOuC,cAAP;AACD;AACF;;AAED,cAAIlD,OAAO,CAACuB,MAAR,KAAmB,MAAvB,EAA+B;;;AAG7BvB,YAAAA,OAAO,CAACoD,IAAR,GAAepD,OAAO,CAACqD,KAAR,GAAgBrD,OAAO,CAAC5C,GAAvC;AAED,WALD,MAKO,IAAI4C,OAAO,CAACuB,MAAR,KAAmB,OAAvB,EAAgC;AACrC,gBAAIuB,KAAK,KAAKvC,sBAAd,EAAsC;AACpCuC,cAAAA,KAAK,GAAGpC,iBAAR;AACA,oBAAMV,OAAO,CAAC5C,GAAd;AACD;;AAED4C,YAAAA,OAAO,CAACsD,iBAAR,CAA0BtD,OAAO,CAAC5C,GAAlC;AAED,WARM,MAQA,IAAI4C,OAAO,CAACuB,MAAR,KAAmB,QAAvB,EAAiC;AACtCvB,YAAAA,OAAO,CAACuD,MAAR,CAAe,QAAf,EAAyBvD,OAAO,CAAC5C,GAAjC;AACD;;AAED0F,UAAAA,KAAK,GAAGrC,iBAAR;AAEA,cAAI4B,MAAM,GAAGjC,QAAQ,CAACX,OAAD,EAAU5B,IAAV,EAAgBmC,OAAhB,CAArB;;AACA,cAAIqC,MAAM,CAAChC,IAAP,KAAgB,QAApB,EAA8B;;;AAG5ByC,YAAAA,KAAK,GAAG9C,OAAO,CAACxC,IAAR,GACJkD,iBADI,GAEJF,sBAFJ;;AAIA,gBAAI6B,MAAM,CAACjF,GAAP,KAAeuD,gBAAnB,EAAqC;AACnC;AACD;;AAED,mBAAO;AACLrD,cAAAA,KAAK,EAAE+E,MAAM,CAACjF,GADT;AAELI,cAAAA,IAAI,EAAEwC,OAAO,CAACxC;AAFT,aAAP;AAKD,WAhBD,MAgBO,IAAI6E,MAAM,CAAChC,IAAP,KAAgB,OAApB,EAA6B;AAClCyC,YAAAA,KAAK,GAAGpC,iBAAR,CADkC;;;AAIlCV,YAAAA,OAAO,CAACuB,MAAR,GAAiB,OAAjB;AACAvB,YAAAA,OAAO,CAAC5C,GAAR,GAAciF,MAAM,CAACjF,GAArB;AACD;AACF;AACF,OAxED;AAyED,KAxT+B;;;;;;AA8ThC,aAAS+F,mBAAT,CAA6BF,QAA7B,EAAuCjD,OAAvC,EAAgD;AAC9C,UAAIuB,MAAM,GAAG0B,QAAQ,CAACpE,QAAT,CAAkBmB,OAAO,CAACuB,MAA1B,CAAb;;AACA,UAAIA,MAAM,KAAKrD,WAAf,EAA0B;;;AAGxB8B,QAAAA,OAAO,CAACiD,QAAR,GAAmB,IAAnB;;AAEA,YAAIjD,OAAO,CAACuB,MAAR,KAAmB,OAAvB,EAAgC;;AAE9B,cAAI0B,QAAQ,CAACpE,QAAT,CAAkB,QAAlB,CAAJ,EAAiC;;;AAG/BmB,YAAAA,OAAO,CAACuB,MAAR,GAAiB,QAAjB;AACAvB,YAAAA,OAAO,CAAC5C,GAAR,GAAcc,WAAd;AACAiF,YAAAA,mBAAmB,CAACF,QAAD,EAAWjD,OAAX,CAAnB;;AAEA,gBAAIA,OAAO,CAACuB,MAAR,KAAmB,OAAvB,EAAgC;;;AAG9B,qBAAOZ,gBAAP;AACD;AACF;;AAEDX,UAAAA,OAAO,CAACuB,MAAR,GAAiB,OAAjB;AACAvB,UAAAA,OAAO,CAAC5C,GAAR,GAAc,IAAIoG,SAAJ,CACZ,gDADY,CAAd;AAED;;AAED,eAAO7C,gBAAP;AACD;;AAED,UAAI0B,MAAM,GAAGjC,QAAQ,CAACmB,MAAD,EAAS0B,QAAQ,CAACpE,QAAlB,EAA4BmB,OAAO,CAAC5C,GAApC,CAArB;;AAEA,UAAIiF,MAAM,CAAChC,IAAP,KAAgB,OAApB,EAA6B;AAC3BL,QAAAA,OAAO,CAACuB,MAAR,GAAiB,OAAjB;AACAvB,QAAAA,OAAO,CAAC5C,GAAR,GAAciF,MAAM,CAACjF,GAArB;AACA4C,QAAAA,OAAO,CAACiD,QAAR,GAAmB,IAAnB;AACA,eAAOtC,gBAAP;AACD;;AAED,UAAItD,IAAI,GAAGgF,MAAM,CAACjF,GAAlB;;AAEA,UAAI,CAAEC,IAAN,EAAY;AACV2C,QAAAA,OAAO,CAACuB,MAAR,GAAiB,OAAjB;AACAvB,QAAAA,OAAO,CAAC5C,GAAR,GAAc,IAAIoG,SAAJ,CAAc,kCAAd,CAAd;AACAxD,QAAAA,OAAO,CAACiD,QAAR,GAAmB,IAAnB;AACA,eAAOtC,gBAAP;AACD;;AAED,UAAItD,IAAI,CAACG,IAAT,EAAe;;;AAGbwC,QAAAA,OAAO,CAACiD,QAAQ,CAACQ,UAAV,CAAP,GAA+BpG,IAAI,CAACC,KAApC,CAHa;;AAMb0C,QAAAA,OAAO,CAAC6C,IAAR,GAAeI,QAAQ,CAACS,OAAxB,CANa;;;;;;;AAcb,YAAI1D,OAAO,CAACuB,MAAR,KAAmB,QAAvB,EAAiC;AAC/BvB,UAAAA,OAAO,CAACuB,MAAR,GAAiB,MAAjB;AACAvB,UAAAA,OAAO,CAAC5C,GAAR,GAAcc,WAAd;AACD;AAEF,OAnBD,MAmBO;;AAEL,eAAOb,IAAP;AACD,OAvE6C;;;;AA2E9C2C,MAAAA,OAAO,CAACiD,QAAR,GAAmB,IAAnB;AACA,aAAOtC,gBAAP;AACD,KA3Y+B;;;;AA+YhCU,IAAAA,qBAAqB,CAACF,EAAD,CAArB;AAEAjC,IAAAA,MAAM,CAACiC,EAAD,EAAKnC,iBAAL,EAAwB,WAAxB,CAAN,CAjZgC;;;;;;AAwZhCE,IAAAA,MAAM,CAACiC,EAAD,EAAKvC,cAAL,EAAqB,YAAW;AACpC,aAAO,IAAP;AACD,KAFK,CAAN;AAIAM,IAAAA,MAAM,CAACiC,EAAD,EAAK,UAAL,EAAiB,YAAW;AAChC,aAAO,oBAAP;AACD,KAFK,CAAN;;AAIA,aAASwC,YAAT,CAAsBC,IAAtB,EAA4B;AAC1B,UAAIC,KAAK,GAAG;AAAEC,QAAAA,MAAM,EAAEF,IAAI,CAAC,CAAD;AAAd,OAAZ;;AAEA,UAAI,KAAKA,IAAT,EAAe;AACbC,QAAAA,KAAK,CAACE,QAAN,GAAiBH,IAAI,CAAC,CAAD,CAArB;AACD;;AAED,UAAI,KAAKA,IAAT,EAAe;AACbC,QAAAA,KAAK,CAACG,UAAN,GAAmBJ,IAAI,CAAC,CAAD,CAAvB;AACAC,QAAAA,KAAK,CAACI,QAAN,GAAiBL,IAAI,CAAC,CAAD,CAArB;AACD;;AAED,WAAKM,UAAL,CAAgBC,IAAhB,CAAqBN,KAArB;AACD;;AAED,aAASO,aAAT,CAAuBP,KAAvB,EAA8B;AAC5B,UAAIxB,MAAM,GAAGwB,KAAK,CAACQ,UAAN,IAAoB,EAAjC;AACAhC,MAAAA,MAAM,CAAChC,IAAP,GAAc,QAAd;AACA,aAAOgC,MAAM,CAACjF,GAAd;AACAyG,MAAAA,KAAK,CAACQ,UAAN,GAAmBhC,MAAnB;AACD;;AAED,aAASpC,OAAT,CAAiBN,WAAjB,EAA8B;;;;AAI5B,WAAKuE,UAAL,GAAkB,CAAC;AAAEJ,QAAAA,MAAM,EAAE;AAAV,OAAD,CAAlB;AACAnE,MAAAA,WAAW,CAAC2B,OAAZ,CAAoBqC,YAApB,EAAkC,IAAlC;AACA,WAAKW,KAAL,CAAW,IAAX;AACD;;AAEDlG,IAAAA,OAAO,CAACmG,IAAR,GAAe,UAASC,MAAT,EAAiB;AAC9B,UAAID,IAAI,GAAG,EAAX;;AACA,WAAK,IAAIpH,GAAT,IAAgBqH,MAAhB,EAAwB;AACtBD,QAAAA,IAAI,CAACJ,IAAL,CAAUhH,GAAV;AACD;;AACDoH,MAAAA,IAAI,CAACE,OAAL,GAL8B;;;AAS9B,aAAO,SAAS5B,IAAT,GAAgB;AACrB,eAAO0B,IAAI,CAACG,MAAZ,EAAoB;AAClB,cAAIvH,GAAG,GAAGoH,IAAI,CAACI,GAAL,EAAV;;AACA,cAAIxH,GAAG,IAAIqH,MAAX,EAAmB;AACjB3B,YAAAA,IAAI,CAACvF,KAAL,GAAaH,GAAb;AACA0F,YAAAA,IAAI,CAACrF,IAAL,GAAY,KAAZ;AACA,mBAAOqF,IAAP;AACD;AACF,SARoB;;;;;AAarBA,QAAAA,IAAI,CAACrF,IAAL,GAAY,IAAZ;AACA,eAAOqF,IAAP;AACD,OAfD;AAgBD,KAzBD;;AA2BA,aAAS3B,MAAT,CAAgB0D,QAAhB,EAA0B;AACxB,UAAIA,QAAJ,EAAc;AACZ,YAAIC,cAAc,GAAGD,QAAQ,CAAChG,cAAD,CAA7B;;AACA,YAAIiG,cAAJ,EAAoB;AAClB,iBAAOA,cAAc,CAACvE,IAAf,CAAoBsE,QAApB,CAAP;AACD;;AAED,YAAI,OAAOA,QAAQ,CAAC/B,IAAhB,KAAyB,UAA7B,EAAyC;AACvC,iBAAO+B,QAAP;AACD;;AAED,YAAI,CAACE,KAAK,CAACF,QAAQ,CAACF,MAAV,CAAV,EAA6B;AAC3B,cAAIK,CAAC,GAAG,CAAC,CAAT;AAAA,cAAYlC,IAAI,GAAG,SAASA,IAAT,GAAgB;AACjC,mBAAO,EAAEkC,CAAF,GAAMH,QAAQ,CAACF,MAAtB,EAA8B;AAC5B,kBAAIlG,MAAM,CAAC8B,IAAP,CAAYsE,QAAZ,EAAsBG,CAAtB,CAAJ,EAA8B;AAC5BlC,gBAAAA,IAAI,CAACvF,KAAL,GAAasH,QAAQ,CAACG,CAAD,CAArB;AACAlC,gBAAAA,IAAI,CAACrF,IAAL,GAAY,KAAZ;AACA,uBAAOqF,IAAP;AACD;AACF;;AAEDA,YAAAA,IAAI,CAACvF,KAAL,GAAaY,WAAb;AACA2E,YAAAA,IAAI,CAACrF,IAAL,GAAY,IAAZ;AAEA,mBAAOqF,IAAP;AACD,WAbD;;AAeA,iBAAOA,IAAI,CAACA,IAAL,GAAYA,IAAnB;AACD;AACF,OA7BuB;;;AAgCxB,aAAO;AAAEA,QAAAA,IAAI,EAAEG;AAAR,OAAP;AACD;;AACD5E,IAAAA,OAAO,CAAC8C,MAAR,GAAiBA,MAAjB;;AAEA,aAAS8B,UAAT,GAAsB;AACpB,aAAO;AAAE1F,QAAAA,KAAK,EAAEY,WAAT;AAAoBV,QAAAA,IAAI,EAAE;AAA1B,OAAP;AACD;;AAEDyC,IAAAA,OAAO,CAAC1B,SAAR,GAAoB;AAClBoD,MAAAA,WAAW,EAAE1B,OADK;AAGlBqE,MAAAA,KAAK,EAAE,eAASU,aAAT,EAAwB;AAC7B,aAAKC,IAAL,GAAY,CAAZ;AACA,aAAKpC,IAAL,GAAY,CAAZ,CAF6B;;;AAK7B,aAAKO,IAAL,GAAY,KAAKC,KAAL,GAAanF,WAAzB;AACA,aAAKV,IAAL,GAAY,KAAZ;AACA,aAAKyF,QAAL,GAAgB,IAAhB;AAEA,aAAK1B,MAAL,GAAc,MAAd;AACA,aAAKnE,GAAL,GAAWc,WAAX;AAEA,aAAKgG,UAAL,CAAgB5C,OAAhB,CAAwB8C,aAAxB;;AAEA,YAAI,CAACY,aAAL,EAAoB;AAClB,eAAK,IAAIpD,IAAT,IAAiB,IAAjB,EAAuB;;AAErB,gBAAIA,IAAI,CAACsD,MAAL,CAAY,CAAZ,MAAmB,GAAnB,IACA1G,MAAM,CAAC8B,IAAP,CAAY,IAAZ,EAAkBsB,IAAlB,CADA,IAEA,CAACkD,KAAK,CAAC,CAAClD,IAAI,CAACuD,KAAL,CAAW,CAAX,CAAF,CAFV,EAE4B;AAC1B,mBAAKvD,IAAL,IAAa1D,WAAb;AACD;AACF;AACF;AACF,OA3BiB;AA6BlBkH,MAAAA,IAAI,EAAE,gBAAW;AACf,aAAK5H,IAAL,GAAY,IAAZ;AAEA,YAAI6H,SAAS,GAAG,KAAKnB,UAAL,CAAgB,CAAhB,CAAhB;AACA,YAAIoB,UAAU,GAAGD,SAAS,CAAChB,UAA3B;;AACA,YAAIiB,UAAU,CAACjF,IAAX,KAAoB,OAAxB,EAAiC;AAC/B,gBAAMiF,UAAU,CAAClI,GAAjB;AACD;;AAED,eAAO,KAAKmI,IAAZ;AACD,OAvCiB;AAyClBjC,MAAAA,iBAAiB,EAAE,2BAASkC,SAAT,EAAoB;AACrC,YAAI,KAAKhI,IAAT,EAAe;AACb,gBAAMgI,SAAN;AACD;;AAED,YAAIxF,OAAO,GAAG,IAAd;;AACA,iBAASyF,MAAT,CAAgBC,GAAhB,EAAqBC,MAArB,EAA6B;AAC3BtD,UAAAA,MAAM,CAAChC,IAAP,GAAc,OAAd;AACAgC,UAAAA,MAAM,CAACjF,GAAP,GAAaoI,SAAb;AACAxF,UAAAA,OAAO,CAAC6C,IAAR,GAAe6C,GAAf;;AAEA,cAAIC,MAAJ,EAAY;;;AAGV3F,YAAAA,OAAO,CAACuB,MAAR,GAAiB,MAAjB;AACAvB,YAAAA,OAAO,CAAC5C,GAAR,GAAcc,WAAd;AACD;;AAED,iBAAO,CAAC,CAAEyH,MAAV;AACD;;AAED,aAAK,IAAIZ,CAAC,GAAG,KAAKb,UAAL,CAAgBQ,MAAhB,GAAyB,CAAtC,EAAyCK,CAAC,IAAI,CAA9C,EAAiD,EAAEA,CAAnD,EAAsD;AACpD,cAAIlB,KAAK,GAAG,KAAKK,UAAL,CAAgBa,CAAhB,CAAZ;AACA,cAAI1C,MAAM,GAAGwB,KAAK,CAACQ,UAAnB;;AAEA,cAAIR,KAAK,CAACC,MAAN,KAAiB,MAArB,EAA6B;;;;AAI3B,mBAAO2B,MAAM,CAAC,KAAD,CAAb;AACD;;AAED,cAAI5B,KAAK,CAACC,MAAN,IAAgB,KAAKmB,IAAzB,EAA+B;AAC7B,gBAAIW,QAAQ,GAAGpH,MAAM,CAAC8B,IAAP,CAAYuD,KAAZ,EAAmB,UAAnB,CAAf;AACA,gBAAIgC,UAAU,GAAGrH,MAAM,CAAC8B,IAAP,CAAYuD,KAAZ,EAAmB,YAAnB,CAAjB;;AAEA,gBAAI+B,QAAQ,IAAIC,UAAhB,EAA4B;AAC1B,kBAAI,KAAKZ,IAAL,GAAYpB,KAAK,CAACE,QAAtB,EAAgC;AAC9B,uBAAO0B,MAAM,CAAC5B,KAAK,CAACE,QAAP,EAAiB,IAAjB,CAAb;AACD,eAFD,MAEO,IAAI,KAAKkB,IAAL,GAAYpB,KAAK,CAACG,UAAtB,EAAkC;AACvC,uBAAOyB,MAAM,CAAC5B,KAAK,CAACG,UAAP,CAAb;AACD;AAEF,aAPD,MAOO,IAAI4B,QAAJ,EAAc;AACnB,kBAAI,KAAKX,IAAL,GAAYpB,KAAK,CAACE,QAAtB,EAAgC;AAC9B,uBAAO0B,MAAM,CAAC5B,KAAK,CAACE,QAAP,EAAiB,IAAjB,CAAb;AACD;AAEF,aALM,MAKA,IAAI8B,UAAJ,EAAgB;AACrB,kBAAI,KAAKZ,IAAL,GAAYpB,KAAK,CAACG,UAAtB,EAAkC;AAChC,uBAAOyB,MAAM,CAAC5B,KAAK,CAACG,UAAP,CAAb;AACD;AAEF,aALM,MAKA;AACL,oBAAM,IAAIjB,KAAJ,CAAU,wCAAV,CAAN;AACD;AACF;AACF;AACF,OAnGiB;AAqGlBQ,MAAAA,MAAM,EAAE,gBAASlD,IAAT,EAAejD,GAAf,EAAoB;AAC1B,aAAK,IAAI2H,CAAC,GAAG,KAAKb,UAAL,CAAgBQ,MAAhB,GAAyB,CAAtC,EAAyCK,CAAC,IAAI,CAA9C,EAAiD,EAAEA,CAAnD,EAAsD;AACpD,cAAIlB,KAAK,GAAG,KAAKK,UAAL,CAAgBa,CAAhB,CAAZ;;AACA,cAAIlB,KAAK,CAACC,MAAN,IAAgB,KAAKmB,IAArB,IACAzG,MAAM,CAAC8B,IAAP,CAAYuD,KAAZ,EAAmB,YAAnB,CADA,IAEA,KAAKoB,IAAL,GAAYpB,KAAK,CAACG,UAFtB,EAEkC;AAChC,gBAAI8B,YAAY,GAAGjC,KAAnB;AACA;AACD;AACF;;AAED,YAAIiC,YAAY,KACXzF,IAAI,KAAK,OAAT,IACAA,IAAI,KAAK,UAFE,CAAZ,IAGAyF,YAAY,CAAChC,MAAb,IAAuB1G,GAHvB,IAIAA,GAAG,IAAI0I,YAAY,CAAC9B,UAJxB,EAIoC;;;AAGlC8B,UAAAA,YAAY,GAAG,IAAf;AACD;;AAED,YAAIzD,MAAM,GAAGyD,YAAY,GAAGA,YAAY,CAACzB,UAAhB,GAA6B,EAAtD;AACAhC,QAAAA,MAAM,CAAChC,IAAP,GAAcA,IAAd;AACAgC,QAAAA,MAAM,CAACjF,GAAP,GAAaA,GAAb;;AAEA,YAAI0I,YAAJ,EAAkB;AAChB,eAAKvE,MAAL,GAAc,MAAd;AACA,eAAKsB,IAAL,GAAYiD,YAAY,CAAC9B,UAAzB;AACA,iBAAOrD,gBAAP;AACD;;AAED,eAAO,KAAKoF,QAAL,CAAc1D,MAAd,CAAP;AACD,OArIiB;AAuIlB0D,MAAAA,QAAQ,EAAE,kBAAS1D,MAAT,EAAiB4B,QAAjB,EAA2B;AACnC,YAAI5B,MAAM,CAAChC,IAAP,KAAgB,OAApB,EAA6B;AAC3B,gBAAMgC,MAAM,CAACjF,GAAb;AACD;;AAED,YAAIiF,MAAM,CAAChC,IAAP,KAAgB,OAAhB,IACAgC,MAAM,CAAChC,IAAP,KAAgB,UADpB,EACgC;AAC9B,eAAKwC,IAAL,GAAYR,MAAM,CAACjF,GAAnB;AACD,SAHD,MAGO,IAAIiF,MAAM,CAAChC,IAAP,KAAgB,QAApB,EAA8B;AACnC,eAAKkF,IAAL,GAAY,KAAKnI,GAAL,GAAWiF,MAAM,CAACjF,GAA9B;AACA,eAAKmE,MAAL,GAAc,QAAd;AACA,eAAKsB,IAAL,GAAY,KAAZ;AACD,SAJM,MAIA,IAAIR,MAAM,CAAChC,IAAP,KAAgB,QAAhB,IAA4B4D,QAAhC,EAA0C;AAC/C,eAAKpB,IAAL,GAAYoB,QAAZ;AACD;;AAED,eAAOtD,gBAAP;AACD,OAxJiB;AA0JlBqF,MAAAA,MAAM,EAAE,gBAAShC,UAAT,EAAqB;AAC3B,aAAK,IAAIe,CAAC,GAAG,KAAKb,UAAL,CAAgBQ,MAAhB,GAAyB,CAAtC,EAAyCK,CAAC,IAAI,CAA9C,EAAiD,EAAEA,CAAnD,EAAsD;AACpD,cAAIlB,KAAK,GAAG,KAAKK,UAAL,CAAgBa,CAAhB,CAAZ;;AACA,cAAIlB,KAAK,CAACG,UAAN,KAAqBA,UAAzB,EAAqC;AACnC,iBAAK+B,QAAL,CAAclC,KAAK,CAACQ,UAApB,EAAgCR,KAAK,CAACI,QAAtC;AACAG,YAAAA,aAAa,CAACP,KAAD,CAAb;AACA,mBAAOlD,gBAAP;AACD;AACF;AACF,OAnKiB;AAqKlB,eAAS,gBAASmD,MAAT,EAAiB;AACxB,aAAK,IAAIiB,CAAC,GAAG,KAAKb,UAAL,CAAgBQ,MAAhB,GAAyB,CAAtC,EAAyCK,CAAC,IAAI,CAA9C,EAAiD,EAAEA,CAAnD,EAAsD;AACpD,cAAIlB,KAAK,GAAG,KAAKK,UAAL,CAAgBa,CAAhB,CAAZ;;AACA,cAAIlB,KAAK,CAACC,MAAN,KAAiBA,MAArB,EAA6B;AAC3B,gBAAIzB,MAAM,GAAGwB,KAAK,CAACQ,UAAnB;;AACA,gBAAIhC,MAAM,CAAChC,IAAP,KAAgB,OAApB,EAA6B;AAC3B,kBAAI4F,MAAM,GAAG5D,MAAM,CAACjF,GAApB;AACAgH,cAAAA,aAAa,CAACP,KAAD,CAAb;AACD;;AACD,mBAAOoC,MAAP;AACD;AACF,SAXuB;;;;AAexB,cAAM,IAAIlD,KAAJ,CAAU,uBAAV,CAAN;AACD,OArLiB;AAuLlBmD,MAAAA,aAAa,EAAE,uBAAStB,QAAT,EAAmBnB,UAAnB,EAA+BC,OAA/B,EAAwC;AACrD,aAAKT,QAAL,GAAgB;AACdpE,UAAAA,QAAQ,EAAEqC,MAAM,CAAC0D,QAAD,CADF;AAEdnB,UAAAA,UAAU,EAAEA,UAFE;AAGdC,UAAAA,OAAO,EAAEA;AAHK,SAAhB;;AAMA,YAAI,KAAKnC,MAAL,KAAgB,MAApB,EAA4B;;;AAG1B,eAAKnE,GAAL,GAAWc,WAAX;AACD;;AAED,eAAOyC,gBAAP;AACD;AArMiB,KAApB,CAlgBgC;;;;;AA8sBhC,WAAOvC,OAAP;AAED,GAhtBc;;;;AAqtBb,eAAkB,QAAlB,GAA6B+H,MAAM,CAAC/H,OAApC,GAA8C,EArtBjC,CAAf;;AAwtBA,MAAI;AACFgI,IAAAA,kBAAkB,GAAGjI,OAArB;AACD,GAFD,CAEE,OAAOkI,oBAAP,EAA6B;;;;;;;;;;;AAW7B,QAAI,QAAOC,UAAP,yCAAOA,UAAP,OAAsB,QAA1B,EAAoC;AAClCA,MAAAA,UAAU,CAACF,kBAAX,GAAgCjI,OAAhC;AACD,KAFD,MAEO;AACLoI,MAAAA,QAAQ,CAAC,GAAD,EAAM,wBAAN,CAAR,CAAwCpI,OAAxC;AACD;;;;;;IChvBHqI,WAAc,GAAGC;;;;"}

package/es/_chunks/dep-5a5d372b.js

@@ -1,415 +0,0 @@
-/**
- * tdesign v0.19.1
- * (c) 2021 tdesign
- * @license MIT
- */
-
-import { _ as _defineProperty$1 } from './dep-bd2ff6be.js';
-import './dep-3796d701.js';
-import { c as _castPath, d as _toKey, _ as _baseGet } from './dep-00019a7f.js';
-import { b as _defineProperty, _ as _overRest, a as _setToString } from './dep-9bd0c578.js';
-import { e as eq_1 } from './dep-fbe7c735.js';
-import { _ as _isIndex } from './dep-1e5e4f5d.js';
-import { i as isObject_1 } from './dep-7e18698b.js';
-import './dep-b48a9335.js';
-import { i as isArguments_1 } from './dep-78a5c5d6.js';
-import { i as isArray_1 } from './dep-43b6ec11.js';
-import './dep-53bb8c23.js';
-import { i as isLength_1 } from './dep-41d15e2c.js';
-import { f as flatten_1 } from './dep-b0adec50.js';
-
-var defineProperty = _defineProperty;
-/**
- * The base implementation of `assignValue` and `assignMergeValue` without
- * value checks.
- *
- * @private
- * @param {Object} object The object to modify.
- * @param {string} key The key of the property to assign.
- * @param {*} value The value to assign.
- */
-
-function baseAssignValue$1(object, key, value) {
-  if (key == '__proto__' && defineProperty) {
-    defineProperty(object, key, {
-      'configurable': true,
-      'enumerable': true,
-      'value': value,
-      'writable': true
-    });
-  } else {
-    object[key] = value;
-  }
-}
-
-var _baseAssignValue = baseAssignValue$1;
-
-var baseAssignValue = _baseAssignValue,
-    eq = eq_1;
-/** Used for built-in method references. */
-
-var objectProto = Object.prototype;
-/** Used to check objects for own properties. */
-
-var hasOwnProperty = objectProto.hasOwnProperty;
-/**
- * Assigns `value` to `key` of `object` if the existing value is not equivalent
- * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
- * for equality comparisons.
- *
- * @private
- * @param {Object} object The object to modify.
- * @param {string} key The key of the property to assign.
- * @param {*} value The value to assign.
- */
-
-function assignValue$1(object, key, value) {
-  var objValue = object[key];
-
-  if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) || value === undefined && !(key in object)) {
-    baseAssignValue(object, key, value);
-  }
-}
-
-var _assignValue = assignValue$1;
-
-var assignValue = _assignValue,
-    castPath$2 = _castPath,
-    isIndex$1 = _isIndex,
-    isObject = isObject_1,
-    toKey$1 = _toKey;
-/**
- * The base implementation of `_.set`.
- *
- * @private
- * @param {Object} object The object to modify.
- * @param {Array|string} path The path of the property to set.
- * @param {*} value The value to set.
- * @param {Function} [customizer] The function to customize path creation.
- * @returns {Object} Returns `object`.
- */
-
-function baseSet$1(object, path, value, customizer) {
-  if (!isObject(object)) {
-    return object;
-  }
-
-  path = castPath$2(path, object);
-  var index = -1,
-      length = path.length,
-      lastIndex = length - 1,
-      nested = object;
-
-  while (nested != null && ++index < length) {
-    var key = toKey$1(path[index]),
-        newValue = value;
-
-    if (key === '__proto__' || key === 'constructor' || key === 'prototype') {
-      return object;
-    }
-
-    if (index != lastIndex) {
-      var objValue = nested[key];
-      newValue = customizer ? customizer(objValue, key, nested) : undefined;
-
-      if (newValue === undefined) {
-        newValue = isObject(objValue) ? objValue : isIndex$1(path[index + 1]) ? [] : {};
-      }
-    }
-
-    assignValue(nested, key, newValue);
-    nested = nested[key];
-  }
-
-  return object;
-}
-
-var _baseSet = baseSet$1;
-
-var baseGet = _baseGet,
-    baseSet = _baseSet,
-    castPath$1 = _castPath;
-/**
- * The base implementation of  `_.pickBy` without support for iteratee shorthands.
- *
- * @private
- * @param {Object} object The source object.
- * @param {string[]} paths The property paths to pick.
- * @param {Function} predicate The function invoked per property.
- * @returns {Object} Returns the new object.
- */
-
-function basePickBy$1(object, paths, predicate) {
-  var index = -1,
-      length = paths.length,
-      result = {};
-
-  while (++index < length) {
-    var path = paths[index],
-        value = baseGet(object, path);
-
-    if (predicate(value, path)) {
-      baseSet(result, castPath$1(path, object), value);
-    }
-  }
-
-  return result;
-}
-
-var _basePickBy = basePickBy$1;
-
-/**
- * The base implementation of `_.hasIn` without support for deep paths.
- *
- * @private
- * @param {Object} [object] The object to query.
- * @param {Array|string} key The key to check.
- * @returns {boolean} Returns `true` if `key` exists, else `false`.
- */
-
-function baseHasIn$1(object, key) {
-  return object != null && key in Object(object);
-}
-
-var _baseHasIn = baseHasIn$1;
-
-var castPath = _castPath,
-    isArguments = isArguments_1,
-    isArray = isArray_1,
-    isIndex = _isIndex,
-    isLength = isLength_1,
-    toKey = _toKey;
-/**
- * Checks if `path` exists on `object`.
- *
- * @private
- * @param {Object} object The object to query.
- * @param {Array|string} path The path to check.
- * @param {Function} hasFunc The function to check properties.
- * @returns {boolean} Returns `true` if `path` exists, else `false`.
- */
-
-function hasPath$1(object, path, hasFunc) {
-  path = castPath(path, object);
-  var index = -1,
-      length = path.length,
-      result = false;
-
-  while (++index < length) {
-    var key = toKey(path[index]);
-
-    if (!(result = object != null && hasFunc(object, key))) {
-      break;
-    }
-
-    object = object[key];
-  }
-
-  if (result || ++index != length) {
-    return result;
-  }
-
-  length = object == null ? 0 : object.length;
-  return !!length && isLength(length) && isIndex(key, length) && (isArray(object) || isArguments(object));
-}
-
-var _hasPath = hasPath$1;
-
-var baseHasIn = _baseHasIn,
-    hasPath = _hasPath;
-/**
- * Checks if `path` is a direct or inherited property of `object`.
- *
- * @static
- * @memberOf _
- * @since 4.0.0
- * @category Object
- * @param {Object} object The object to query.
- * @param {Array|string} path The path to check.
- * @returns {boolean} Returns `true` if `path` exists, else `false`.
- * @example
- *
- * var object = _.create({ 'a': _.create({ 'b': 2 }) });
- *
- * _.hasIn(object, 'a');
- * // => true
- *
- * _.hasIn(object, 'a.b');
- * // => true
- *
- * _.hasIn(object, ['a', 'b']);
- * // => true
- *
- * _.hasIn(object, 'b');
- * // => false
- */
-
-function hasIn$1(object, path) {
-  return object != null && hasPath(object, path, baseHasIn);
-}
-
-var hasIn_1 = hasIn$1;
-
-var basePickBy = _basePickBy,
-    hasIn = hasIn_1;
-/**
- * The base implementation of `_.pick` without support for individual
- * property identifiers.
- *
- * @private
- * @param {Object} object The source object.
- * @param {string[]} paths The property paths to pick.
- * @returns {Object} Returns the new object.
- */
-
-function basePick$1(object, paths) {
-  return basePickBy(object, paths, function (value, path) {
-    return hasIn(object, path);
-  });
-}
-
-var _basePick = basePick$1;
-
-var flatten = flatten_1,
-    overRest = _overRest,
-    setToString = _setToString;
-/**
- * A specialized version of `baseRest` which flattens the rest array.
- *
- * @private
- * @param {Function} func The function to apply a rest parameter to.
- * @returns {Function} Returns the new function.
- */
-
-function flatRest$1(func) {
-  return setToString(overRest(func, undefined, flatten), func + '');
-}
-
-var _flatRest = flatRest$1;
-
-var basePick = _basePick,
-    flatRest = _flatRest;
-/**
- * Creates an object composed of the picked `object` properties.
- *
- * @static
- * @since 0.1.0
- * @memberOf _
- * @category Object
- * @param {Object} object The source object.
- * @param {...(string|string[])} [paths] The property paths to pick.
- * @returns {Object} Returns the new object.
- * @example
- *
- * var object = { 'a': 1, 'b': '2', 'c': 3 };
- *
- * _.pick(object, ['a', 'c']);
- * // => { 'a': 1, 'c': 3 }
- */
-
-var pick = flatRest(function (object, paths) {
-  return object == null ? {} : basePick(object, paths);
-});
-var pick_1 = pick;
-
-function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); if (enumerableOnly) { symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; }); } keys.push.apply(keys, symbols); } return keys; }
-
-function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; if (i % 2) { ownKeys(Object(source), true).forEach(function (key) { _defineProperty$1(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } } return target; }
-
-function getExposedProps(node) {
-  var props = pick_1(node, ["value", "label", "data", "actived", "expanded", "checked", "indeterminate", "loading"]);
-  return props;
-}
-
-function createNodeModel(node) {
-  var props = getExposedProps(node);
-
-  var model = _objectSpread(_objectSpread({}, props), {}, {
-    getLevel: function getLevel() {
-      return node.getLevel();
-    },
-    getIndex: function getIndex() {
-      return node.getIndex();
-    },
-    isFirst: function isFirst() {
-      return node.isFirst();
-    },
-    isLast: function isLast() {
-      return node.isLast();
-    },
-    isLeaf: function isLeaf() {
-      return node.isLeaf();
-    },
-    insertBefore: function insertBefore(newData) {
-      return node.insertBefore(newData);
-    },
-    insertAfter: function insertAfter(newData) {
-      return node.insertAfter(newData);
-    },
-    appendData: function appendData(data) {
-      return node.append(data);
-    },
-    getPath: function getPath() {
-      var nodes = node.getPath();
-      return nodes.map(function (item) {
-        return item.getModel();
-      });
-    },
-    getParent: function getParent() {
-      var _node$parent;
-
-      return (_node$parent = node.parent) === null || _node$parent === void 0 ? void 0 : _node$parent.getModel();
-    },
-    getParents: function getParents() {
-      var nodes = node.getParents();
-      return nodes.map(function (item) {
-        return item.getModel();
-      });
-    },
-    getRoot: function getRoot() {
-      var root = node.getRoot();
-      return root === null || root === void 0 ? void 0 : root.getModel();
-    },
-    getSiblings: function getSiblings() {
-      var nodes = node.getSiblings();
-      return nodes.map(function (item) {
-        return item.getModel();
-      });
-    },
-    getChildren: function getChildren(deep) {
-      var childrenModel = false;
-      var children = node.children;
-
-      if (Array.isArray(children)) {
-        if (children.length > 0) {
-          if (deep) {
-            var nodes = node.walk();
-            nodes.shift();
-            childrenModel = nodes.map(function (item) {
-              return item.getModel();
-            });
-          } else {
-            childrenModel = children.map(function (item) {
-              return item.getModel();
-            });
-          }
-        } else {
-          childrenModel = false;
-        }
-      } else if (typeof children === "boolean") {
-        childrenModel = children;
-      }
-
-      return childrenModel;
-    }
-  });
-
-  return model;
-}
-function updateNodeModel(model, node) {
-  var props = getExposedProps(node);
-  Object.assign(model, props);
-}
-
-export { _assignValue as _, _baseAssignValue as a, createNodeModel as c, updateNodeModel as u };
-//# sourceMappingURL=dep-5a5d372b.js.map

package/es/_chunks/dep-5a5d372b.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dep-5a5d372b.js","sources":["../../node_modules/lodash/_baseAssignValue.js","../../node_modules/lodash/_assignValue.js","../../node_modules/lodash/_baseSet.js","../../node_modules/lodash/_basePickBy.js","../../node_modules/lodash/_baseHasIn.js","../../node_modules/lodash/_hasPath.js","../../node_modules/lodash/hasIn.js","../../node_modules/lodash/_basePick.js","../../node_modules/lodash/_flatRest.js","../../node_modules/lodash/pick.js","../../src/_common/js/tree/tree-node-model.ts"],"sourcesContent":["var defineProperty = require('./_defineProperty');\n\n/**\n * The base implementation of `assignValue` and `assignMergeValue` without\n * value checks.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction baseAssignValue(object, key, value) {\n  if (key == '__proto__' && defineProperty) {\n    defineProperty(object, key, {\n      'configurable': true,\n      'enumerable': true,\n      'value': value,\n      'writable': true\n    });\n  } else {\n    object[key] = value;\n  }\n}\n\nmodule.exports = baseAssignValue;\n","var baseAssignValue = require('./_baseAssignValue'),\n    eq = require('./eq');\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 * Assigns `value` to `key` of `object` if the existing value is not equivalent\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction assignValue(object, key, value) {\n  var objValue = object[key];\n  if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||\n      (value === undefined && !(key in object))) {\n    baseAssignValue(object, key, value);\n  }\n}\n\nmodule.exports = assignValue;\n","var assignValue = require('./_assignValue'),\n    castPath = require('./_castPath'),\n    isIndex = require('./_isIndex'),\n    isObject = require('./isObject'),\n    toKey = require('./_toKey');\n\n/**\n * The base implementation of `_.set`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n */\nfunction baseSet(object, path, value, customizer) {\n  if (!isObject(object)) {\n    return object;\n  }\n  path = castPath(path, object);\n\n  var index = -1,\n      length = path.length,\n      lastIndex = length - 1,\n      nested = object;\n\n  while (nested != null && ++index < length) {\n    var key = toKey(path[index]),\n        newValue = value;\n\n    if (key === '__proto__' || key === 'constructor' || key === 'prototype') {\n      return object;\n    }\n\n    if (index != lastIndex) {\n      var objValue = nested[key];\n      newValue = customizer ? customizer(objValue, key, nested) : undefined;\n      if (newValue === undefined) {\n        newValue = isObject(objValue)\n          ? objValue\n          : (isIndex(path[index + 1]) ? [] : {});\n      }\n    }\n    assignValue(nested, key, newValue);\n    nested = nested[key];\n  }\n  return object;\n}\n\nmodule.exports = baseSet;\n","var baseGet = require('./_baseGet'),\n    baseSet = require('./_baseSet'),\n    castPath = require('./_castPath');\n\n/**\n * The base implementation of  `_.pickBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @param {Function} predicate The function invoked per property.\n * @returns {Object} Returns the new object.\n */\nfunction basePickBy(object, paths, predicate) {\n  var index = -1,\n      length = paths.length,\n      result = {};\n\n  while (++index < length) {\n    var path = paths[index],\n        value = baseGet(object, path);\n\n    if (predicate(value, path)) {\n      baseSet(result, castPath(path, object), value);\n    }\n  }\n  return result;\n}\n\nmodule.exports = basePickBy;\n","/**\n * The base implementation of `_.hasIn` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\nfunction baseHasIn(object, key) {\n  return object != null && key in Object(object);\n}\n\nmodule.exports = baseHasIn;\n","var castPath = require('./_castPath'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray'),\n    isIndex = require('./_isIndex'),\n    isLength = require('./isLength'),\n    toKey = require('./_toKey');\n\n/**\n * Checks if `path` exists on `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @param {Function} hasFunc The function to check properties.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n */\nfunction hasPath(object, path, hasFunc) {\n  path = castPath(path, object);\n\n  var index = -1,\n      length = path.length,\n      result = false;\n\n  while (++index < length) {\n    var key = toKey(path[index]);\n    if (!(result = object != null && hasFunc(object, key))) {\n      break;\n    }\n    object = object[key];\n  }\n  if (result || ++index != length) {\n    return result;\n  }\n  length = object == null ? 0 : object.length;\n  return !!length && isLength(length) && isIndex(key, length) &&\n    (isArray(object) || isArguments(object));\n}\n\nmodule.exports = hasPath;\n","var baseHasIn = require('./_baseHasIn'),\n    hasPath = require('./_hasPath');\n\n/**\n * Checks if `path` is a direct or inherited property of `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n *\n * var object = _.create({ 'a': _.create({ 'b': 2 }) });\n *\n * _.hasIn(object, 'a');\n * // => true\n *\n * _.hasIn(object, 'a.b');\n * // => true\n *\n * _.hasIn(object, ['a', 'b']);\n * // => true\n *\n * _.hasIn(object, 'b');\n * // => false\n */\nfunction hasIn(object, path) {\n  return object != null && hasPath(object, path, baseHasIn);\n}\n\nmodule.exports = hasIn;\n","var basePickBy = require('./_basePickBy'),\n    hasIn = require('./hasIn');\n\n/**\n * The base implementation of `_.pick` without support for individual\n * property identifiers.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @returns {Object} Returns the new object.\n */\nfunction basePick(object, paths) {\n  return basePickBy(object, paths, function(value, path) {\n    return hasIn(object, path);\n  });\n}\n\nmodule.exports = basePick;\n","var flatten = require('./flatten'),\n    overRest = require('./_overRest'),\n    setToString = require('./_setToString');\n\n/**\n * A specialized version of `baseRest` which flattens the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n */\nfunction flatRest(func) {\n  return setToString(overRest(func, undefined, flatten), func + '');\n}\n\nmodule.exports = flatRest;\n","var basePick = require('./_basePick'),\n    flatRest = require('./_flatRest');\n\n/**\n * Creates an object composed of the picked `object` properties.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The source object.\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.pick(object, ['a', 'c']);\n * // => { 'a': 1, 'c': 3 }\n */\nvar pick = flatRest(function(object, paths) {\n  return object == null ? {} : basePick(object, paths);\n});\n\nmodule.exports = pick;\n","import pick from 'lodash/pick';\nimport { TreeNode } from './tree-node';\nimport {\n  TypeTreeNodeModel,\n  TypeTreeNodeData,\n  TypeTreeItem,\n  TreeNodeModelProps,\n} from './types';\n\n// 获取节点需要暴露的属性\nfunction getExposedProps(node: TreeNode): TreeNodeModelProps {\n  const props = pick(node, [\n    'value',\n    'label',\n    'data',\n    'actived',\n    'expanded',\n    'checked',\n    'indeterminate',\n    'loading',\n  ]) as TreeNodeModelProps;\n  return props;\n}\n\n// 封装对外暴露的对象\nexport function createNodeModel(node: TreeNode): TypeTreeNodeModel {\n  const props = getExposedProps(node);\n\n  const model: TypeTreeNodeModel = {\n    ...props,\n\n    // 获取节点所处层级\n    getLevel() {\n      return node.getLevel();\n    },\n\n    // 获取节点在 children 中的位置\n    getIndex() {\n      return node.getIndex();\n    },\n\n    // 判断节点是否为 children 中的第一个节点\n    isFirst() {\n      return node.isFirst();\n    },\n\n    // 判断节点是否为 children 中的最后一个节点\n    isLast() {\n      return node.isLast();\n    },\n\n    // 判断节点是否为叶节点\n    isLeaf() {\n      return node.isLeaf();\n    },\n\n    // 插入数据到节点之前\n    insertBefore(newData: TypeTreeItem) {\n      return node.insertBefore(newData);\n    },\n\n    // 插入数据到节点之后\n    insertAfter(newData: TypeTreeItem) {\n      return node.insertAfter(newData);\n    },\n\n    // 给当前节点添加子节点数据\n    appendData(data: TypeTreeNodeData | TypeTreeNodeData[]) {\n      return node.append(data);\n    },\n\n    // 返回路径节点数据集合\n    getPath(): TypeTreeNodeModel[] {\n      const nodes = node.getPath();\n      return nodes.map((item: TreeNode) => item.getModel());\n    },\n\n    // 获取单个父节点数据\n    getParent(): TypeTreeNodeModel {\n      return node.parent?.getModel();\n    },\n\n    // 获取所有父节点数据\n    getParents(): TypeTreeNodeModel[] {\n      const nodes = node.getParents();\n      return nodes.map((item: TreeNode) => item.getModel());\n    },\n\n    // 获取根节点\n    getRoot(): TypeTreeNodeModel {\n      const root = node.getRoot();\n      return root?.getModel();\n    },\n\n    // 获取兄弟节点，包含自己在内\n    getSiblings(): TypeTreeNodeModel[] {\n      const nodes = node.getSiblings();\n      return nodes.map((item: TreeNode) => item.getModel());\n    },\n\n    // 返回当前节点的第一层子节点数据集合\n    getChildren(deep?: boolean): boolean | TypeTreeNodeModel[] {\n      let childrenModel: boolean | TypeTreeNodeModel[] = false;\n      const { children } = node;\n      if (Array.isArray(children)) {\n        if (children.length > 0) {\n          if (deep) {\n            const nodes = node.walk();\n            nodes.shift();\n            childrenModel = nodes.map((item) => item.getModel());\n          } else {\n            childrenModel = children.map((item) => item.getModel());\n          }\n        } else {\n          childrenModel = false;\n        }\n      } else if (typeof children === 'boolean') {\n        childrenModel = children;\n      }\n      return childrenModel;\n    },\n  };\n  return model;\n}\n\n// 更新封装对象\nexport function updateNodeModel(model: TypeTreeNodeModel, node: TreeNode) {\n  // 同步节点属性\n  const props = getExposedProps(node);\n  Object.assign(model, props);\n}\n"],"names":["defineProperty","require$$0","baseAssignValue","object","key","value","_baseAssignValue","eq","require$$1","objectProto","Object","prototype","hasOwnProperty","assignValue","objValue","call","undefined","_assignValue","castPath","isIndex","require$$2","isObject","require$$3","toKey","require$$4","baseSet","path","customizer","index","length","lastIndex","nested","newValue","_baseSet","baseGet","basePickBy","paths","predicate","result","_basePickBy","baseHasIn","_baseHasIn","isArguments","isArray","isLength","require$$5","hasPath","hasFunc","_hasPath","hasIn","hasIn_1","basePick","_basePick","flatten","overRest","setToString","flatRest","func","_flatRest","pick","pick_1","node","props","getExposedProps","model","getLevel","getIndex","isFirst","isLast","isLeaf","insertBefore","newData","insertAfter","appendData","data","append","getPath","nodes","map","item","getModel","getParent","parent","getParents","getRoot","root","getSiblings","getChildren","deep","childrenModel","children","Array","walk","shift","assign"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA,IAAIA,cAAc,GAAGC,eAArB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,iBAAT,CAAyBC,MAAzB,EAAiCC,GAAjC,EAAsCC,KAAtC,EAA6C;AAC3C,MAAID,GAAG,IAAI,WAAP,IAAsBJ,cAA1B,EAA0C;AACxCA,IAAAA,cAAc,CAACG,MAAD,EAASC,GAAT,EAAc;AAC1B,sBAAgB,IADU;AAE1B,oBAAc,IAFY;AAG1B,eAASC,KAHiB;AAI1B,kBAAY;AAJc,KAAd,CAAd;AAMD,GAPD,MAOO;AACLF,IAAAA,MAAM,CAACC,GAAD,CAAN,GAAcC,KAAd;AACD;AACF;;IAEDC,gBAAc,GAAGJ;;ACxBjB,IAAIA,eAAe,GAAGD,gBAAtB;AAAA,IACIM,EAAE,GAAGC,IADT;AAGA;;AACA,IAAIC,WAAW,GAAGC,MAAM,CAACC,SAAzB;AAEA;;AACA,IAAIC,cAAc,GAAGH,WAAW,CAACG,cAAjC;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,aAAT,CAAqBV,MAArB,EAA6BC,GAA7B,EAAkCC,KAAlC,EAAyC;AACvC,MAAIS,QAAQ,GAAGX,MAAM,CAACC,GAAD,CAArB;;AACA,MAAI,EAAEQ,cAAc,CAACG,IAAf,CAAoBZ,MAApB,EAA4BC,GAA5B,KAAoCG,EAAE,CAACO,QAAD,EAAWT,KAAX,CAAxC,KACCA,KAAK,KAAKW,SAAV,IAAuB,EAAEZ,GAAG,IAAID,MAAT,CAD5B,EAC+C;AAC7CD,IAAAA,eAAe,CAACC,MAAD,EAASC,GAAT,EAAcC,KAAd,CAAf;AACD;AACF;;IAEDY,YAAc,GAAGJ;;AC3BjB,IAAIA,WAAW,GAAGZ,YAAlB;AAAA,IACIiB,UAAQ,GAAGV,SADf;AAAA,IAEIW,SAAO,GAAGC,QAFd;AAAA,IAGIC,QAAQ,GAAGC,UAHf;AAAA,IAIIC,OAAK,GAAGC,MAJZ;AAMA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,SAAT,CAAiBtB,MAAjB,EAAyBuB,IAAzB,EAA+BrB,KAA/B,EAAsCsB,UAAtC,EAAkD;AAChD,MAAI,CAACN,QAAQ,CAAClB,MAAD,CAAb,EAAuB;AACrB,WAAOA,MAAP;AACD;;AACDuB,EAAAA,IAAI,GAAGR,UAAQ,CAACQ,IAAD,EAAOvB,MAAP,CAAf;AAEA,MAAIyB,KAAK,GAAG,CAAC,CAAb;AAAA,MACIC,MAAM,GAAGH,IAAI,CAACG,MADlB;AAAA,MAEIC,SAAS,GAAGD,MAAM,GAAG,CAFzB;AAAA,MAGIE,MAAM,GAAG5B,MAHb;;AAKA,SAAO4B,MAAM,IAAI,IAAV,IAAkB,EAAEH,KAAF,GAAUC,MAAnC,EAA2C;AACzC,QAAIzB,GAAG,GAAGmB,OAAK,CAACG,IAAI,CAACE,KAAD,CAAL,CAAf;AAAA,QACII,QAAQ,GAAG3B,KADf;;AAGA,QAAID,GAAG,KAAK,WAAR,IAAuBA,GAAG,KAAK,aAA/B,IAAgDA,GAAG,KAAK,WAA5D,EAAyE;AACvE,aAAOD,MAAP;AACD;;AAED,QAAIyB,KAAK,IAAIE,SAAb,EAAwB;AACtB,UAAIhB,QAAQ,GAAGiB,MAAM,CAAC3B,GAAD,CAArB;AACA4B,MAAAA,QAAQ,GAAGL,UAAU,GAAGA,UAAU,CAACb,QAAD,EAAWV,GAAX,EAAgB2B,MAAhB,CAAb,GAAuCf,SAA5D;;AACA,UAAIgB,QAAQ,KAAKhB,SAAjB,EAA4B;AAC1BgB,QAAAA,QAAQ,GAAGX,QAAQ,CAACP,QAAD,CAAR,GACPA,QADO,GAENK,SAAO,CAACO,IAAI,CAACE,KAAK,GAAG,CAAT,CAAL,CAAP,GAA2B,EAA3B,GAAgC,EAFrC;AAGD;AACF;;AACDf,IAAAA,WAAW,CAACkB,MAAD,EAAS3B,GAAT,EAAc4B,QAAd,CAAX;AACAD,IAAAA,MAAM,GAAGA,MAAM,CAAC3B,GAAD,CAAf;AACD;;AACD,SAAOD,MAAP;AACD;;IAED8B,QAAc,GAAGR;;AClDjB,IAAIS,OAAO,GAAGjC,QAAd;AAAA,IACIwB,OAAO,GAAGjB,QADd;AAAA,IAEIU,UAAQ,GAAGE,SAFf;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASe,YAAT,CAAoBhC,MAApB,EAA4BiC,KAA5B,EAAmCC,SAAnC,EAA8C;AAC5C,MAAIT,KAAK,GAAG,CAAC,CAAb;AAAA,MACIC,MAAM,GAAGO,KAAK,CAACP,MADnB;AAAA,MAEIS,MAAM,GAAG,EAFb;;AAIA,SAAO,EAAEV,KAAF,GAAUC,MAAjB,EAAyB;AACvB,QAAIH,IAAI,GAAGU,KAAK,CAACR,KAAD,CAAhB;AAAA,QACIvB,KAAK,GAAG6B,OAAO,CAAC/B,MAAD,EAASuB,IAAT,CADnB;;AAGA,QAAIW,SAAS,CAAChC,KAAD,EAAQqB,IAAR,CAAb,EAA4B;AAC1BD,MAAAA,OAAO,CAACa,MAAD,EAASpB,UAAQ,CAACQ,IAAD,EAAOvB,MAAP,CAAjB,EAAiCE,KAAjC,CAAP;AACD;AACF;;AACD,SAAOiC,MAAP;AACD;;IAEDC,WAAc,GAAGJ;;;;;;;;;;;ACrBjB,SAASK,WAAT,CAAmBrC,MAAnB,EAA2BC,GAA3B,EAAgC;AAC9B,SAAOD,MAAM,IAAI,IAAV,IAAkBC,GAAG,IAAIM,MAAM,CAACP,MAAD,CAAtC;AACD;;IAEDsC,UAAc,GAAGD;;ACZjB,IAAItB,QAAQ,GAAGjB,SAAf;AAAA,IACIyC,WAAW,GAAGlC,aADlB;AAAA,IAEImC,OAAO,GAAGvB,SAFd;AAAA,IAGID,OAAO,GAAGG,QAHd;AAAA,IAIIsB,QAAQ,GAAGpB,UAJf;AAAA,IAKID,KAAK,GAAGsB,MALZ;AAOA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,SAAT,CAAiB3C,MAAjB,EAAyBuB,IAAzB,EAA+BqB,OAA/B,EAAwC;AACtCrB,EAAAA,IAAI,GAAGR,QAAQ,CAACQ,IAAD,EAAOvB,MAAP,CAAf;AAEA,MAAIyB,KAAK,GAAG,CAAC,CAAb;AAAA,MACIC,MAAM,GAAGH,IAAI,CAACG,MADlB;AAAA,MAEIS,MAAM,GAAG,KAFb;;AAIA,SAAO,EAAEV,KAAF,GAAUC,MAAjB,EAAyB;AACvB,QAAIzB,GAAG,GAAGmB,KAAK,CAACG,IAAI,CAACE,KAAD,CAAL,CAAf;;AACA,QAAI,EAAEU,MAAM,GAAGnC,MAAM,IAAI,IAAV,IAAkB4C,OAAO,CAAC5C,MAAD,EAASC,GAAT,CAApC,CAAJ,EAAwD;AACtD;AACD;;AACDD,IAAAA,MAAM,GAAGA,MAAM,CAACC,GAAD,CAAf;AACD;;AACD,MAAIkC,MAAM,IAAI,EAAEV,KAAF,IAAWC,MAAzB,EAAiC;AAC/B,WAAOS,MAAP;AACD;;AACDT,EAAAA,MAAM,GAAG1B,MAAM,IAAI,IAAV,GAAiB,CAAjB,GAAqBA,MAAM,CAAC0B,MAArC;AACA,SAAO,CAAC,CAACA,MAAF,IAAYe,QAAQ,CAACf,MAAD,CAApB,IAAgCV,OAAO,CAACf,GAAD,EAAMyB,MAAN,CAAvC,KACJc,OAAO,CAACxC,MAAD,CAAP,IAAmBuC,WAAW,CAACvC,MAAD,CAD1B,CAAP;AAED;;IAED6C,QAAc,GAAGF;;ACtCjB,IAAIN,SAAS,GAAGvC,UAAhB;AAAA,IACI6C,OAAO,GAAGtC,QADd;AAGA;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,SAASyC,OAAT,CAAe9C,MAAf,EAAuBuB,IAAvB,EAA6B;AAC3B,SAAOvB,MAAM,IAAI,IAAV,IAAkB2C,OAAO,CAAC3C,MAAD,EAASuB,IAAT,EAAec,SAAf,CAAhC;AACD;;IAEDU,OAAc,GAAGD;;ACjCjB,IAAId,UAAU,GAAGlC,WAAjB;AAAA,IACIgD,KAAK,GAAGzC,OADZ;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAAS2C,UAAT,CAAkBhD,MAAlB,EAA0BiC,KAA1B,EAAiC;AAC/B,SAAOD,UAAU,CAAChC,MAAD,EAASiC,KAAT,EAAgB,UAAS/B,KAAT,EAAgBqB,IAAhB,EAAsB;AACrD,WAAOuB,KAAK,CAAC9C,MAAD,EAASuB,IAAT,CAAZ;AACD,GAFgB,CAAjB;AAGD;;IAED0B,SAAc,GAAGD;;AClBjB,IAAIE,OAAO,GAAGpD,SAAd;AAAA,IACIqD,QAAQ,GAAG9C,SADf;AAAA,IAEI+C,WAAW,GAAGnC,YAFlB;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASoC,UAAT,CAAkBC,IAAlB,EAAwB;AACtB,SAAOF,WAAW,CAACD,QAAQ,CAACG,IAAD,EAAOzC,SAAP,EAAkBqC,OAAlB,CAAT,EAAqCI,IAAI,GAAG,EAA5C,CAAlB;AACD;;IAEDC,SAAc,GAAGF;;ACfjB,IAAIL,QAAQ,GAAGlD,SAAf;AAAA,IACIuD,QAAQ,GAAGhD,SADf;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,IAAImD,IAAI,GAAGH,QAAQ,CAAC,UAASrD,MAAT,EAAiBiC,KAAjB,EAAwB;AAC1C,SAAOjC,MAAM,IAAI,IAAV,GAAiB,EAAjB,GAAsBgD,QAAQ,CAAChD,MAAD,EAASiC,KAAT,CAArC;AACD,CAFkB,CAAnB;IAIAwB,MAAc,GAAGD;;;;;;ACdjB,wBAAA,CAAyBE,IAAzB,EAA6D;MACrDC,QAAQH,OAAKE,MAAM,CACvB,OADuB,EAEvB,OAFuB,EAGvB,MAHuB,EAIvB,SAJuB,EAKvB,UALuB,EAMvB,SANuB,EAOvB,eAPuB,EAQvB,SARuB;SAUlBC;;;yBAIuBD,MAAmC;MAC3DC,QAAQC,gBAAgBF;;MAExBG,wCACDF;AAGHG,IAAAA,8BAAW;aACFJ,KAAKI,QAAL;;AAITC,IAAAA,8BAAW;aACFL,KAAKK,QAAL;;AAITC,IAAAA,4BAAU;aACDN,KAAKM,OAAL;;AAITC,IAAAA,0BAAS;aACAP,KAAKO,MAAL;;AAITC,IAAAA,0BAAS;aACAR,KAAKQ,MAAL;;AAITC,IAAAA,oCAAaC,SAAuB;aAC3BV,KAAKS,YAAL,CAAkBC,OAAlB;;AAITC,IAAAA,kCAAYD,SAAuB;aAC1BV,KAAKW,WAAL,CAAiBD,OAAjB;;AAITE,IAAAA,gCAAWC,MAA6C;aAC/Cb,KAAKc,MAAL,CAAYD,IAAZ;;AAITE,IAAAA,4BAA+B;UACvBC,QAAQhB,KAAKe,OAAL;aACPC,MAAMC,GAAN,CAAU,UAACC,IAAD;AAAA,eAAoBA,KAAKC,QAAL,EAApB;AAAA,OAAV;;AAITC,IAAAA,gCAA+B;AAAA;;6BACtBpB,KAAKqB,uDAAL,aAAaF,QAAb;;AAITG,IAAAA,kCAAkC;UAC1BN,QAAQhB,KAAKsB,UAAL;aACPN,MAAMC,GAAN,CAAU,UAACC,IAAD;AAAA,eAAoBA,KAAKC,QAAL,EAApB;AAAA,OAAV;;AAITI,IAAAA,4BAA6B;UACrBC,OAAOxB,KAAKuB,OAAL;aACNC,iBAAAA,2BAAAA,KAAML,QAAN;;AAITM,IAAAA,oCAAmC;UAC3BT,QAAQhB,KAAKyB,WAAL;aACPT,MAAMC,GAAN,CAAU,UAACC,IAAD;AAAA,eAAoBA,KAAKC,QAAL,EAApB;AAAA,OAAV;;AAITO,IAAAA,kCAAYC,MAA+C;UACrDC,gBAA+C;UAC3CC,WAAa7B,KAAb6B;;UACJC,MAAMhD,OAAN,CAAc+C,QAAd,GAAyB;YACvBA,SAAS7D,MAAT,GAAkB,GAAG;cACnB2D,MAAM;gBACFX,QAAQhB,KAAK+B,IAAL;kBACRC;4BACUhB,MAAMC,GAAN,CAAU,UAACC,IAAD;AAAA,qBAAUA,KAAKC,QAAL,EAAV;AAAA,aAAV;iBACX;4BACWU,SAASZ,GAAT,CAAa,UAACC,IAAD;AAAA,qBAAUA,KAAKC,QAAL,EAAV;AAAA,aAAb;;eAEb;0BACW;;iBAET,OAAOU,QAAP,KAAoB,WAAW;wBACxBA;;;aAEXD;;;;SAGJzB;;yBAIuBA,OAA0BH,MAAgB;MAElEC,QAAQC,gBAAgBF;SACvBiC,OAAO9B,OAAOF;;;;;"}

package/es/_chunks/dep-5c81b722.js

@@ -1,47 +0,0 @@
-/**
- * tdesign v0.19.1
- * (c) 2021 tdesign
- * @license MIT
- */
-
-import './dep-3796d701.js';
-import { i as isFunction_1 } from './dep-dabea1d1.js';
-import './dep-4cfb170f.js';
-import { i as isLength_1 } from './dep-41d15e2c.js';
-
-var isFunction = isFunction_1,
-    isLength = isLength_1;
-/**
- * Checks if `value` is array-like. A value is considered array-like if it's
- * not a function and has a `value.length` that's an integer greater than or
- * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.
- *
- * @static
- * @memberOf _
- * @since 4.0.0
- * @category Lang
- * @param {*} value The value to check.
- * @returns {boolean} Returns `true` if `value` is array-like, else `false`.
- * @example
- *
- * _.isArrayLike([1, 2, 3]);
- * // => true
- *
- * _.isArrayLike(document.body.children);
- * // => true
- *
- * _.isArrayLike('abc');
- * // => true
- *
- * _.isArrayLike(_.noop);
- * // => false
- */
-
-function isArrayLike(value) {
-  return value != null && isLength(value.length) && !isFunction(value);
-}
-
-var isArrayLike_1 = isArrayLike;
-
-export { isArrayLike_1 as i };
-//# sourceMappingURL=dep-5c81b722.js.map

package/es/_chunks/dep-5c81b722.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dep-5c81b722.js","sources":["../../node_modules/lodash/isArrayLike.js"],"sourcesContent":["var isFunction = require('./isFunction'),\n    isLength = require('./isLength');\n\n/**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\nfunction isArrayLike(value) {\n  return value != null && isLength(value.length) && !isFunction(value);\n}\n\nmodule.exports = isArrayLike;\n"],"names":["isFunction","require$$0","isLength","require$$1","isArrayLike","value","length","isArrayLike_1"],"mappings":";;;;;;;;;;;AAAA,IAAIA,UAAU,GAAGC,YAAjB;AAAA,IACIC,QAAQ,GAAGC,UADf;AAGA;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,WAAT,CAAqBC,KAArB,EAA4B;AAC1B,SAAOA,KAAK,IAAI,IAAT,IAAiBH,QAAQ,CAACG,KAAK,CAACC,MAAP,CAAzB,IAA2C,CAACN,UAAU,CAACK,KAAD,CAA7D;AACD;;IAEDE,aAAc,GAAGH;;;;"}